Verifying exactness of relaxations for robust semi-definite programs by solving polynomial systems

DOI10.1016/j.laa.2008.05.009zbMath1175.65059OpenAlexW2059812312MaRDI QIDQ947643

S. G. Dietz, Carsten W. Scherer

Publication date: 6 October 2008

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2008.05.009

zbMATH Keywords

algorithmsnumerical examplelinear matrix inequalitypolynomial systemsrelaxationsrobust semidefinite programmingverification of exactnessverifying of exactness

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Numerical computation of solutions to systems of equations (65H10) Approximation methods and heuristics in mathematical programming (90C59) Interior-point methods (90C51) Numerical computation of roots of polynomial equations (65H04)

Related Items (4)

A recursive algorithm of exactness verification of relaxations for robust SDPs ⋮ On the determination of the solutions and maximum admissible power of the load flow equation via LMIS ⋮ Robust control of uncertain systems: classical results and recent developments ⋮ and filter design for polytopic continuous‐time Markov jump linear systems with uncertain transition rates

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones
• Robust solutions of uncertain linear programs
• Robust solutions of linear programming problems contaminated with uncertain data
• Recent contributions to linear semi-infinite optimization
• Randomized algorithms for analysis and control of uncertain systems. With a foreword by M. Vidyasagar
• Uncertain convex programs: randomized solutions and confidence levels
• Advanced techniques for clearance of flight control laws
• Matrix sum-of-squares relaxations for robust semi-definite programs
• LMI relaxations in robust control
• Lectures on Modern Convex Optimization
• On Tractable Approximations of Uncertain Linear Matrix Inequalities Affected by Interval Uncertainty
• .879-approximation algorithms for MAX CUT and MAX 2SAT
• Robust Solutions to Uncertain Semidefinite Programs
• Characterizing the solution set of polynomial systems in terms of homogeneous forms: an LMI approach
• Numerical Polynomial Algebra
• The Numerical Solution of Systems of Polynomials Arising in Engineering and Science
• Relaxations for Robust Linear Matrix Inequality Problems with Verifications for Exactness
• Induced L2-norm control for LPV systems with bounded parameter variation rates

This page was built for publication: Verifying exactness of relaxations for robust semi-definite programs by solving polynomial systems