Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
From MaRDI portal
Publication:644906
Recommendations
- Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs
- On convex relaxations for quadratically constrained quadratic programming
- A relaxation method for nonconvex quadratically constrained quadratic programs
- Conic approximation to nonconvex quadratic programming with convex quadratic constraints
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- Convex Relaxations of (0, 1)-Quadratic Programming
- A new convex relaxation for quadratically constrained quadratic programming
- Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming
- scientific article; zbMATH DE number 1380758
Cites work
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- A Copositive Programming Approach to Graph Partitioning
- A branch and cut algorithm for hub location problems with single assignment
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- A linear programming reformulation of the standard quadratic optimization problem
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- A relaxation method for nonconvex quadratically constrained quadratic programs
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- A simplicial branch-and-bound method for solving nonconvex all-quadratic programs
- Approximating global quadratic optimization with convex quadratic constraints
- Approximating quadratic programming with bound and quadratic constraints
- Approximation algorithms for quadratic programming
- Approximation of the stability number of a graph via copositive programming
- BARON: A general purpose global optimization software package
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
- Convex envelopes of multilinear functions over a unit hypercube and over special discrete sets
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Copositive and semidefinite relaxations of the quadratic assignment problem
- D.C. versus copositive bounds for standard QP
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- Further Results on Approximating Nonconvex Quadratic Optimization by Semidefinite Programming Relaxation
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
- Jointly Constrained Biconvex Programming
- Matrix Analysis
- New Results on Quadratic Minimization
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- On Cones of Nonnegative Quadratic Functions
- On Lagrangian relaxation of quadratic matrix constraints
- On copositive programming and standard quadratic optimization problems
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Quadratic maximization and semidefinite relaxation
- Robust optimization-methodology and applications
- Semidefinite Programming
- Semidefinite programming relaxation for nonconvex quadratic programs
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Semidefinite relaxation and nonconvex quadratic optimization
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- Strong Duality in Nonconvex Quadratic Optimization with Two Quadratic Constraints
Cited in
(34)- Second order cone constrained convex relaxations for nonconvex quadratically constrained quadratic programming
- Completely positive and completely positive semidefinite tensor relaxations for polynomial optimization
- Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs
- Adaptive computable approximation to cones of nonnegative quadratic functions
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- Optimizing a polyhedral-semidefinite relaxation of completely positive programs
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
- An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation
- Branch-delete-bound algorithm for globally solving quadratically constrained quadratic programs
- Optimal information blending with measurements in the \(L^{2}\) sphere
- An alternative perspective on copositive and convex relaxations of nonconvex quadratic programs
- Convex relaxations for mixed integer predictive control
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation
- Convexifications of rank-one-based substructures in QCQPs and applications to the pooling problem
- Optimization and operations research in mitigation of a pandemic
- Domain Contraction in Nonlinear Programming: Minimizing a Quadratic Concave Objective Over a Polyhedron
- Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming
- A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs
- On convex relaxations for quadratically constrained quadratic programming
- Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
- A new SOCP relaxation of nonconvex quadratic programming problems with a few negative eigenvalues
- New bounds for nonconvex quadratically constrained quadratic programming
- A novel optimization method for nonconvex quadratically constrained quadratic programs
- Computational methods for solving nonconvex block-separable constrained quadratic problems
- New positive semidefinite relaxations for nonconvex quadratic programs
- Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization
- On convex relaxations of quadrilinear terms
- A matrix nonconvex relaxation approach to unconstrained binary polynomial programs
- Template polyhedra and bilinear optimization
- Faster, but weaker, relaxations for quadratically constrained quadratic programs
- Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems
- Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint
- Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
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)
