Ellipsoid Bounds for Convex Quadratic Integer Programming

DOI10.1137/130929187zbMath1358.90076OpenAlexW1993661885MaRDI QIDQ2954394

Ruth Hübner, Anita Schöbel, Christoph Buchheim

Publication date: 13 January 2017

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/130929187

zbMATH Keywords

branch-and-boundquadratic integer programmingellipsoidal approximation

Mathematics Subject Classification ID

Convex programming (90C25) Integer programming (90C10) Quadratic programming (90C20)

Related Items (6)

A decision space algorithm for multiobjective convex quadratic integer optimization ⋮ SDP-based branch-and-bound for non-convex quadratic integer optimization ⋮ A semidefinite programming method for integer convex quadratic minimization ⋮ Norm bounds and underestimators for unconstrained polynomial integer minimization ⋮ Extensions on ellipsoid bounds for quadratic integer programming ⋮ On local nonglobal minimum of trust-region subproblem and extension

Cites Work

• Unnamed Item
• Semidefinite relaxations for non-convex quadratic mixed-integer programming
• Extending the QCR method to general mixed-integer programs
• An effective branch-and-bound algorithm for convex quadratic integer programming
• Some proximity and sensitivity results in quadratic integer programming
• Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
• A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
• An efficient compact quadratic convex reformulation for general integer quadratic programs
• A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
• When is rounding allowed in integer nonlinear optimization?
• An Exact Algorithm for Nonconvex Quadratic Integer Minimization Using Ellipsoidal Relaxations
• The MILP Road to MIQCP
• Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
• Eigenvalue Techniques for Convex Objective, Nonconvex Optimization Problems
• Branch and Bound Experiments in Convex Nonlinear Integer Programming
• An Implicit Enumeration Algorithm for Quadratic Integer Programming
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Semidefinite Programming
• Further Reduction of Zero-One Polynomial Programming Problems to Zero-One linear Programming Problems

This page was built for publication: Ellipsoid Bounds for Convex Quadratic Integer Programming