Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
From MaRDI portal
Publication:645557
DOI10.1007/S10898-010-9630-9zbMATH Open1254.90151DBLPjournals/jgo/ZhengSL11OpenAlexW2013585593WikidataQ57445456 ScholiaQ57445456MaRDI QIDQ645557FDOQ645557
Authors: Juan-Miguel Gracia 
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
Recommendations
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs
- A novel optimization method for nonconvex quadratically constrained quadratic programs
- Complexity and nonlinear semidefinite programming reformulation of \(\ell_1\)-constrained nonconvex quadratic optimization
- Decomposition methods for solving nonconvex quadratic programs via branch and bound
- An LPCC approach to nonconvex quadratic programs
- New bounds for nonconvex quadratically constrained quadratic programming
- DC approach to weakly convex optimization and nonconvex quadratic optimization problems
- Approximating non-convex quadratic programs by semidefinite and copositive programming
piecewise linear approximationsemidefinite programfeasible solutionnonconvex quadratically constrained quadratic programmingoptimal D.C. decomposition
Cites Work
- BARON: A general purpose global optimization software package
- Computing a Trust Region Step
- Semidefinite Programming
- Constrained global optimization: algorithms and applications
- Title not available (Why is that?)
- Semidefinite relaxation and nonconvex quadratic optimization
- Title not available (Why is that?)
- 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
- 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
- Convex Relaxations of (0, 1)-Quadratic Programming
- Quadratic programming with one negative eigenvalue is NP-hard
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- Enhancing RLT relaxations via a new class of semidefinite cuts
- Global minimization of indefinite quadratic 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
- On copositive programming and standard quadratic optimization problems
- Undominated d.c. decompositions of quadratic functions and applications to branch-and-bound approaches
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Semidefinite programming relaxation for nonconvex quadratic programs
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- 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
- An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions
- Branch-and-bound approaches to standard quadratic optimization problems
- Approximating global quadratic optimization with convex quadratic constraints
- A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems
- Title not available (Why is that?)
Cited In (27)
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation
- Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- Conic approximation to nonconvex quadratic programming with convex quadratic constraints
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
- Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint
- A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems
- A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program
- Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization
- DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs
- Faster, but weaker, relaxations for quadratically constrained quadratic programs
- A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs
- Outer space branch and bound algorithm for solving linear multiplicative programming problems
- Sustainable two stage supply chain management: a quadratic optimization approach with a quadratic constraint
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems
- A hybrid method for solving non-convex min-max quadratic fractional problems under quadratic constraints
- Computational methods for solving nonconvex block-separable constrained quadratic problems
- A model for clustering data from heterogeneous dissimilarities
- On global optimization with indefinite quadratics
- An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation
- On solving quadratically constrained quadratic programming problem with one non-convex constraint
- On indefinite quadratic optimization over the intersection of balls and linear constraints
- An optimal D.C. decomposition algorithm for quadratic program with a single quadratic constraint
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- On convex relaxations for quadratically constrained quadratic programming
- A new spatial branch and bound algorithm for quadratic program with one quadratic constraint and linear constraints
- Global optimization algorithm for mixed integer quadratically constrained quadratic program
Uses Software
This page was built for publication: Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q645557)
