On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
From MaRDI portal
Publication:360522
DOI10.1007/S11590-012-0450-3zbMath1298.90064OpenAlexW4256141204MaRDI QIDQ360522
Janez Povh, Gabriele Eichfelder
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-012-0450-3
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items (17)
Extension of completely positive cone relaxation to moment cone relaxation for polynomial optimization ⋮ On equivalent representations and properties of faces of the cone of copositive matrices ⋮ The Convex Feasible Set Algorithm for Real Time Optimization in Motion Planning ⋮ Erratum to: ``On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets ⋮ Interplay of non-convex quadratically constrained problems with adjustable robust optimization ⋮ Moment approximations for set-semidefinite polynomials ⋮ Exact computable representation of some second-order cone constrained quadratic programming problems ⋮ On constraint qualifications for second-order optimality conditions depending on a single Lagrange multiplier ⋮ Optimization under uncertainty and risk: quadratic and copositive approaches ⋮ Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems ⋮ Convex hull results on quadratic programs with non-intersecting constraints ⋮ Sparse conic reformulation of structured QCQPs based on copositive optimization with applications in stochastic optimization ⋮ New bounds for nonconvex quadratically constrained quadratic programming ⋮ Representing quadratically constrained quadratic programs as generalized copositive programs ⋮ Quadratic optimization over a second-order cone with linear equality constraints ⋮ Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques ⋮ An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
Cites Work
- Unnamed Item
- Unnamed Item
- Representing quadratically constrained quadratic programs as generalized copositive programs
- Copositive and semidefinite relaxations of the quadratic assignment problem
- The difference between \(5\times 5\) doubly nonnegative and completely positive matrices
- On the computation of \(C^*\) certificates
- Copositivity detection by difference-of-convex decomposition and \(\omega \)-subdivision
- A note on Burer's copositive representation of mixed-binary QPs
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Algorithmic copositivity detection by simplicial partition
- Computable representations for convex hulls of low-dimensional quadratic forms
- Approximation of the Stability Number of a Graph via Copositive Programming
- A semidefinite programming approach to the hypergraph minimum bisection problem
- Foundations of Set-Semidefinite Optimization
- An Adaptive Linear Approximation Algorithm for Copositive Programs
- A Copositive Programming Approach to Graph Partitioning
- On Cones of Nonnegative Quadratic Functions
- A Survey of the S-Lemma
- On copositive programming and standard quadratic optimization problems
This page was built for publication: On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets
