Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers

DOI10.1007/s10898-018-0665-7zbMath1433.90158OpenAlexW2803892878MaRDI QIDQ1756794

Thai Doan Chuong, Vaithilingam Jeyakumar

Publication date: 27 December 2018

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-018-0665-7

zbMATH Keywords

global optimalitysum of squares polynomialsquadratic programsgeneralized Lagrangian dualitynonconvex polynomial programsseparable programs

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Optimality conditions and duality in mathematical programming (90C46)

Related Items (3)

On duality gap with polynomial multipliers for polynomial optimization problems ⋮ A new algorithm for concave quadratic programming ⋮ A new bounded degree hierarchy with SOCP relaxations for global polynomial optimization and conic convex semi-algebraic programs

Uses Software

• SDPT3
• CVX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimality conditions and finite convergence of Lasserre's hierarchy
• Dual semidefinite programs without duality gaps for a class of convex minimax programs
• Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
• On polynomial optimization over non-compact semi-algebraic sets
• Semidefinite representation of convex sets
• Convergent conic linear programming relaxations for cone convex polynomial programs
• Generalized S-lemma and strong duality in nonconvex quadratic programming
• Lectures on Modern Convex Optimization
• On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0
• A Complete Characterization of the Gap between Convexity and SOS-Convexity
• An Introduction to Polynomial and Semi-Algebraic Optimization
• A double look at duality

This page was built for publication: Generalized Lagrangian duality for nonconvex polynomial programs with polynomial multipliers