A continuation approach for solving binary quadratic program based on a class of NCP-functions

DOI10.1016/j.amc.2012.10.033zbMath1311.90087OpenAlexW2164576999MaRDI QIDQ2344687

Jing-Fan Li, Jein-Shan Chen, Jia Wu

Publication date: 15 May 2015

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2012.10.033

zbMATH Keywords

nonlinear complementarity problemgeneralized Fischer-Burmeister functionbinary quadratic program

Mathematics Subject Classification ID

Quadratic programming (90C20)

Related Items (2)

An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions ⋮ Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation

Uses Software

• CirCut

Cites Work

• Unnamed Item
• An algorithm for nonlinear optimization problems with binary variables
• An \(R\)-linearly convergent derivative-free algorithm for nonlinear complementarity problems based on the generalized Fischer-Burmeister merit function
• The semismooth-related properties of a merit function and a descent method for the nonlinear complementarity problem
• A family of NCP functions and a descent method for the nonlinear complementarity problem
• A global continuation algorithm for solving binary quadratic programming problems
• A quadratic assignment formulation of the molecular conformation problem
• Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs
• 0-1 Quadratic programming approach for optimum solutions of two scheduling problems
• Convex Relaxations of (0, 1)-Quadratic Programming
• A branch and bound algorithm for the maximum clique problem
• Benchmarking optimization software with performance profiles.

This page was built for publication: A continuation approach for solving binary quadratic program based on a class of NCP-functions