A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation
From MaRDI portal
Publication:820743
Recommendations
- A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- Globally solving nonconvex quadratic programming problems via completely positive programming
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
Cites work
- \(NP\)-hardness of linear multiplicative programming and related problems
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
- A branch and reduce approach for solving a class of low rank d.c. programs
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- A cutting plane algorithm for solving bilinear programs
- A finite algorithm for a particular D.C. quadratic programming problem
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- A polyhedral study of nonconvex quadratic programs with box constraints
- A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
- A reformulation-linearization technique for solving discrete and continuous nonconvex problems
- An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
- Approximating quadratic programming with bound and quadratic constraints
- Approximation algorithms for indefinite quadratic programming
- Checking local optimality in constrained quadratic programming is NP- hard
- Computable representations for convex hulls of low-dimensional quadratic forms
- Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- Global algorithm for solving linear multiplicative programming problems
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Globally solving nonconvex quadratic programming problems via completely positive programming
- scientific article; zbMATH DE number 757677 (Why is no real title available?)
- scientific article; zbMATH DE number 757680 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
- New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
- Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
- Nonlinear Optimization by Successive Linear Programming
- On the complexity of approximating a KKT point of quadratic programming
- Quadratic maximization and semidefinite relaxation
- Quadratic programming with one negative eigenvalue is NP-hard
- Representing quadratically constrained quadratic programs as generalized copositive programs
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting
- Semidefinite programming relaxations for semialgebraic problems
- 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
- Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
Cited in
(17)- A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables
- New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
- Globally solving nonconvex quadratic programming problems via completely positive programming
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- A branch and cut algorithm for nonconvex quadratically constrained quadratic programming
- New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming
- A low-dimensional SDP relaxation based spatial branch and bound method for nonconvex quadratic programs
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- A new rectangle branch-and-reduce approach for solving nonconvex quadratic programming problems
- A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems
- A new global algorithm for factor-risk-constrained mean-variance portfolio selection
- Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints
- An efficient branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs
- A self-adjustable branch-and-bound algorithm for solving linear multiplicative programming
- A novel global algorithm for solving linear multiplicative problem by integrating linear combination rule and branch-and-bound framework
- On the relaxation complexity of nonconvex quadratic global optimization
- An outcome space algorithm for solving general linear multiplicative programming
This page was built for publication: A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q820743)
