Solving Matrix Inequalities whose Unknowns are Matrices
Abstract
This paper provides algorithms for numerical solution of convex matrix inequalities in which the variables naturally appear as matrices. This includes, for instance, many systems and control problems. To use these algorithms, no knowledge of linear matrix inequalities is required. However, as tools, they preserve many advantages of the linear matrix inequality framework. Our method has two components: (1) a numerical algorithm that solves a large class of matrix optimization problems and (2) a symbolic "convexity checker" that automatically provides a region which, if convex, guarantees that the solution from (1) is a global optimum on that region. The algorithms are partly numerical and partly symbolic and since they aim at exploiting the matrix structure of the unknowns, the symbolic part requires the development of new computer techniques for treating noncommutative algebra.
MSC codes
MSC codes
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
Farid Alizadeh, Jean‐Pierre Haeberly, Michael Overton, Primal‐dual interior‐point methods for semidefinite programming: convergence rates, stability and numerical results, SIAM J. Optim., 8 (1998), 746–768
2.
Stephen Boyd, Laurent El Ghaoui, Method of centers for minimizing generalized eigenvalues, Linear Algebra Appl., 188/189 (1993), 63–111
3.
S. Boyd and L. Vandenberghe, Convex Optimization, Cambridge University Press, New York, 2004.
4.
J. F. Camino, Optimization over Convex Matrix Inequalities, Ph.D. thesis, University of California, San Diego, 2003.
5.
Juan Camino, J. Helton, Robert Skelton, Jieping Ye, Matrix inequalities: a symbolic procedure to determine convexity automatically, Integral Equations Operator Theory, 46 (2003), 399–454
6.
Laurent El Ghaoui, Silviu‐Iulian Niculescu, Advances in linear matrix inequality methods in control, Advances in Design and Control, Society for Industrial and Applied Mathematics (SIAM), 2000xviii+372
7.
A. V. Fiacco and G. P. McCormick, Nonlinear Programming: Sequential Unconstrained Minimization Techniques, Classics Appl. Math., SIAM, Philadelphia, 1990.
8.
P. Gahinet, A. Nemirovskii, A. J. Laub, and M. Chilali, LMI Control Toolbox, The Math Works, Natick, MA, 1995.
9.
Gene Golub, Charles Van Loan, Matrix computations, Johns Hopkins Series in the Mathematical Sciences, Vol. 3, Johns Hopkins University Press, 1983xvi+476
10.
Edward Green, Multiplicative bases, Gröbner bases, and right Gröbner bases, J. Symbolic Comput., 29 (2000), 601–623, Symbolic computation in algebra, analysis, and geometry (Berkeley, CA, 1998)
11.
J. Helton, John Wavrik, Rules for computer simplification of the formulas in operator model theory and linear systems, Oper. Theory Adv. Appl., Vol. 73, Birkhäuser, Basel, 1994, 325–354
12.
R. A. Horn and C. R. Johnson, Topics in Matrix Analysis, Cambridge University Press, New York, 1999.
13.
K. Jbilou, A. Messaoudi, Matrix recursive interpolation algorithm for block linear systems: direct methods, Linear Algebra Appl., 294 (1999), 137–154
14.
M. Konstantinov, V. Mehrmann, P. Petkov, On properties of Sylvester and Lyapunov operators, Linear Algebra Appl., 312 (2000), 35–71
15.
F. Leibfritz, E. Mostafa, An interior point constrained trust region method for a special class of nonlinear semidefinite programming problems, SIAM J. Optim., 12 (2002), 1048–1074
16.
A. S. Lewis and M. L. Overton, Eigenvalue optimization, Acta Numer., 5 (1996), pp. 149–190.
17.
P. A. Linnell, Noncommutative Localization in Group Rings, arXiv: Math. RA/0311071.
18.
W. Murray, Analytical expressions for the eigenvalues and eigenvectors of the Hessian matrices of barrier and penalty functions, J. Optimization Theory Appl., 7 (1971), 189–196
19.
Y. Nesterov and A. Nemirovskii, Interior‐Point Polynomial Algorithms in Convex Programming, Stud. Appl. Math., SIAM, Philadelphia, 1994.
20.
J. Ortega, W. Rheinboldt, Iterative solution of nonlinear equations in several variables, Classics in Applied Mathematics, Vol. 30, Society for Industrial and Applied Mathematics (SIAM), 2000xxvi+572, Reprint of the 1970 original
21.
Michael Overton, On minimizing the maximum eigenvalue of a symmetric matrix, SIAM J. Matrix Anal. Appl., 9 (1988), 256–268, SIAM Conference on Linear Algebra in Signals, Systems, and Control (Boston, Mass., 1986)
22.
P. A. Parrilo, Structured Semidefinite Programs and Semialgebraic Geometry Methods in Robustness and Optimization, Ph.D. thesis, California Institute of Technology, 2000.
23.
Robert Skelton, Tetsuya Iwasaki, Karolos Grigoriadis, A unified algebraic approach to linear control design, The Taylor & Francis Systems and Control Book Series, Taylor & Francis Ltd., 1998xviii+285
24.
J. Helton, Mark Stankus, John Wavrik, Computer simplification of formulas in linear systems theory, IEEE Trans. Automat. Control, 43 (1998), 302–314
25.
J. F. Sturm, Using SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones, Optim. Methods Softw., 11/12 (1999), pp. 625–653.
26.
Jos Sturm, Implementation of interior point methods for mixed semidefinite and second order cone optimization problems, Optim. Methods Softw., 17 (2002), 1105–1154
27.
M. J. Todd, Semidefinite optimization, Acta Numer., 10 (2001), pp. 515–560.
28.
K. Toh, M. Todd, R. Tütüncü, SDPT3—a MATLAB software package for semidefinite programming, version 1.3, Optim. Methods Softw., 11/12 (1999), 545–581, Interior point methods
29.
Henry Wolkowicz, Romesh Saigal, Lieven Vandenberghe, Handbook of semidefinite programming, International Series in Operations Research & Management Science, 27, Kluwer Academic Publishers, 2000xxviii+654, Theory, algorithms, and applications
30.
Margaret Wright, Interior methods for constrained optimization, Acta Numer., Cambridge Univ. Press, Cambridge, 1992, 341–407
Information & Authors
Information
Published In
Copyright
Copyright © 2006 Society for Industrial and Applied Mathematics.
History
Published online: 28 July 2006
MSC codes
MSC codes
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.