Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation

DOI10.1007/S10107-011-0466-YzbMATH Open1236.90089DBLPjournals/mp/ZhengSL11OpenAlexW1994114596WikidataQ57445451 ScholiaQ57445451MaRDI QIDQ644906FDOQ644906

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)
BARON: A general purpose global optimization software package
Matrix Analysis
Semidefinite Programming
On the copositive representation of binary and continuous nonconvex quadratic programs
Approximation of the stability number of a graph via copositive programming
Semidefinite relaxation and nonconvex quadratic optimization
New Results on Quadratic Minimization
On Cones of Nonnegative Quadratic Functions
Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
Copositive and semidefinite relaxations of the quadratic assignment problem
Robust optimization-methodology and applications
Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
Jointly Constrained Biconvex Programming
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
A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
A branch and cut algorithm for hub location problems with single assignment
A reformulation-linearization technique for solving discrete and continuous nonconvex problems
Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
A simplicial branch-and-bound method for solving nonconvex all-quadratic programs
Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
A relaxation method for nonconvex quadratically constrained quadratic programs
A reformulation-convexification approach for solving nonconvex quadratic programming problems
Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
On copositive programming and standard quadratic optimization problems
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
Semidefinite programming relaxation for nonconvex quadratic programs
Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
A Copositive Programming Approach to Graph Partitioning
Approximating quadratic programming with bound and quadratic constraints
Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
D.C. versus copositive bounds for standard QP
Quadratic maximization and semidefinite relaxation
A linear programming reformulation of the standard quadratic optimization problem
On Lagrangian relaxation of quadratic matrix constraints
Approximating global quadratic optimization with convex quadratic constraints
Approximation algorithms for quadratic programming
Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation

Cited In (21)

A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation
Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming
Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
New bounds for nonconvex quadratically constrained quadratic programming
Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs
Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint
Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization
Domain Contraction in Nonlinear Programming: Minimizing a Quadratic Concave Objective Over a Polyhedron
Template polyhedra and bilinear optimization
Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
Adaptive computable approximation to cones of nonnegative quadratic functions
Computational methods for solving nonconvex block-separable constrained quadratic problems
An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation
A novel optimization method for nonconvex quadratically constrained quadratic programs
Optimal Information Blending with Measurements in the L² Sphere
Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
On convex relaxations for quadratically constrained quadratic programming
On convex relaxations of quadrilinear terms
Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
Optimization and operations research in mitigation of a pandemic

Uses Software

BARON
CVX

Recommendations

This page was built for publication: Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q644906)