Conic linear programming duals for classes of quadratic semi-infinite programs with applications
From MaRDI portal
Publication:2156392
Recommendations
- On duality theory of convex semi-infinite programming
- scientific article; zbMATH DE number 1241353
- Duality for semi-definite and semi-infinite programming
- A dual parameterization approach to linear-quadratic semi-infinite programming problems
- Understanding linear semi-infinite programming via linear programming over cones
Cites work
- A dual condition for the convex subdifferential sum formula with applications
- A generalized Farkas lemma with a numerical certificate and linear semi-infinite programs with SDP duals
- A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs
- Applications of second-order cone programming
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
- Convergent conic linear programming relaxations for cone convex polynomial programs
- Convergent hierarchy of SDP relaxations for a class of semi-infinite convex polynomial programs and applications
- Dual semidefinite programs without duality gaps for a class of convex minimax programs
- Exact relaxations for parametric robust linear optimization problems
- Exact second-order cone programming relaxations for some nonconvex minimax quadratic optimization problems
- How to solve a semi-infinite optimization problem
- scientific article; zbMATH DE number 1807400 (Why is no real title available?)
- scientific article; zbMATH DE number 1070896 (Why is no real title available?)
- 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
- Nonsmooth analysis
- On solving a class of linear semi-infinite programming by SDP method
- Post-Optimal Analysis in Linear Semi-Infinite Optimization
- Recent contributions to linear semi-infinite optimization: an update
- Robust convex quadratically constrained programs
- Robust linear semi-infinite programming duality under uncertainty
- Robust optimization
- Robust SOS-convex polynomial optimization problems: exact SDP relaxations
- Semi-infinite programming
- Semidefinite Optimization and Convex Algebraic Geometry
- Semidefinite program duals for separable polynomial programs involving box constraints
- Semidefinite relaxations for semi-infinite polynomial programming
- Slater CQ, optimality and duality for quasiconvex semi-infinite optimization problems
- Strong duality in robust convex programming: complete characterizations
- Theory and applications of robust optimization
Cited in
(5)- 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
- Linear conic and two-stage stochastic optimization revisited via semi-infinite optimization
- Applying convexificators in nonsmooth multiobjective semi-infinite fractional interval-valued optimization
This page was built for publication: Conic linear programming duals for classes of quadratic semi-infinite programs with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2156392)
