A semidefinite programming method for integer convex quadratic minimization
From MaRDI portal
Publication:1749779
DOI10.1007/s11590-017-1132-yzbMath1401.90131arXiv1504.07672MaRDI QIDQ1749779
Stephen P. Boyd, Jae Hyun Park
Publication date: 28 May 2018
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.07672
convex optimization; branch-and-bound; mixed integer programming; semidefinite relaxation; integer quadratic programming
Related Items
Approximation Bounds for Sparse Programs, Learning Optimized Risk Scores, On the Burer-Monteiro method for general semidefinite programs, SDP-based branch-and-bound for non-convex quadratic integer optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- Supersparse linear integer models for optimized medical scoring systems
- An effective branch-and-bound algorithm for convex quadratic integer programming
- Factoring polynomials with rational coefficients
- Geometric algorithms and combinatorial optimization
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- The hardness of approximate optima in lattices, codes, and systems of linear equations
- Approximating CVP to within almost-polynomial factors is NP-hard
- MLAMBDA: a modified LAMBDA method for integer least-squares estimation
- Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations
- Ellipsoid Bounds for Convex Quadratic Integer Programming
- Graph Implementations for Nonsmooth Convex Programs
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- Eigenvalue Techniques for Convex Objective, Nonconvex Optimization Problems
- Linear Matrix Inequalities in System and Control Theory
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Closest point search in lattices
- Semidefinite Programming
- On the complexity of sphere decoding in digital communications
