Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
From MaRDI portal
Publication:645557
DOI10.1007/S10898-010-9630-9zbMath1254.90151DBLPjournals/jgo/ZhengSL11OpenAlexW2013585593WikidataQ57445456 ScholiaQ57445456MaRDI QIDQ645557
Publication date: 8 November 2011
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-010-9630-9
feasible solutionpiecewise linear approximationsemidefinite programnonconvex quadratically constrained quadratic programmingoptimal D.C. decomposition
Related Items (25)
A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation ⋮ A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program ⋮ A hybrid method for solving non-convex min–max quadratic fractional problems under quadratic constraints ⋮ Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective ⋮ A model for clustering data from heterogeneous dissimilarities ⋮ On convex relaxations for quadratically constrained quadratic programming ⋮ Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2 ⋮ On indefinite quadratic optimization over the intersection of balls and linear constraints ⋮ Sustainable two stage supply chain management: a quadratic optimization approach with a quadratic constraint ⋮ On global optimization with indefinite quadratics ⋮ Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation ⋮ Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods ⋮ A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems ⋮ A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs ⋮ Global optimization algorithm for mixed integer quadratically constrained quadratic program ⋮ Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint ⋮ Conic approximation to nonconvex quadratic programming with convex quadratic constraints ⋮ Outer space branch and bound algorithm for solving linear multiplicative programming problems ⋮ Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization ⋮ DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs ⋮ On solving quadratically constrained quadratic programming problem with one non-convex constraint ⋮ A new spatial branch and bound algorithm for quadratic program with one quadratic constraint and linear constraints ⋮ An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation ⋮ Faster, but weaker, relaxations for quadratically constrained quadratic programs ⋮ Computational Methods for Solving Nonconvex Block-Separable Constrained Quadratic Problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Branch-and-bound approaches to standard quadratic optimization problems
- Enhancing RLT relaxations via a new class of semidefinite cuts
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
- Global minimization of indefinite quadratic problems
- Constrained global optimization: algorithms and applications
- Quadratic programming with one negative eigenvalue is NP-hard
- 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
- A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- Quadratic maximization and semidefinite relaxation
- A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs
- Undominated d.c. decompositions of quadratic functions and applications to branch-and-bound approaches
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A relaxation method for nonconvex quadratically constrained quadratic programs
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- BARON: A general purpose global optimization software package
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- D.C. versus copositive bounds for standard QP
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- Computing a Trust Region Step
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions
- 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
- Convex Relaxations of (0, 1)-Quadratic Programming
- Semidefinite Programming
- On copositive programming and standard quadratic optimization problems
This page was built for publication: Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
