Finding the nearest -stable pencil with Riemannian optimization
From MaRDI portal
Publication:7238441
Cites work
- A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles
- A Bisection Method for Measuring the Distance of a Stable Matrix to the Unstable Matrices
- A Riemannian optimization method to compute the nearest singular pencil
- An Introduction to Optimization on Smooth Manifolds
- Approximating real stability radii
- Computing the nearest stable matrix pairs.
- Damped oscillations of linear systems. A mathematical introduction
- Extended and improved criss-cross algorithms for computing the spectral value set abscissa and radius
- scientific article; zbMATH DE number 2229937 (Why is no real title available?)
- Inference of curvature using tubular neighborhoods
- Large-scale and global maximization of the distance to instability
- Manopt, a Matlab toolbox for optimization on manifolds
- Matrix Stabilization Using Differential Equations
- Nearest -stable matrix via Riemannian optimization
- Nearest stable system using successive convex approximations
- On approximating the nearest Ω‐stable matrix
- On computing root polynomials and minimal bases of matrix pencils
- On computing the distance to stability for matrices using linear dissipative Hamiltonian systems
- On matrix nearness problems: distance to delocalization
- On the Sensitivity of the Eigenvalue Problem Ax = \lambda Bx
- On the stability radius of a generalized state-space system
- Robust stability of differential-algebraic equations
- Trust-region methods on Riemannian manifolds
This page was built for publication: Finding the nearest \(\mathbf{\Omega}\)-stable pencil with Riemannian optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7238441)
