SDP-based branch-and-bound for non-convex quadratic integer optimization
From MaRDI portal
Publication:2416574
DOI10.1007/s10898-018-0717-zzbMath1420.90037arXiv1901.10335OpenAlexW2898627243WikidataQ129023367 ScholiaQ129023367MaRDI QIDQ2416574
Angelika Wiegele, Christoph Buchheim, Maribel Montenegro
Publication date: 23 May 2019
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.10335
Uses Software
Cites Work
- Unnamed Item
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
- Combinatorial optimization. 4th international symposium, ISCO 2016, Vietri sul Mare, Italy, May 16--18, 2016. Revised selected papers
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- Alternating direction augmented Lagrangian methods for semidefinite programming
- An unconstrained minimization method for solving low-rank SDP relaxations of the maxcut problem
- Handbook on semidefinite, conic and polynomial optimization
- Extending the QCR method to general mixed-integer programs
- An effective branch-and-bound algorithm for convex quadratic integer programming
- Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound
- The quadratic knapsack problem -- a survey
- An algorithmic framework for convex mixed integer nonlinear programs
- Complementarity and nondegeneracy in semidefinite programming
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- A semidefinite programming approach to the quadratic knapsack problem
- Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods
- A semidefinite programming method for integer convex quadratic minimization
- A polyhedral branch-and-cut approach to global optimization
- Solving the max-cut problem using eigenvalues
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- A Feasible Active Set Method with Reoptimization for Convex Quadratic Mixed-Integer Programming
- Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations
- Ellipsoid Bounds for Convex Quadratic Integer Programming
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- Branching and bounds tighteningtechniques for non-convex MINLP
- On Nonconvex Quadratic Programming with Box Constraints
- LAPACK Users' Guide
- CSDP, A C library for semidefinite programming
- A Spectral Bundle Method for Semidefinite Programming
- Regularization Methods for Semidefinite Programming
- A Convergent 3-Block SemiProximal Alternating Direction Method of Multipliers for Conic Programming with 4-Type Constraints
- Solving Lift-and-Project Relaxations of Binary Integer Programs
- Handbook of semidefinite programming. Theory, algorithms, and applications
