Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets

DOI10.1007/s11590-013-0645-2zbMath1298.90063OpenAlexW2158226611MaRDI QIDQ360523

Peter J. C. Dickinson, Gabriele Eichfelder, Janez Povh

Publication date: 27 August 2013

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-013-0645-2

Mathematics Subject Classification ID

Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)

Related Items

On conic QPCCs, conic QCQPs and completely positive programs ⋮ Moment approximations for set-semidefinite polynomials ⋮ Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems ⋮ Convex hull results on quadratic programs with non-intersecting constraints ⋮ A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems ⋮ Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques ⋮ Feasible Corrector-Predictor Interior-Point Algorithm for $P_{*} (\kappa)$-Linear Complementarity Problems Based on a New Search Direction ⋮ Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting ⋮ An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs ⋮ Completely positive reformulations for polynomial optimization ⋮ A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems

Cites Work

• On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
• A note on Burer's copositive representation of mixed-binary QPs
• On the copositive representation of binary and continuous nonconvex quadratic programs
• Unnamed Item