Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
From MaRDI portal
(Redirected from Publication:645557)
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
Cites work
- scientific article; zbMATH DE number 4164557 (Why is no real title available?)
- scientific article; zbMATH DE number 4070633 (Why is no real title available?)
- scientific article; zbMATH DE number 2121575 (Why is no real title available?)
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems
- A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
- 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
- An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions
- Approximating global quadratic optimization with convex quadratic constraints
- BARON: A general purpose global optimization software package
- Branch-and-bound approaches to standard quadratic optimization problems
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Computing a Trust Region Step
- Constrained global optimization: algorithms and applications
- Convex Relaxations of (0, 1)-Quadratic Programming
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- D.C. versus copositive bounds for standard QP
- Enhancing RLT relaxations via a new class of semidefinite cuts
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- Global minimization of indefinite quadratic problems
- Global minimization of large-scale constrained concave quadratic problems by separable programming
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- On copositive programming and standard quadratic optimization problems
- Quadratic maximization and semidefinite relaxation
- Quadratic programming with one negative eigenvalue is NP-hard
- Second order cone programming relaxation of nonconvex quadratic optimization problems
- 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
- Undominated d.c. decompositions of quadratic functions and applications to branch-and-bound approaches
Cited in
(27)- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- On indefinite quadratic optimization over the intersection of balls and linear constraints
- Dynamically generated cutting planes for mixed-integer quadratically constrained quadratic programs and their incorporation into GloMIQO 2
- A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
- A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program
- An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation
- A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs
- On convex relaxations for quadratically constrained quadratic programming
- A hybrid method for solving non-convex min-max quadratic fractional problems under quadratic constraints
- Outer space branch and bound algorithm for solving linear multiplicative programming problems
- Computational methods for solving nonconvex block-separable constrained quadratic problems
- Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization
- DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs
- Disjoint Bilinear Optimization: A Two-Stage Robust Optimization Perspective
- An optimal D.C. decomposition algorithm for quadratic program with a single quadratic constraint
- Global optimization algorithm for mixed integer quadratically constrained quadratic program
- A model for clustering data from heterogeneous dissimilarities
- Sustainable two stage supply chain management: a quadratic optimization approach with a quadratic constraint
- On solving quadratically constrained quadratic programming problem with one non-convex constraint
- Faster, but weaker, relaxations for quadratically constrained quadratic programs
- Conic approximation to nonconvex quadratic programming with convex quadratic constraints
- A new spatial branch and bound algorithm for quadratic program with one quadratic constraint and linear constraints
- 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
- On global optimization with indefinite quadratics
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)
