Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation
From MaRDI portal
Publication:2307500
DOI10.1007/s10878-019-00517-8zbMath1441.90093OpenAlexW2997363004WikidataQ126411960 ScholiaQ126411960MaRDI QIDQ2307500
Nirmalya Kumar Mohanty, Rupaj Kumar Nayak
Publication date: 24 March 2020
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-019-00517-8
augmented Lagrangian methodimage deconvolutioncontinuous relaxationbinary quadratic programming problemmax-cut problemsQKP
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions
- An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
- An algorithm for nonlinear optimization problems with binary variables
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- A global continuation algorithm for solving binary quadratic programming problems
- Semidefinite programming relaxation for nonconvex quadratic programs
- A penalized Fischer-Burmeister NCP-function
- A low complexity semidefinite relaxation for large-scale MIMO detection
- Improved row-by-row method for binary quadratic optimization problems
- A continuation approach for solving binary quadratic program based on a class of NCP-functions
- Using a Mixed Integer Programming Tool for Solving the 0–1 Quadratic Knapsack Problem
- New Optimization Algorithms for Structural Reliability Analysis
- Graph Implementations for Nonsmooth Convex Programs
- On clusterings
- An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- On the Quality of Spectral Separators
- Randomized heuristics for the Max-Cut problem
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- A Spectral Bundle Method for Semidefinite Programming
- Benchmarking optimization software with performance profiles.
