An Interior-Point Method for Minimizing the Maximum Eigenvalue of a Linear Combination of Matrices
Florian Jarre · SIAM Journal on Control and Optimization · 1993
An algorithm for minimizing the largest eigenvalue of an affine combination of symmetric matrices is presented. The nonsmooth problem is transformed into an equivalent smooth constrained problem, which is solved by a predictor-corrector interior-point method taking full advantage of the differentiability and convexity. Some promising numerical results obtained from a preliminary implementation are included.
Cited by 106 works. doi:10.1137/0331064
Authors
References
- A new polynomial-time algorithm for linear programming
- Nonlinear Programming
- Linear controller design: limits of performance
- Matrix Perturbation Theory
- An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming
- Large-Scale Optimization of Eigenvalues
- On Minimizing the Maximum Eigenvalue of a Symmetric Matrix
- Structured and simultaneous Lyapunov functions for system stability problems
- Semi-Definite Matrix Constraints in Optimization
- Advances in Optimization and Parallel Computing