Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality
From MaRDI portal
Publication:2273897
DOI10.1016/j.ejor.2019.08.009zbMath1430.90467arXiv1707.09486OpenAlexW2967082609MaRDI QIDQ2273897
Nguyen Huy Chieu, Guoyin Li, Vaithilingam Jeyakumar
Publication date: 18 September 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1707.09486
Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Optimality conditions and duality in mathematical programming (90C46)
Related Items (3)
Quadratically adjustable robust linear optimization with inexact data via generalized S-lemma: exact second-order cone program reformulations ⋮ Semidefinite program duals for separable polynomial programs involving box constraints ⋮ A copositive Farkas lemma and minimally exact conic relaxations for robust quadratic optimization with binary and quadratic constraints
Cites Work
- Unnamed Item
- Unnamed Item
- On conic QPCCs, conic QCQPs and completely positive programs
- Robust linear semi-infinite programming duality under uncertainty
- Copositive optimization -- recent developments and applications
- Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization
- Semidefinite programming for discrete optimization and matrix completion problems
- Extended trust-region problems with one or two balls: exact copositive and Lagrangian relaxations
- On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls
- Zero duality gaps in infinite-dimensional programming
- A convergent hierarchy of SDP relaxations for a class of hard robust global polynomial optimization problems
- A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides
- A geometric characterization of strong duality in nonconvex quadratic programming with linear and nonconvex quadratic constraints
- A gentle, geometric introduction to copositive optimization
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Strong duality and KKT conditions in nonconvex optimization with a single equality constraint and geometric constraint
- Copositive Programming
- Strong Duality in Robust Convex Programming: Complete Characterizations
- Mixed 0-1 Linear Programs Under Objective Uncertainty: A Completely Positive Representation
- Theory and Applications of Robust Optimization
- Alternative Theorems for Quadratic Inequality Systems and Global Quadratic Optimization
- Copositive realxation for genera quadratic programming
- Robust sensitivity analysis of the optimal value of linear programming
- Exact Second-Order Cone Programming Relaxations for Some Nonconvex Minimax Quadratic Optimization Problems
- Conic Programming Reformulations of Two-Stage Distributionally Robust Linear Programs over Wasserstein Balls
- Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems
- On copositive programming and standard quadratic optimization problems
This page was built for publication: Convexifiability of continuous and discrete nonnegative quadratic programs for gap-free duality
