The projective method for solving linear matrix inequalities

Mathematical Programming, Series B

Volumn 77, Issue 1, 1997, Pages 163-190

  Gahinet, Pascal ^a   Nemirovski, Arkadi ^b  

^a INRIA ROCQUENCOURT   (France)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Interior point methods; Linear matrix inequalities; Semidefinite programming

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; CONVERGENCE OF NUMERICAL METHODS; GEOMETRY; MATRIX ALGEBRA; POLYNOMIALS; PROBLEM SOLVING;

INTERIOR POINT METHODS; LINEAR MATRIX INEQUALITIES (LMI); PROJECTIVE METHODS; SEMIDEFINITE PROGRAMMING (SDP);

LINEAR PROGRAMMING;

EID: 0031144412     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf02614434     Document Type: Article

References (19)

1. F. Alizadeh, Optimization over the positive-semidefinite cone: Interior-point methods and combinatorial applications, SIAM J. on Optimization 5 (1995).
2. A. Berman, Cones, Matrices, and Mathematical Programming, Lecture Notes in Economics and Mathematical Systems, Vol. 79 (Springer, Berlin, 1973).
3. S.P. Boyd and L. El Ghaoui, Method of centers for minimizing generalized eigenvalues, Linear Algebra and its Applications 188 (1993) 63-111.
4. S.P. Boyd, L. El Ghaoui, E. Feron and V. Balakrishnan, Linear Matrix Inequalities in Systems and Control Theory, SIAM Studies in Applied Mathematics (SIAM, Philadelphia, PA, 1994).
5. ∞ control problems, IEEE Transactions on Automatic Control 34 (1989) 831-847.
6. M.K.H. Fan, A second-order interior point method for solving linear matrix inequality problems, submitted to SIAM J. on Control and Optimization (1993).
7. ∞ control, Internat. J. Robust and Nonlinear Control 4 (1994) 421-448.
8. P. Gahinet, A. Nemirovski, A.J. Laub and M. Chilali, The LMI control toolbox, in: Proc. Conf. Dec. Contr. (1994) 2038-2041.
9. P Gahinet, A. Nemirovski, A.J. Laub and M. Chilali, LMI Control Toolbox (The MathWorks Inc., 1995).
10. G.H. Golub and C.F. Van Loan, Matrix Computations (Johns Hopkins University Press, Baltimore, 1983).
11. F. Jarre, An interior-point method for minimizing the maximum eigenvalue of a linear combination of matrices, SIAM J. on Optimization 31 (1993).
12. N. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica 4 (1984) 373-395.
13. M. Kojima, S. Shindoh and S. Hara, Interior-point methods for the monotone linear complementarity problem in symmetric matrices, Technical Report B-282, Dept. of Information Sciences, Tokyo Institute of Technology, 1994.
14. Yu. Nesterov and A. Nemirovski, Polynomial-time barrier methods in convex programming, Ekonomika i Matem. Metody 24 (1988), in Russian; translation: Matekon.
15. Yu. Nesterov and A. Nemirovski, An interior-point method for generalized linear-fractional problems, Mathematical Programming 69 (1995) 177-204.
16. Yu. Nesterov and A. Nemirovski, Interior Point Polynomial Methods in Convex Programming: Theory and Applications, SIAM Studies in Applied Mathematics (SIAM, Philadelphia, PA, 1994).
17. M.L. Overton, Large-scale optimization of eigenvalues, SIAM J. on Optimization 2 (1992) 88-120.
18. F. Rendl and H. Wolkowicz, Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem, Mathematical Programming 53 (1992) 63-78.
19. L. Vandenberghe and S. Boyd, Primal-dual potential reduction method for problems involving matrix inequalities, Mathematical Programming 69 (1995) 205-236.