Exact relaxations for parametric robust linear optimization problems
From MaRDI portal
Recommendations
- Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations
- Relaxations for Robust Linear Matrix Inequality Problems with Verifications for Exactness
- Verifying exactness of relaxations for robust semi-definite programs by solving polynomial systems
- Testing the exactness of convex relaxations for robust LMI problems
Cites work
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals
- A unified approach to robust Farkas-type results with applications to robust optimization problems
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality
- Duality in semi-infinite programs and some works of Haar and Carathéodory
- LP relaxations for a class of linear semi-infinite programming problems
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Linear matrix inequality conditions and duality for a class of robust multiobjective convex polynomial programs
- Linear semi-infinite optimization: recent advances
- Necessary and sufficient conditions for stable conjugate duality
- On solving a class of linear semi-infinite programming by SDP method
- Recent advances in learning and control. Festschrift for Mathukumalli Vidyasagar on the occasion of his sixtieth birthday.
- Robust alternative theorem for linear inequalities with applications to robust multiobjective optimization
- Robust convex optimization
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semidefinite Optimization and Convex Algebraic Geometry
- Semidefinite relaxations for semi-infinite polynomial programming
- Some geometric results in semidefinite programming
- Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
- Theory and applications of robust optimization
- Uniform duality in semi-infinite convex optimization
- What is \dots a spectrahedron?
Cited in
(10)- Strong duality in parametric robust semi-definite linear programming and exact relaxations
- Parametric Nonlinear Programming Problems under the Relaxed Constant Rank Condition
- A geometric characterization of ``optimality-equivalent relaxations
- Conic linear programming duals for classes of quadratic semi-infinite programs with applications
- Relaxations for Robust Linear Matrix Inequality Problems with Verifications for Exactness
- A support function approach for characterizations of convex normal cone
- A recursive algorithm of exactness verification of relaxations for robust SDPs
- In SDP Relaxations, Inaccurate Solvers Do Robust Optimization
- Stability properties for parametric linear programs under data ambiguities
- Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems
This page was built for publication: Exact relaxations for parametric robust linear optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294277)
