New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation
From MaRDI portal
Publication:1741128
DOI10.1007/s12532-018-0142-9zbMath1411.90251OpenAlexW2888026831MaRDI QIDQ1741128
Xiaodi Bai, Jiming Peng, Hezhi Luo, Gino J. Lim
Publication date: 3 May 2019
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12532-018-0142-9
computational complexityquadratic programmingbranch-and-boundconvex relaxationline searchalternative direction method
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items
A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation, A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity, Global optimization algorithm for solving linear multiplicative programming problems, A new global algorithm for factor-risk-constrained mean-variance portfolio selection, Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems, Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound, An effective global algorithm for worst-case linear optimization under polyhedral uncertainty, Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints, Effective algorithms for optimal portfolio deleveraging problem with cross impact, Convergence analysis of modified \(p\)th power Lagrangian algorithms with alternative updating strategies for constrained nonconvex optimization, An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation, ADMBB, Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties, A new SOCP relaxation of nonconvex quadratic programming problems with a few negative eigenvalues
Uses Software
Cites Work
- Unnamed Item
- Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
- Optimality conditions and finite convergence of Lasserre's hierarchy
- A nonlinear semidefinite optimization relaxation for the worst-case linear optimization under uncertainties
- Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience
- An FPTAS for minimizing the product of two non-negative linear cost functions
- Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations
- Approximation algorithms for indefinite quadratic programming
- A branch and reduce approach for solving a class of low rank d.c. programs
- Global optimization algorithms for linearly constrained indefinite quadratic problems
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- Checking local optimality in constrained quadratic programming is NP- hard
- Quadratic programming with one negative eigenvalue is NP-hard
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
- New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- On the complexity of approximating a KKT point of quadratic programming
- Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxa\-tions
- An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
- Quadratic maximization and semidefinite relaxation
- Globally solving nonconvex quadratic programming problems via completely positive programming
- A polyhedral study of nonconvex quadratic programs with box constraints
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- A finite algorithm for a particular D.C. quadratic programming problem
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- BARON: A general purpose global optimization software package
- DC programming: overview.
- Biconvex sets and optimization with biconvex functions: a survey and extensions
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- \(NP\)-hardness of linear multiplicative programming and related problems
- Convex relaxations of non-convex mixed integer quadratically constrained programs: Extended formulations
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Global Optimization with Polynomials and the Problem of Moments
- A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
- Necessary conditions for ε-optimality
- Cones of Matrices and Set-Functions and 0–1 Optimization
- A cutting plane algorithm for solving bilinear programs
- Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets
- Nonlinear Optimization by Successive Linear Programming
- A Comparison of the Sherali-Adams, Lovász-Schrijver, and Lasserre Relaxations for 0–1 Programming
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization.
