Convexity Properties Associated with Nonconvex Quadratic Matrix Functions and Applications to Quadratic Programming
- 268 Downloads
We establish several convexity results which are concerned with nonconvex quadratic matrix (QM) functions: strong duality of quadratic matrix programming problems, convexity of the image of mappings comprised of several QM functions and existence of a corresponding S-lemma. As a consequence of our results, we prove that a class of quadratic problems involving several functions with similar matrix terms has a zero duality gap. We present applications to robust optimization, to solution of linear systems immune to implementation errors and to the problem of computing the Chebyshev center of an intersection of balls.
KeywordsQuadratic matrix functions Strong duality Extended S-lemma Semidefinite relaxation Convexity of quadratic maps
Unable to display preview. Download preview PDF.
- 2.Jakubovič, V.A.: The S-procedure in nonlinear control theory. Vestn. Leningr. Univ. 1, 62–77 (1971) Google Scholar
- 3.Fradkov, A.L., Yakubovich, V.A.: The S-procedure and the duality relation in convex quadratic programming problems. Vestn. Leningr. Univ. 155(1), 81–87 (1973) Google Scholar
- 12.Huang, Y., Zhang, S.: Complex matrix decomposition and quadratic programming. Technical Report (2005) Google Scholar
- 18.Pataki, G.: The geometry of semidefinite programming. In: Handbook of Semidefinite Programming. Internat. Ser. Oper. Res. Management Sci., vol. 27, pp. 29–65. Kluwer Academic, Dordrecht (2000) Google Scholar