论文信息 - Computational issues in solving LMIs

Computational issues in solving LMIs

Optimization methods, which have been applied to linear matrix inequality (LMI) problems are described and results are noted. Descent methods are briefly described, and one descent method approached for solving LMI problems is discussed. Convex programming methods and applications are also outlined. Interior point methods are then discussed, and recent results of applications to LMI problems are given.<<ETX>>

Carolyn L. Beck | C. Beck | C. Beck

[1] E. E. Osborne. On Pre-Conditioning of Matrices , 1960, JACM.

[2] J. Doyle,et al. Review of LFTs, LMIs, and mu , 1991, [1991] Proceedings of the 30th IEEE Conference on Decision and Control.

[3] Stephen P. Boyd,et al. Structured and Simultaneous Lyapunov Functions for System Stability Problems , 1989 .

[4] Philip E. Gill,et al. Practical optimization , 1981 .

[5] Stephen P. Boyd,et al. Linear controller design: limits of performance , 1991 .

[6] Michael L. Overton,et al. Large-Scale Optimization of Eigenvalues , 1990, SIAM J. Optim..

[7] Anthony V. Fiacco,et al. Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .