Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
From MaRDI portal
Publication:839489
DOI10.1007/s10589-007-9137-6zbMath1170.90522OpenAlexW2025308368MaRDI QIDQ839489
Samuel Burer, Dieter Vandenbussche
Publication date: 2 September 2009
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-007-9137-6
semidefinite programmingbranch-and-boundnonconvex quadratic programminglift-and-project relaxationsnonconcave quadratic maximization
Related Items
A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation, An accelerating algorithm for globally solving nonconvex quadratic programming, Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods, Disjunctive Cuts for Nonconvex MINLP, Cutting Plane Generation through Sparse Principal Component Analysis, A New Global Optimization Scheme for Quadratic Programs with Low-Rank Nonconvexity, Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach, A spatial branch-and-cut method for nonconvex QCQP with bounded complex variables, Skyport location problem for urban air mobility system, Using ℓ1-Relaxation and Integer Programming to Obtain Dual Bounds for Sparse PCA, Imposing symmetry in augmented linear systems, A computational study on QP problems with general linear constraints, SDP-based branch-and-bound for non-convex quadratic integer optimization, A new global algorithm for factor-risk-constrained mean-variance portfolio selection, Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods, (Global) optimization: historical notes and recent developments, Outer-product-free sets for polynomial optimization and oracle-based cuts, Separation and relaxation for cones of quadratic forms, 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, Using general triangle inequalities within quadratic convex reformulation method, A parametric linear relaxation algorithm for globally solving nonconvex quadratic programming, Effective algorithms for optimal portfolio deleveraging problem with cross impact, Domain reduction techniques for global NLP and MINLP optimization, An LPCC approach to nonconvex quadratic programs, On linear programs with linear complementarity constraints, Enhancing RLT-based relaxations for polynomial programming problems via a new class of \(v\)-semidefinite cuts, Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques, Solving Quadratic Programming by Cutting Planes, New global algorithms for quadratic programming with a few negative eigenvalues based on alternative direction method and convex relaxation, Optimal portfolio deleveraging under market impact and margin restrictions, Bounds tightening based on optimality conditions for nonconvex box-constrained optimization, Global solution of non-convex quadratically constrained quadratic programs, Semidefinite relaxation for linear programs with equilibrium constraints, Relaxing the optimality conditions of box QP, Globally solving nonconvex quadratic programming problems via completely positive programming, Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs, Optimizing a polyhedral-semidefinite relaxation of completely positive programs, An algorithm for nonlinear optimization problems with binary variables, A binarisation heuristic for non-convex quadratic programming with box constraints, An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation, Complexity Results and Effective Algorithms for Worst-Case Linear Optimization Under Uncertainties, Tight compact extended relaxations for nonconvex quadratic programming problems with box constraints
Uses Software
Cites Work
- Global optimization algorithms for linearly constrained indefinite quadratic problems
- 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
- A polyhedral study of nonconvex quadratic programs with box constraints
- A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
- Solving large quadratic assignment problems on computational grids
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- A semidefinite programming heuristic for quadratic programming problems with complementarity constraints
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Fixing Variables in Semidefinite Relaxations
- Solving Lift-and-Project Relaxations of Binary Integer Programs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
