Invariants of SDP exactness in quadratic programming
From MaRDI portal
Publication:6184179
DOI10.1016/j.jsc.2023.102258arXiv2211.05645OpenAlexW4386071165MaRDI QIDQ6184179
Julia Lindberg, Jose Israel Rodriguez
Publication date: 5 January 2024
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2211.05645
Cites Work
- Unnamed Item
- Optimality conditions and finite convergence of Lasserre's hierarchy
- The unconstrained binary quadratic programming problem: a survey
- Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid
- Semidefinite programming relaxation for nonconvex quadratic programs
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- Semidefinite programming relaxations for semialgebraic problems
- Some results for quadratic problems with one or two quadratic constraints
- On a positive semidefinite relaxation of the cut polytope
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- On the tightness of SDP relaxations of QCQPs
- On the local stability of semidefinite relaxations
- Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs
- The geometry of SDP-exactness in quadratic optimization
- Quadratic programming is in NP
- Global Optimization with Polynomials and the Problem of Moments
- Convex hull of two quadratic constraints is an LMI set
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- On Convex Hulls of Epigraphs of QCQPs
- Exploiting symmetry in the power flow equations using monodromy
- TSSOS: A Moment-SOS Hierarchy That Exploits Term Sparsity
- Exploiting Symmetries in SDP-Relaxations for Polynomial Optimization
- Exactness of Semidefinite Relaxations for Nonlinear Optimization Problems with Underlying Graph Structure
This page was built for publication: Invariants of SDP exactness in quadratic programming
