On the Low Rank Solutions for Linear Matrix Inequalities

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 quadratic maps. Discrete Computat. Geometry (1995) 12:189–202Crossref, Google Scholar
• Barvinok A. A remark on the rank of positive semidefinite matrices subject to affine constraints. Discrete Computat. Geometry (2001) 25:23–31Crossref, Google Scholar
• Biswas P., Ye Y. Semidefinite programming for ad hoc wireless sensor network. Proc. 3rd Internat. Sympos. Inform. Processing Sensor Networks (2004) Berkeley, CA:46–54Crossref, Google Scholar
• Biswas P., Liang T. C., Toh K. C., Ye Y. An SDP based approach for anchor-free 3D graph realization. (2005) . Working paper, Stanford University, Palo Alto, CAGoogle Scholar
• Bohnenblust F. Joint positiveness of matrices. (1948) . Unpublished manuscript. http://orion.math.uwaterloo.ca/∼hwolkowi/henry/book/fronthandbk.d/Bohnenblust.pdfGoogle Scholar
• Friedland S., Loewy R. Subspaces of symmetric matrices containing matrices with a multiple first egenvalue. Pacific J. Math. (1976) 62:389–399Crossref, Google Scholar
• Hoffman A. J. On approximate solutions of systems of linear inequalities. J. Res. National Bureau Standards (1952) 49:263–265Crossref, Google Scholar
• Huang Y., Zhang S. Complex matrix decomposition and quadratic programming. Math. Oper. Res. (2007) 32:758–768Link, Google Scholar
• Jiriart-Urruty J.-B., Torki M. Permanently going back and forth between the “quadratic world” and the “convexity world” in optimization. Appl. Math. Optim. (2002) 45:169–184Crossref, Google Scholar
• Luo Z. Q., Sturm J. F., Wolkowicz H., Saigal R., Vandenberghe L. Error analysis. Handbook of Semidefinite Programming: Theory, Algorithms, and Applications (2000) (Kluwer Academic Publishers, Dordrecht, The Netherlands) 163–189Crossref, Google Scholar
• Pang J. S. Error bounds in mathematical programming. Math. Programming (1997) 79:299–332Crossref, 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
• Pfender F., Ziegler G. M. Kissing numbers, sphere packings, and some unexpected proofs. Notices Amer. Math. Soc. (2004) 51(8):873–883Google Scholar
• Pólik I., Terlaky T. A survey of the S-lemma. SIAM Rev. (2007) 49:371–418Crossref, Google Scholar
• Polyak B. T. Convexity of quadratic transformations and its use in control and optimization. J. Optim. Theory Appl. (1998) 99:553–583Crossref, Google Scholar
• Sturm J. F. Error bounds for linear matrix inequalities. SIAM J. Optim. (2000) 10:1228–1248Crossref, Google Scholar
• Sturm J. F., Zhang S. On cones of nonnegative quadratic functions. Math. Oper. Res. (2003) 28:246–267Link, Google Scholar
• Ye Y., Zhang S. New results on quadratic minimization. SIAM J. Optim. (2003) 14:245–267Crossref, Google Scholar
• Zhang S. Global error bounds for convex conic problems. SIAM J. Optim. (2000) 10:836–851Crossref, Google Scholar