Semidefinite program duals for separable polynomial programs involving box constraints
DOI10.1007/S10957-020-01646-5zbMATH Open1452.90239OpenAlexW3010356717MaRDI QIDQ1985290FDOQ1985290
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
Recommendations
- Dual semidefinite programs without duality gaps for a class of convex minimax programs
- Moments and sums of squares for polynomial optimization and related problems
- New strong duality results for convex programs with separable constraints
- Unconstrained duals to partially separable constrained programs
- Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations
Numerical optimization and variational techniques (65K10) Optimality conditions and duality in mathematical programming (90C46) Semidefinite programming (90C22) Polynomial optimization (90C23)
Cites Work
- Title not available (Why is that?)
- Handbook of global optimization
- Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints
- Generalized S-lemma and strong duality in nonconvex quadratic programming
- Global optimality conditions for quadratic optimization problems with binary constraints
- Necessary and sufficient conditions for \(S\)-lemma and~nonconvex quadratic optimization
- Optimal Inequalities in Probability Theory: A Convex Optimization Approach
- Sufficient global optimality conditions for bivalent quadratic optimization
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- A polyhedral study of nonconvex quadratic programs with box constraints
- A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints
- An Introduction to Polynomial and Semi-Algebraic Optimization
- Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations
- A quadratic assignment formulation of the molecular conformation problem
- Title not available (Why is that?)
- Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality
Cited In (1)
Uses Software
This page was built for publication: Semidefinite program duals for separable polynomial programs involving box constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1985290)
