Complex Matrix Decomposition and Quadratic Programming

References

• Au-Yeung Y.-H., Poon Y. T. A remark on the convexity and positive definiteness concerning Hermitian matrices. Southeast Asian Bull. Math. (1979) 3:85–92Google Scholar
• Barvinok A. Problems of distance geometry and convex properties of quadartic maps. Discrete Comput. Geometry (1995) 12:189–202Crossref, Google Scholar
• Brickman L. On the field of values of a matrix. Proc. Amer. Math. Soc. (1961) 12:61–66Crossref, Google Scholar
• Fradkov A. L., Yakubovich V. A. The S-procedure and duality relations in nonconvex problems of quadratic programming. (1979) 6(Vestnik Leningrad University, Leningrad, Russia) 101–109English translation. Original Russian publication in Vestnik Leningradskogo Universiteta, Seriya Matematika, No. 1, 1973Google Scholar
• Hausdorff F. Der Wertvorrat einer Bilinearform. Mathematische Zeitschrift (1919) 3:314–316Crossref, Google Scholar
• Pataki G. On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues. Math. Oper. Res. (1998) 23:339–358Link, Google Scholar
• Pólik I., Terlaky T. S-lemma: A survey. (2006) . Technical report. McMaster University, Hamilton, Ontario, CanadaGoogle Scholar
• Polyak B. T. Convexity of quadratic transformations and its use in control and optimization. J. Optim. Theory Appl. (1998) 99:53–583Crossref, Google Scholar
• Sturm J. F., Zhang S. On cones of nonnegative quadratic functions. Math. Oper. Res. (2003) 28:246–267Link, Google Scholar
• Ye Y. Linear conic programming.. (2004) . Manuscript, Stanford University, Stanford, CAGoogle Scholar
• Ye Y., Zhang S. New results on quadratic minimization. SIAM J. Optim. (2003) 14:245–267Crossref, Google Scholar