Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
From MaRDI portal
Publication:644906
DOI10.1007/s10107-011-0466-yzbMath1236.90089OpenAlexW1994114596WikidataQ57445451 ScholiaQ57445451MaRDI QIDQ644906
Xiaoling Sun, Xiao Jin Zheng, Li, Duan
Publication date: 7 November 2011
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-011-0466-y
semidefinite optimizationconvex relaxationmatrix conesquadratically constrained quadratic optimization
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items (15)
A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation ⋮ Optimal Information Blending with Measurements in the L2 Sphere ⋮ Optimization and operations research in mitigation of a pandemic ⋮ Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs ⋮ New bounds for nonconvex quadratically constrained quadratic programming ⋮ Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization ⋮ A novel optimization method for nonconvex quadratically constrained quadratic programs ⋮ Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods ⋮ Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint ⋮ Adaptive computable approximation to cones of nonnegative quadratic functions ⋮ Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming ⋮ Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization ⋮ An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation ⋮ Template polyhedra and bilinear optimization ⋮ Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Copositive and semidefinite relaxations of the quadratic assignment problem
- A linear programming reformulation of the standard quadratic optimization problem
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A simplicial branch-and-bound method for solving nonconvex all-quadratic programs
- Approximating global quadratic optimization with convex quadratic constraints
- Semidefinite programming relaxation for nonconvex quadratic programs
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- Approximation algorithms for quadratic programming
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- Approximating quadratic programming with bound and quadratic constraints
- Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
- Quadratic maximization and semidefinite relaxation
- A branch and cut algorithm for hub location problems with single assignment
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Robust optimization-methodology and applications
- A relaxation method for nonconvex quadratically constrained quadratic programs
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- BARON: A general purpose global optimization software package
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- On the copositive representation of binary and continuous nonconvex quadratic programs
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- D.C. versus copositive bounds for standard QP
- On Lagrangian Relaxation of Quadratic Matrix Constraints
- Approximation of the Stability Number of a Graph via Copositive Programming
- Jointly Constrained Biconvex Programming
- Matrix Analysis
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Semidefinite relaxation and nonconvex quadratic optimization
- New Results on Quadratic Minimization
- Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
- Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
- Semidefinite Programming
- A Copositive Programming Approach to Graph Partitioning
- On Cones of Nonnegative Quadratic Functions
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
- On copositive programming and standard quadratic optimization problems
This page was built for publication: Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
