Verifying exactness of relaxations for robust semi-definite programs by solving polynomial systems
From MaRDI portal
algorithmslinear matrix inequalitynumerical examplepolynomial systemsrelaxationsrobust semidefinite programmingverification of exactnessverifying of exactness
Numerical mathematical programming methods (65K05) Approximation methods and heuristics in mathematical programming (90C59) Interior-point methods (90C51) Semidefinite programming (90C22) Numerical computation of solutions to systems of equations (65H10) Numerical computation of roots of polynomial equations (65H04)
Recommendations
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations
- Matrix sum-of-squares relaxations for robust semi-definite programs
- Relaxations for Robust Linear Matrix Inequality Problems with Verifications for Exactness
- A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems
- A recursive algorithm of exactness verification of relaxations for robust SDPs
Cites work
- scientific article; zbMATH DE number 1001726 (Why is no real title available?)
- scientific article; zbMATH DE number 4076472 (Why is no real title available?)
- scientific article; zbMATH DE number 1206418 (Why is no real title available?)
- scientific article; zbMATH DE number 1253975 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- .878-approximation algorithms for MAX CUT and MAX 2SAT
- Advanced techniques for clearance of flight control laws
- An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones
- Characterizing the solution set of polynomial systems in terms of homogeneous forms: an LMI approach
- Induced L2-norm control for LPV systems with bounded parameter variation rates
- LMI relaxations in robust control
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Matrix sum-of-squares relaxations for robust semi-definite programs
- Numerical Polynomial Algebra
- On tractable approximations of uncertain linear matrix inequalities affected by interval uncertainty
- Randomized algorithms for analysis and control of uncertain systems. With a foreword by M. Vidyasagar
- Recent contributions to linear semi-infinite optimization
- Relaxations for Robust Linear Matrix Inequality Problems with Verifications for Exactness
- Robust Solutions to Uncertain Semidefinite Programs
- Robust solutions of linear programming problems contaminated with uncertain data
- Robust solutions of uncertain linear programs
- The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
- Uncertain convex programs: randomized solutions and confidence levels
Cited in
(9)- On the determination of the solutions and maximum admissible power of the load flow equation via LMIs
- On the local stability of semidefinite relaxations
- \(\mathcal{H}_2\) and \(\mathcal{H}_\infty\) filter design for polytopic continuous-time Markov jump linear systems with uncertain transition rates
- Relaxations for Robust Linear Matrix Inequality Problems with Verifications for Exactness
- Exact relaxations for parametric robust linear optimization problems
- A recursive algorithm of exactness verification of relaxations for robust SDPs
- Matrix sum-of-squares relaxations for robust semi-definite programs
- Reduced vertex set result for interval semidefinite optimization problems
- Robust control of uncertain systems: classical results and recent developments
This page was built for publication: Verifying exactness of relaxations for robust semi-definite programs by solving polynomial systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q947643)
