A global continuation algorithm for solving binary quadratic programming problems
From MaRDI portal
Publication:1029635
DOI10.1007/s10589-007-9110-4zbMath1168.90571OpenAlexW2011044831MaRDI QIDQ1029635
Tao Tan, Yuxi Jiang, Shaohua Pan
Publication date: 13 July 2009
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-007-9110-4
logarithmic barrier functionFischer-Burmeister functionbinary quadratic programmingglobal continuation algorithm
Related Items (11)
An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions ⋮ Mathematical Programming Models and Exact Algorithms ⋮ Building an iterative heuristic solver for a quantum annealer ⋮ A gradient-based approach for discrete optimum design ⋮ The unconstrained binary quadratic programming problem: a survey ⋮ Adaptive randomization in network data ⋮ A smoothing method for zero--one constrained extremum problems ⋮ An algorithm for nonlinear optimization problems with binary variables ⋮ Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation ⋮ Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem ⋮ A continuation approach for solving binary quadratic program based on a class of NCP-functions
Uses Software
Cites Work
- Pseudo-Boolean optimization
- Semidefinite programming for discrete optimization and matrix completion problems
- Unconstrained 0-1 nonlinear programming: A nondifferentiable approach
- A quadratic assignment formulation of the molecular conformation problem
- Solution of monotone complementarity problems with locally Lipschitzian functions
- One-pass heuristics for large-scale unconstrained binary quadratic problems
- A unified modeling and solution framework for combinatorial optimization problems
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs
- An exact penalty approach for solving a class of minimization problems with boolean variables
- Equivalence of the Complementarity Problem to a System of Nonlinear Equations
- 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
- A special newton-type optimization method
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- A Decomposition Method for Quadratic Zero-One Programming
- Convex Relaxations of (0, 1)-Quadratic Programming
- A branch and bound algorithm for the maximum clique problem
- Unnamed Item
- Unnamed Item
This page was built for publication: A global continuation algorithm for solving binary quadratic programming problems
