Global optimality conditions and optimization methods for quadratic integer programming problems
type: Item
instance of: scholarly article
title: Global optimality conditions and optimization methods for quadratic integer programming problems
zbMATH Open document ID: 1247.90199
published in: Journal of Global Optimization
publication date: 2011-12-15T00:00:00Z
review text: This paper establishes some sufficient and some necessary global optimality conditions for quadratic integer programming problems. The results given in this work extend results presented in [\textit{A. Beck} and \textit{M. Teboulle}, SIAM J. Optim. 11, No. 1, 179--188 (2000; Zbl 0990.90089)]; [\textit{W. Chen} and \textit{L. Zhang}, J. Glob. Optim. 46, No. 2, 191--206 (2010; Zbl 1209.90292)] and [\textit{V. Jeyakumar}, \textit{A. M. Rubinov} and \textit{Z.Y. Wu}, Math. Program. 110, No. 3, 521--541 (2007; Zbl 1206.90178)]. The authors develop a new local optimization method by exploiting the obtained necessary global optimality condition and propose a new global optimization method by combining the sufficient global optimality condition, the local optimization method and an auxiliary function. Some numerical examples are provided to illustrate the performance of both optimization methods.
reviewed by: Marta Mesquita
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C46
zbMATH DE Number: 5988576
zbMATH Keywords: global optimality conditions
zbMATH Keywords: quadratic integer programming problem
zbMATH Keywords: optimization method
zbMATH Keywords: auxiliary function
author: Zhiyou Wu
author: G. Q. Li
author: J. Quan
describes a project that uses: CirCut
describes a project that uses: Outward rotations
MaRDI profile type: Publication
full work available at URL: s10898-011-9650-0
OpenAlex ID: W1971586018
cites work: Lagrangian smoothing heuristics for Max-cut
cites work: Global optimality conditions for quadratic optimization problems with binary constraints
cites work: Q4247459
cites work: A Max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO)
cites work: Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
cites work: Global optimality conditions for quadratic \(0-1\) optimization problems
cites work: An algorithm for indefinite integer quadratic programming
cites work: Quadratic binary programming models in computational biology
cites work: Q4198056
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: New bounds on the unconstrained quadratic integer programming problem
cites work: Lower bound improvement and forcing rule for quadratic binary programming
cites work: A new variable reduction technique for convex integer quadratic programs
cites work: Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures
cites work: Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
cites work: On the gap between the quadratic integer programming problem and its semidefinite relaxation
cites work: An enumerative algorithm framework for a class of nonlinear integer programming problems
cites work: Computational aspects of a branch and bound algorithm for quadratic zero- one programming
cites work: The equitable dispersion problem
cites work: Ranking in quadratic integer programming problems
cites work: Abstract convexity and global optimization
cites work: Global optimization techniques for solving the general quadratic integer programming problem
cites work: An approximate algorithm for nonlinear integer programming
cites work: An algorithmic approach to analyse genetic networks and biological energy production: an introduction and contribution where OR meets biology†
cites work: A provable better Branch and Bound method for a nonconvex integer quadratic programming problem
cites work: Outward rotations: a tool for rounding solutions of semidefinite programming relaxations, with applications to max cut and other problems
DOI: 10.1007/S10898-011-9650-0
description: scientific article; zbMATH DE number 5988576