On duality gap with polynomial multipliers for polynomial optimization problems
DOI10.1080/02331934.2023.2168479OpenAlexW4319999457MaRDI QIDQ5879569FDOQ5879569
Authors: Thai Doan Chuong 
Publication date: 2 March 2023
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2023.2168479
Recommendations
- Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers
- Zero duality gap for a class of nonconvex optimization problems
- Strong duality in lasserre's hierarchy for polynomial optimization
- On zero duality gap in nonconvex quadratic programming problems
- Generalized SOS-convexity and strong duality with SDP dual programs in polynomial optimization
semidefinite programming relaxationconvergent relaxationnon-convex polynomial programSOS-convexitysum of squares certificate
Numerical optimization and variational techniques (65K10) Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46)
Cites Work
- Lectures on modern convex optimization. Analysis, algorithms, and engineering applications
- Convex Analysis
- Title not available (Why is that?)
- An easy path to convex analysis and applications
- Generalized S-lemma and strong duality in nonconvex quadratic programming
- Title not available (Why is that?)
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
- Semidefinite Optimization and Convex Algebraic Geometry
- A Frank--Wolfe type theorem for convex polynomial programs
- Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers
- Dual semidefinite programs without duality gaps for a class of convex minimax programs
- Convergence of the Lasserre hierarchy of SDP relaxations for convex polynomial programs without compactness
- On polynomial optimization over non-compact semi-algebraic sets
- An introduction to polynomial and semi-algebraic optimization
- Stable zero duality gaps in convex programming: complete dual characterisations with applications to semidefinite programs
- Semidefinite representation of convex sets
- Zero duality gaps in infinite-dimensional programming
- A complete characterization of the gap between convexity and sos-convexity
- Characterizing the convexity of joint-range for a pair of inhomogeneous quadratic functions and strong duality
Cited In (4)
- Strong duality in lasserre's hierarchy for polynomial optimization
- Generalized Farkas' lemma and gap-free duality for minimax DC optimization with polynomials and robust quadratic optimization
- Role of redundant constraints for improving dual bounds in polynomial optimization problems
- Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers
This page was built for publication: On duality gap with polynomial multipliers for polynomial optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5879569)
