An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions
From MaRDI portal
Publication:279813
DOI10.1007/S11590-015-0873-8zbMath1345.90060OpenAlexW2052563056MaRDI QIDQ279813
Publication date: 29 April 2016
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-015-0873-8
augmented Lagrangian methodcontinuous functionsbinary quadratic programmingBarzilai-Borwein-type methodmax-cut
Related Items (2)
A stabilized simulated annealing based Barzilai-Borwein method for the solution of unconstrained optimization problems ⋮ Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- An algorithm for nonlinear optimization problems with binary variables
- A global continuation algorithm for solving binary quadratic programming problems
- A continuation approach for solving binary quadratic program based on a class of NCP-functions
- Lagrangian smoothing heuristics for Max-cut
- A projected gradient algorithm for solving the maxcut SDP relaxation
- Rank-Two Relaxation Heuristics for MAX-CUT and Other Binary Quadratic Programs
- Feasible direction algorithm for solving the SDP relaxations of quadratic {−1, 1} programming problems
- Semidefinite optimization
- Two-Point Step Size Gradient Methods
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- A Spectral Bundle Method for Semidefinite Programming
- Convex Relaxations of (0, 1)-Quadratic Programming
This page was built for publication: An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions
