Two numerical methods for optimizing matrix stability
The authors consider the affine matrix family \(A(x)=A_{0}+ \sum_{k=1}^{m}x_{k}A_{k}\) where \(x\in R^{m}\) and \(A_{k}\) are \( n\times n\) matrices and the question is to minimize its spectral abscissa, i.e. the largest real part of the eigenvalues. This is a common problem in control theory, which usually arises in the stabilization of dynamical systems by output feedback. Here two methods and their algorithms are proposed: the first is to find a local minimizer by a direction search and is based on the random gradient bundle method; The second method, the robust spectral abscissa, is based on a bilinear matrix inequality and looks at the largest eigenvalue as a functional over the set of positive definite matrices. The algorithms associated with both methods, which compute local minimizers, are described: these are the random gradient bundle with the line search and the Newton barrier method. Both algorithms are implemented in the numerical examples section.
- An Interior Point Constrained Trust Region Method for a Special Class of Nonlinear Semidefinite Programming Problems
- Approximating Subdifferentials by Random Sampling of Gradients
- scientific article; zbMATH DE number 994714 (Why is no real title available?)
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3972657 (Why is no real title available?)
- scientific article; zbMATH DE number 4093307 (Why is no real title available?)
- scientific article; zbMATH DE number 88933 (Why is no real title available?)
- scientific article; zbMATH DE number 1342075 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- scientific article; zbMATH DE number 1424223 (Why is no real title available?)
- scientific article; zbMATH DE number 3307153 (Why is no real title available?)
- scientific article; zbMATH DE number 967335 (Why is no real title available?)
- Linear Matrix Inequalities in System and Control Theory
- Matrix Analysis
- NP-Hardness of Some Linear Control Design Problems
- ON MATRICES DEPENDING ON PARAMETERS
- On the Lidskii--Vishik--Lyusternik Perturbation Theory for Eigenvalues of Matrices with Arbitrary Jordan Structure
- On the Nesterov--Todd Direction in Semidefinite Programming
- Optimal stability and eigenvalue multiplicity
- Optimizing matrix stability
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Pseudospectra of Linear Operators
- Semidefinite optimization
- Several NP-hard problems arising in robust stability analysis
- Survey on the state of systems and control
- The Kreiss Matrix Theorem on a General Complex Domain
- Variational Analysis
- Variational analysis of non-Lipschitz spectral functions
- Convergence of the gradient sampling algorithm on directionally Lipschitz functions
- Spectral radius minimization for optimal average consensus and output feedback stabilization
- Continuous approximation of linear impulsive systems and a new form of robust stability
- Variational analysis of convexly generated spectral max functions
- Performance-oriented communication topology design for distributed control of interconnected systems
- A successive SDP-NSDP approach to a robust optimization problem in finance
- Optimizing matrix stability
- A subgradient method based on gradient sampling for solving convex optimization problems
- Fixed-structure robust controller design for chatter mitigation in high-speed milling
- Time domain constrained \(H_{\infty }\)-synthesis
- Design of a flight control architecture using a non-convex bundle method
- Composite proximal bundle method
- scientific article; zbMATH DE number 4100488 (Why is no real title available?)
- A feasible SQP-GS algorithm for nonconvex, nonsmooth constrained optimization
- Static output feedback stabilization of interconnected systems
- An SL/QP algorithm for minimizing the spectral abscissa of time delay systems
- Large-scale and global maximization of the distance to instability
- Multivariate refinable Hermite interpolant
- The smoothed spectral abscissa for robust stability optimization
- An explicit formula for the splitting of multiple eigenvalues for nonlinear eigenvalue problems and connections with the linearization for the delay eigenvalue problem
- Optimal stability and eigenvalue multiplicity
- Multifidelity Robust Controller Design with Gradient Sampling
- Decentralized static output feedback controller design for linear interconnected systems
- A perturbation method for optimizing matrix stability
- Large-scale minimization of the pseudospectral abscissa
- A subspace framework for \(\mathcal{L}_{\infty}\) model reduction
- A descent subgradient method using Mifflin's line search for nonsmooth nonconvex optimization
- Matrix nearness problems: Do real inputs admit real solutions?
- Random search of stable member in a matrix polytope
- A heuristic for the stability number of a graph based on convex quadratic programming and tabu search
This page was built for publication: Two numerical methods for optimizing matrix stability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1611899)
