Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems
DOI10.1007/s10957-023-02197-1zbMath1515.90087OpenAlexW4360824129MaRDI QIDQ6103695
Thai Doan Chuong, José Vicente-Pérez
Publication date: 27 June 2023
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-023-02197-1
robust optimizationconvex polynomialconic relaxationspectrahedral uncertainty setstable exact relaxation
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Convex programming (90C25) Optimality conditions and duality in mathematical programming (90C46) Robustness in mathematical programming (90C17) Polynomial optimization (90C23)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dual semidefinite programs without duality gaps for a class of convex minimax programs
- A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals
- Handbook on semidefinite, conic and polynomial optimization
- Robust linear optimization under general norms.
- A convex polynomial that is not sos-convex
- Semidefinite representation of convex sets
- Applications of second-order cone programming
- Several NP-hard problems arising in robust stability analysis
- Robust convex quadratically constrained programs
- SOS-convex semialgebraic programs and its applications to robust optimization: a tractable class of nonsmooth convex optimization
- Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications
- On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint
- Some geometric results in semidefinite programming
- Exact SDP relaxations for classes of nonlinear semidefinite programming problems
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
- Conic linear programming duals for classes of quadratic semi-infinite programs with applications
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations
- Exact relaxations for parametric robust linear optimization problems
- Convexity and closedness in stable robust duality
- Lectures on Modern Convex Optimization
- Robust Convex Optimization
- On Tractable Approximations of Uncertain Linear Matrix Inequalities Affected by Interval Uncertainty
- WHAT IS...a Spectrahedron?
- Strong Duality in Robust Convex Programming: Complete Characterizations
- Theory and Applications of Robust Optimization
- Convexity in SemiAlgebraic Geometry and Polynomial Optimization
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
- Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems
- Semidefinite Programming
- Convex Analysis
This page was built for publication: Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems
