Rank-1 Matrix Differential Equations for Structured Eigenvalue Optimization.
From MaRDI portal
Abstract: A new approach to solving eigenvalue optimization problems for large structured matrices is proposed and studied. The class of optimization problems considered is related to computing structured pseudospectra and their extremal points, and to structured matrix nearness problems such as computing the structured distance to instability or to singularity. The structure can be a general linear structure and includes, for example, large matrices with a given sparsity pattern, matrices with given range and co-range, and Hamiltonian matrices. Remarkably, the eigenvalue optimization can be performed on the manifold of complex (or real) rank-1 matrices, which yields a significant reduction of storage and in some cases of the computational cost. The method relies on a constrained gradient system and the projection of the gradient onto the tangent space of the manifold of complex rank- matrices. It is shown that near a local minimizer this projection is very close to the identity map, and so the computationally favorable rank-1 projected system behaves locally like the %computationally expensive gradient system.
Recommendations
- A rank-1 matrix formula applied to eigenvalue sensitivities
- A Low-Rank Matrix Equation Method for Solving PDE-Constrained Optimization Problems
- A matrix generation approach for eigenvalue optimization
- Numerical low-rank approximation of matrix differential equations
- Eigenvalue placement for regular matrix pencils with rank one perturbations
- Structured Eigenvalue Problems
- Eigenvalue perturbation theory of classes of structured matrices under generic structured rank one perturbations
- Structured matrices in the nonnegative inverse eigenvalue problem
- Optimization model for generic rank determination of structural matrices
Cites work
- A formula for computation of the real stability radius
- A Krylov--Schur algorithm for large eigenproblems
- Derivatives and Perturbations of Eigenvectors
- Differential equations for roaming pseudospectra: paths to extremal points and boundary tracking
- Dynamical Low‐Rank Approximation
- Dynamical systems that sort lists, diagonalize matrices, and solve linear programming problems
- Fast Algorithms for the Approximation of the Pseudospectral Abscissa and Pseudospectral Radius of a Matrix
- First-order perturbation theory for eigenvalues and eigenvectors
- scientific article; zbMATH DE number 47926 (Why is no real title available?)
- scientific article; zbMATH DE number 5223994 (Why is no real title available?)
- scientific article; zbMATH DE number 2212009 (Why is no real title available?)
- Linear algebra algorithms as dynamical systems
- Low rank differential equations for Hamiltonian matrix nearness problems
- Low-rank dynamics for computing extremal points of real pseudospectra
- Manopt, a Matlab toolbox for optimization on manifolds
- Mathematical Systems Theory I
- Matrix Stabilization Using Differential Equations
- Model reduction techniques for linear constant coefficient port-Hamiltonian differential-algebraic systems
- On the method by Rostami for computing the real stability radius of large and sparse matrices
- Optimization and dynamical systems
- Perturbation of purely imaginary eigenvalues of Hamiltonian matrices under structured perturbations
- Perturbation theory for Hamiltonian matrices and the distance to bounded-realness
- Subspace methods for computing the pseudospectral abscissa and the stability radius
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
- Über Die Stabilitätsdefinition Für Differenzengleichungen Die Partielle Differentialgleichungen Approximieren
Cited in
(10)- Low rank differential equations for Hamiltonian matrix nearness problems
- A rank-1 matrix formula applied to eigenvalue sensitivities
- A Low-Rank Matrix Equation Method for Solving PDE-Constrained Optimization Problems
- Stabilization of a matrix via a low-rank-adaptive ODE
- Structured linear stability problems
- Approximating the closest structured singular matrix polynomial
- A low-rank ODE for spectral clustering stability
- On the numerical approximation of the distance to singularity for matrix-valued functions
- Transient dynamics under structured perturbations: bridging unstructured and structured pseudospectra
- Riemann-oracle: a general-purpose Riemannian optimizer to solve nearness problems in matrix theory
This page was built for publication: Rank-1 Matrix Differential Equations for Structured Eigenvalue Optimization.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6171373)
