A recursive algorithm of exactness verification of relaxations for robust SDPs
From MaRDI portal
Publication:2390543
DOI10.1016/J.SYSCONLE.2009.04.002zbMATH Open1180.90229OpenAlexW2087297735MaRDI QIDQ2390543FDOQ2390543
Authors: Izumi Masubuchi, Carsten W. Scherer 
Publication date: 23 July 2009
Published in: Systems \& Control Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sysconle.2009.04.002
Recommendations
- Verifying exactness of relaxations for robust semi-definite programs by solving polynomial systems
- Exact relaxations for parametric robust linear optimization problems
- Relaxations for Robust Linear Matrix Inequality Problems with Verifications for Exactness
- Matrix sum-of-squares relaxations for robust semi-definite programs
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations
Cites Work
- Detecting Global Optimality and Extracting Solutions in GloptiPoly
- Global optimization with polynomials and the problem of moments
- On the Kalman-Yakubovich-Popov lemma
- Matrix sum-of-squares relaxations for robust semi-definite programs
- Sums of squares, moment matrices and optimization over polynomials
- Numerical Polynomial Algebra
- Title not available (Why is that?)
- Relaxations for Robust Linear Matrix Inequality Problems with Verifications for Exactness
- LMI relaxations in robust control
- Well-posedness of feedback systems: insights into exact robustness analysis and approximate computations
- Positive polynomials in scalar and matrix variables, the spectral theorem, and optimization
- Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
- Verifying exactness of relaxations for robust semi-definite programs by solving polynomial systems
- Robust Performance Analysis of Uncertain LTI Systems: Dual LMI Approach and Verifications for Exactness
Cited In (5)
- A constrained tracking control algorithm for linear systems based on a spline‐type parameter‐dependent Lyapunov function
- Time-invariant uncertain systems: a necessary and sufficient condition for stability and instability via homogeneous parameter-dependent quadratic Lyapunov functions
- \(\mathcal{H}_2\) and \(\mathcal{H}_\infty\) filter design for polytopic continuous-time Markov jump linear systems with uncertain transition rates
- Verifying exactness of relaxations for robust semi-definite programs by solving polynomial systems
- In SDP Relaxations, Inaccurate Solvers Do Robust Optimization
Uses Software
This page was built for publication: A recursive algorithm of exactness verification of relaxations for robust SDPs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390543)
