Large-scale minimization of the pseudospectral abscissa
From MaRDI portal
Publication:6641765
DOI10.1137/22m1517329MaRDI QIDQ6641765
Publication date: 21 November 2024
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
robust stabilityeigenvalue optimizationnonconvex optimizationLagrangianlarge scalepseudospectral abscissasubspace framework
Minimax problems in mathematical programming (90C47) Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Survey on the state of systems and control
- Several NP-hard problems arising in robust stability analysis
- Perturbation theory for rectangular matrix pencils
- Real perturbation values and real quadratic forms in a complex vector space
- Two numerical methods for optimizing matrix stability
- Optimizing matrix stability
- Subspace Methods for Computing the Pseudospectral Abscissa and the Stability Radius
- Some Regularity Results for the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix
- Numerical Optimization of Eigenvalues of Hermitian Matrix Functions
- A Subspace Method for Large-Scale Eigenvalue Optimization
- Fast Algorithms for the Approximation of the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix
- Variational Analysis of Pseudospectra
- Controller Design via Nonsmooth Multidirectional Search
- New Algorithms for Computing the Real Structured Pseudospectral Abscissa and the Real Stability Radius of Large and Sparse Matrices
- A Trust Region Spectral Bundle Method for Nonconvex Eigenvalue Optimization
- Über Die Stabilitätsdefinition Für Differenzengleichungen Die Partielle Differentialgleichungen Approximieren
- NP-Hardness of Some Linear Control Design Problems
- ARPACK Users' Guide
- Optimization and Pseudospectra, with Applications to Robust Stability
- Robust stability and a criss-cross algorithm for pseudospectra
- Subspace Acceleration for the Crawford Number and Related Eigenvalue Optimization Problems
- Large-Scale Computation of $\mathcal{L}_\infty$-Norms by a Greedy Subspace Method
- Large-Scale and Global Maximization of the Distance to Instability
- Extended and Improved Criss-Cross Algorithms for Computing the Spectral Value Set Abscissa and Radius
- A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles
- Nonsmooth H∞Synthesis
- Low-Rank Dynamics for Computing Extremal Points of Real Pseudospectra
- Criss-Cross Type Algorithms for Computing the Real Pseudospectral Abscissa
- A Subspace Framework for ${\mathcal H}_\infty$-Norm Minimization
- Optimal stability and eigenvalue multiplicity
This page was built for publication: Large-scale minimization of the pseudospectral abscissa