Large-Scale Minimization of the Pseudospectral Abscissa
Nicat Aliyev, Emre Mengi

TL;DR
This paper introduces a subspace method for large-scale minimization of the pseudospectral abscissa, enabling efficient and superlinearly convergent optimization for robust stability analysis in control systems.
Contribution
It develops a novel subspace framework for large-scale nonconvex minimax eigenvalue problems involving the pseudospectral abscissa, with special treatment of eigenvalue constraints using Lagrangian dual variables.
Findings
Superlinear convergence of the subspace method.
Effective handling of large-scale matrix problems.
Advantages over other stability measures like $\
Abstract
This work concerns the minimization of the pseudospectral abscissa of a matrix-valued function dependent on parameters analytically. The problem is motivated by robust stability and transient behavior considerations for a linear control system that has optimization parameters. We describe a subspace procedure to cope with the setting when the matrix-valued function is of large size. The proposed subspace procedure solves a sequence of reduced problems obtained by restricting the matrix-valued function to small subspaces, whose dimensions increase gradually. It possesses desirable features such as a superlinear convergence exhibited by the decay in the errors of the minimizers of the reduced problems. In mathematical terms, the problem we consider is a large-scale nonconvex minimax eigenvalue optimization problem such that the eigenvalue function appears in the constraint of the inner…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMatrix Theory and Algorithms · Stability and Control of Uncertain Systems · Advanced Optimization Algorithms Research
