On the low rank solutions for linear matrix inequalities

Mathematics of Operations Research

Volumn 33, Issue 4, 2008, Pages 965-975

  Ai, Wenbao ^a   Huang, Yongwei ^b   Zhang, Shuzhong ^b  

^a BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATIONS   (China)

^b CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Joint numerical range; Linear matrix inequality; Rank reduction

Indexed keywords

DELAY CONTROL SYSTEMS; FUZZY CONTROL; LINEAR CONTROL SYSTEMS; SWITCHING SYSTEMS; UNCERTAIN SYSTEMS;

JOINT NUMERICAL RANGE; LINEAR MATRIX INEQUALITY; LOW RANKS; NEW RESULTS; POLYNOMIAL-TIME; RANK REDUCTION;

LINEAR MATRIX INEQUALITIES;

EID: 61449262801     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1080.0331     Document Type: Article

References (20)

1. Au-Yeung, Y.-H., Y. T. Poon. 1979. A remark on the convexity and positive definiteness concerning Hermitian matrices. Southeast Asian Bull. Math. 3 85-92.
2. Barvinok, A. 1995. Problems of distance geometry and convex properties of quadratic maps. Discrete Computat. Geometry 12 189-202.
3. Barvinok, A. 2001. A remark on the rank of positive semidefinite matrices subject to affine constraints. Discrete Computat. Geometry 25 23-31.
4. Biswas, P., Y. Ye. 2004. Semidefinite programming for ad hoc wireless sensor network. Proc. 3rd Internat. Sympos. Inform. Processing Sensor Networks, Berkeley, CA, 46-54.
5. Biswas, P., T. C. Liang, K. C. Toh, Y. Ye. 2005. An SDP based approach for anchor-free 3D graph realization. Working paper, Stanford University, Palo Alto, CA.
6. Bohnenblust, F. 1948. Joint positiveness of matrices. Unpublished manuscript, http://orion.math.uwaterloo.ca/~hwolkowi/he.nry/book/-fronthandbk.d/ Bohnenblust.pdf.
7. Friedland, S., R. Loewy. 1976. Subspaces of symmetric matrices containing matrices with a multiple first egenvalue. Pacific J. Math. 62 389-399.
8. Hoffman, A. J. 1952. On approximate solutions of systems of linear inequalities. J. Res. National Bureau Standards 49 263-265.
9. Huang, Y., S. Zhang. 2007. Complex matrix decomposition and quadratic programming. Math. Oper: Res. 32 758-768.
10. Jiriart-Urruty, J.-B., M. Torki. 2002. Permanently going back and forth between the "quadratic world" and the "convexity world" in optimization. Appl. Math. Optim. 45 169-184.
11. Luo, Z. Q., J. F. Sturm. 2000. Error analysis. H. Wolkowicz, R. Saigal, L. Vandenberghe, eds. Handbook of Semidefinite Programming:Theory, Algorithms, and Applications. Kluwer Academic Publishers, Dordrecht, The Netherlands, 163-189.
12. Pang, J. S. 1997. Error bounds in mathematical programming. Math. Programming 79 299-332.
13. Pataki, G. 1998. On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues. Math. Oper. Res. 23 339-358.
14. Prender, F., G. M. Ziegler. 2004. Kissing numbers, sphere packings, and some unexpected proofs. Notices Amer. Math. Soc. 51(8) 873-883.
15. Pólik, I., T. Terlaky. 2007. A survey of the S-lemma. SIAM Rev. 49 371-418.
16. Polyak, B. T. 1998. Convexity of quadratic transformations and its use in control and optimization. J. Optim. Theory Appl. 99 553-583.
17. Sturm, J. F. 2000. Error bounds for linear matrix inequalities. SIAM J. Optim. 10 1228-1248.
18. Sturm., J. F., S. Zhang. 2003. On cones of nonnegative quadratic functions. Math. Oper. Res. 28 246-267.
19. Ye, Y., S. Zhang. 2003. New results on quadratic minimization.. SIAM J. Optim. 14 245-267.
20. Zhang, S. 2000. Global error bounds for convex conic problems. SIAM J. Optim. 10 836-851.