Semidefinite program duals for separable polynomial programs involving box constraints
From MaRDI portal
Publication:1985290
DOI10.1007/s10957-020-01646-5zbMath1452.90239OpenAlexW3010356717MaRDI QIDQ1985290
Publication date: 7 April 2020
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-020-01646-5
Semidefinite programming (90C22) Numerical optimization and variational techniques (65K10) Optimality conditions and duality in mathematical programming (90C46) Polynomial optimization (90C23)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization
- Sufficient global optimality conditions for bivalent quadratic optimization
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- A quadratic assignment formulation of the molecular conformation problem
- Handbook of global optimization
- A polyhedral study of nonconvex quadratic programs with box constraints
- Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
- Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality
- A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints
- Generalized S-lemma and strong duality in nonconvex quadratic programming
- Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations
- Global Optimality Conditions for Quadratic Optimization Problems with Binary Constraints
- An Introduction to Polynomial and Semi-Algebraic Optimization
- Optimal Inequalities in Probability Theory: A Convex Optimization Approach
This page was built for publication: Semidefinite program duals for separable polynomial programs involving box constraints
