New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
type: Item
instance of: scholarly article
title: New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
zbMATH Open document ID: 1411.90251
author: Hezhi Luo
author: Xiaodi Bai
author: Gino J. Lim
author: Jiming Peng
published in: Mathematical Programming Computation
publication date: 2019-05-03T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 7050497
zbMATH Keywords: quadratic programming
zbMATH Keywords: alternative direction method
zbMATH Keywords: convex relaxation
zbMATH Keywords: branch-and-bound
zbMATH Keywords: line search
zbMATH Keywords: computational complexity
describes a project that uses: QuadProgBB
describes a project that uses: BARON
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: s12532-018-0142-9
OpenAlex ID: W2888026831
cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
cites work: Q4821526
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: Biconvex sets and optimization with biconvex functions: a survey and extensions
cites work: An FPTAS for minimizing the product of two non-negative linear cost functions
cites work: DC programming: overview.
cites work: Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
cites work: Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
cites work: Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization.
cites work: A cutting plane algorithm for solving bilinear programs
cites work: Global optimization with polynomials and the problem of moments
cites work: A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
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 efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
cites work: Necessary conditions for ε-optimality
cites work: Cones of Matrices and Set-Functions and 0–1 Optimization
cites work: \(NP\)-hardness of linear multiplicative programming and related problems
cites work: Optimality conditions and finite convergence of Lasserre's hierarchy
cites work: Nonlinear Optimization by Successive Linear Programming
cites work: Computational aspects of a branch and bound algorithm for quadratic zero- one programming
cites work: Global optimization algorithms for linearly constrained indefinite quadratic problems
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: A nonlinear semidefinite optimization relaxation for the worst-case linear optimization under uncertainties
cites work: BARON: A general purpose global optimization software package
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: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
cites work: A reformulation-convexification approach for solving nonconvex quadratic programming problems
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: Handbook of semidefinite programming. Theory, algorithms, and applications
cites work: On the complexity of approximating a KKT point of quadratic programming
cites work: Quadratic maximization and semidefinite relaxation
DOI: 10.1007/S12532-018-0142-9
Wikidata QID: Q129399865
description: scientific article; zbMATH DE number 7050497