Conic linear programming duals for classes of quadratic semi-infinite programs with applications
From MaRDI portal
Publication:2156392
DOI10.1007/s10957-022-02040-zzbMath1495.90220OpenAlexW4280532596MaRDI QIDQ2156392
Thai Doan Chuong, Cao Thanh Tinh
Publication date: 18 July 2022
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-022-02040-z
Semidefinite programming (90C22) Optimality conditions and duality in mathematical programming (90C46) Linear programming (90C05) Semi-infinite programming (90C34)
Related Items (3)
Conic relaxations with stable exactness conditions for parametric robust convex polynomial problems ⋮ On second-order conic programming duals for robust convex quadratic optimization problems ⋮ Characterizing a class of robust vector polynomial optimization via sum of squares conditions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Robust linear semi-infinite programming duality under uncertainty
- 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
- Semi-infinite programming
- Nonsmooth analysis
- Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems
- Applications of second-order cone programming
- Robust convex quadratically constrained programs
- Convergent conic linear programming relaxations for cone convex polynomial programs
- Recent contributions to linear semi-infinite optimization: an update
- Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications
- Semidefinite program duals for separable polynomial programs involving box constraints
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
- How to solve a semi-infinite optimization problem
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations
- Exact relaxations for parametric robust linear optimization problems
- Semidefinite relaxations for semi-infinite polynomial programming
- Lectures on Modern Convex Optimization
- Post-Optimal Analysis in Linear Semi-Infinite Optimization
- Strong Duality in Robust Convex Programming: Complete Characterizations
- Theory and Applications of Robust 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 Optimization and Convex Algebraic Geometry
- On solving a class of linear semi-infinite programming by SDP method
- Linear Matrix Inequality Conditions and Duality for a Class of Robust Multiobjective Convex Polynomial Programs
This page was built for publication: Conic linear programming duals for classes of quadratic semi-infinite programs with applications
