An Exact Algorithm for Nonconvex Quadratic Integer Minimization Using Ellipsoidal Relaxations
From MaRDI portal
Publication:2866210
DOI10.1137/120878495zbMath1282.90104OpenAlexW2171325208MaRDI QIDQ2866210
Laura Palagi, Christoph Buchheim, Mauro Piacentini, Marianna De Santis
Publication date: 13 December 2013
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/e5fc768e721b614be42abddb886c63f920a77465
Integer programming (90C10) Nonconvex programming, global optimization (90C26) Quadratic programming (90C20)
Related Items
A decision space algorithm for multiobjective convex quadratic integer optimization ⋮ \texttt{EXPEDIS}: an exact penalty method over discrete sets ⋮ A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants ⋮ Ellipsoid Bounds for Convex Quadratic Integer Programming ⋮ Quadratic Combinatorial Optimization Using Separable Underestimators ⋮ A polynomial case of convex integer quadratic programming problems with box integer constraints ⋮ Dual approaches for a specific class of integer nonlinear programming problems ⋮ Monomial-wise optimal separable underestimators for mixed-integer polynomial optimization ⋮ Extensions on ellipsoid bounds for quadratic integer programming ⋮ A fast branch-and-bound algorithm for non-convex quadratic integer optimization subject to linear constraints using ellipsoidal relaxations ⋮ Lower bounds for cubic optimization over the sphere ⋮ A Numerical Method for Solving Quadratic Integer Programming Problem ⋮ The generalized trust region subproblem: solution complexity and convex hull results
Uses Software
