A filled function method for quadratic programs with binary constraints†

DOI10.1080/02331930902928757MaRDI QIDQ5193139zbMATH OpenOpenAlexFDO

Authors Zhiyou Wu, Yongjian Yang, Fusheng Bai

Publication date 11 August 2009

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331930902928757

zbMATH Keywords

global optimizationglobal optimality conditionsfilled function methodbinary constraintsquadratic programs

Mathematics Subject Classification ID

Quadratic programming (90C20) Combinatorial optimization (90C27)

Recommendations

• Sufficient global optimality conditions for bivalent quadratic optimization
• Global optimality conditions for quadratic optimization problems with binary constraints
• Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition
• New optimality conditions for quadratic optimization problems with binary constraints
• Optimality conditions for the minimization of quadratic 0-1 problems

Cites work

• A class of filled functions for finding global minimizers of a function of several variables
• A filled function method for finding a global minimizer of a function of several variables
• A new filled function method for nonlinear integer programming problem
• An approximate algorithm for nonlinear integer programming
• Computational aspects of a branch and bound algorithm for quadratic zero- one programming
• Discrete filled function method for discrete global optimization
• Global optimality conditions for mixed nonconvex quadratic programs†
• Global optimality conditions for quadratic optimization problems with binary constraints
• Global optimization techniques for solving the general quadratic integer programming problem
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Lagrangian smoothing heuristics for Max-cut
• Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
• Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures
• Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs
• The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
• Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
• ``Miniaturized linearizations for quadratic 0/1 problems

Cited in

(3)

• A continuation approach for solving binary quadratic program based on a class of NCP-functions
• A class of non-limiting factor filling functions for global minimization
• Optimality conditions for the minimization of quadratic 0-1 problems

This page was built for publication: A filled function method for quadratic programs with binary constraints†

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5193139)