Nonconvex Quadratic Programming, Semidefinite Relaxations and Randomization Algorithms in Information and Decision Systems

Nonconvex quadratic optimization problems and the methods for their analysis have been on the center stage of information and decision systems for the past 50 years. Although most of these problems are very complex in general, all of them may be relaxed to semidefinite programs. In many cases, this relaxation is tight or it may be bounded. The solution to those programs facilitates the solution to the original nonconvex problem, notably via efficient randomization techniques. Engineering applications of nonconvex quadratic programming and related solution techniques are virtually infinite. Examples extracted from the current literature on information and decision systems are provided. These examples include network optimization problems, linear and nonlinear control problems and important linear algebra problems.

[1]  J. P. Lasalle,et al.  Absolute Stability of Regulator Systems , 1964 .

[2]  R. J. Paul,et al.  Optimization Theory: The Finite Dimensional Case , 1977 .

[3]  F. Uhlig A recurring theorem about pairs of quadratic forms and extensions: a survey , 1979 .

[4]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1981 .

[5]  M. Safonov Stability margins of diagonally perturbed multivariable feedback systems , 1982 .

[6]  John C. Doyle Analysis of Feedback Systems with Structured Uncertainty , 1982 .

[7]  Warren P. Adams,et al.  A hierarchy of relaxation between the continuous and convex hull representations , 1990 .

[8]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[9]  Charles R. Johnson,et al.  Topics in Matrix Analysis , 1991 .

[10]  Alexander Schrijver,et al.  Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

[11]  V. Yakubovich Nonconvex optimization problem: the infinite-horizon linear-quadratic control problem with quadratic constraints , 1992 .

[12]  Andrew Packard,et al.  The complex structured singular value , 1993, Autom..

[13]  A. Megretski Necessary and sufficient conditions of stability: a multiloop generalization of the circle criterion , 1993, IEEE Trans. Autom. Control..

[14]  Hanif D. Sherali,et al.  A Hierarchy of Relaxations and Convex Hull Characterizations for Mixed-integer Zero-one Programming Problems , 1994, Discret. Appl. Math..

[15]  David P. Williamson,et al.  Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.

[16]  Charrissa Y. Lin,et al.  Towards optimal strain actuated aeroelastic control , 1996 .

[17]  E. Feron,et al.  Analysis and synthesis of robust control systems via parameter-dependent Lyapunov functions , 1996, IEEE Trans. Autom. Control..

[18]  Stephen P. Boyd,et al.  Semidefinite Programming , 1996, SIAM Rev..

[19]  Michel X. Goemans,et al.  Semideenite Programming in Combinatorial Optimization , 1999 .

[20]  Y. Nesterov Quality of semidefinite relaxation for nonconvex quadratic optimization , 1997 .

[21]  A. Rantzer,et al.  System analysis via integral quadratic constraints , 1997, IEEE Trans. Autom. Control..

[22]  Eric Feron,et al.  Estimating the conservatism of Popov's criterion for real parametric uncertainties , 1997 .

[23]  Y. Ye,et al.  Semidefinite Relaxations, Multivariate Normal Distributions, and Order Statistics , 1998 .

[24]  Laurent El Ghaoui,et al.  Robust Solutions to Uncertain Semidefinite Programs , 1998, SIAM J. Optim..

[25]  E. Yaz Linear Matrix Inequalities In System And Control Theory , 1998, Proceedings of the IEEE.

[26]  Raymond A. DeCarlo,et al.  Switched Controller Synthesis for the Quadratic Stabilisation of a Pair of Unstable Linear Systems , 1998, Eur. J. Control.

[27]  Computation of piecewise quadratic Lyapunov functions for hybrid systems , 1998, IEEE Trans. Autom. Control..

[28]  Eric Feron,et al.  Robust H 2 control , 1999 .

[29]  Laurent El Ghaoui,et al.  Advances in linear matrix inequality methods in control: advances in design and control , 1999 .

[30]  Masakazu Kojima,et al.  Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization , 2000, Math. Program..