A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation
type: Item
instance of: scholarly article
title: A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation
zbMATH Open document ID: 1489.65087
author: Hezhi Luo
author: Sikai Chen
author: Huixian Wu
published in: Numerical Algorithms
publication date: 2021-09-27T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 7401550
zbMATH Keywords: quadratic programming
zbMATH Keywords: branch-and-cut algorithm
zbMATH Keywords: alternative direction method
zbMATH Keywords: semidefinite relaxation
zbMATH Keywords: computational complexity
describes a project that uses: ADMBB
describes a project that uses: CPLEX
describes a project that uses: SeDuMi
describes a project that uses: SDPT3
describes a project that uses: CVX
describes a project that uses: QuadProgBB
MaRDI profile type: Publication
full work available at URL: s11075-020-01065-7
OpenAlex ID: W3167349343
cites work: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
cites work: Computable representations for convex hulls of low-dimensional quadratic forms
cites work: Representing quadratically constrained quadratic programs as generalized copositive programs
cites work: A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
cites work: Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
cites work: A branch and reduce approach for solving a class of low rank d.c. programs
cites work: Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience
cites work: A finite algorithm for a particular D.C. quadratic programming problem
cites work: Globally solving nonconvex quadratic programming problems via completely positive programming
cites work: Q4833806
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
cites work: A cutting plane algorithm for solving bilinear programs
cites work: Q4833809
cites work: An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
cites work: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
cites work: A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
cites work: An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
cites work: New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
cites work: Enhancing semidefinite relaxation for quadratically constrained quadratic programming via penalty methods
cites work: \(NP\)-hardness of linear multiplicative programming and related problems
cites work: Semidefinite relaxation and nonconvex quadratic optimization
cites work: Nonlinear Optimization by Successive Linear Programming
cites work: Checking local optimality in constrained quadratic programming is NP- hard
cites work: Quadratic programming with one negative eigenvalue is NP-hard
cites work: Semidefinite programming relaxations for semialgebraic problems
cites work: Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting
cites work: Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
cites work: Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
cites work: Global algorithm for solving linear multiplicative programming problems
cites work: A reformulation-linearization technique for solving discrete and continuous nonconvex problems
cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
cites work: SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
cites work: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
cites work: A polyhedral study of nonconvex quadratic programs with box constraints
cites work: Approximation algorithms for indefinite quadratic programming
cites work: New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
cites work: A practicable branch-and-bound algorithm for globally solving linear multiplicative programming
cites work: On the complexity of approximating a KKT point of quadratic programming
cites work: Approximating quadratic programming with bound and quadratic constraints
cites work: Quadratic maximization and semidefinite relaxation
cites work: Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation
cites work: Nonconvex quadratically constrained quadratic programming: Best D.C. Decompositions and their SDP representations
DOI: 10.1007/S11075-020-01065-7
description: scientific article; zbMATH DE number 7401550