Improved row-by-row method for binary quadratic optimization problems

DOI10.1007/s10479-018-2978-9zbMath1428.90112OpenAlexW2883466249MaRDI QIDQ2327692

Rupaj Kumar Nayak, Nirmalya Kumar Mohanty

Publication date: 15 October 2019

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-018-2978-9

zbMATH Keywords

semidefinite programmingcomputer visionfirst-order methodrow-by-row methodunconstrained quadratic binary optimization

Mathematics Subject Classification ID

Quadratic programming (90C20) Boolean programming (90C09)

Related Items (2)

Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation ⋮ Bqplib

Uses Software

• Matlab
• SeDuMi
• SDPT3
• CVX
• SDPLR

Cites Work

• Unnamed Item
• A feasible method for optimization with orthogonality constraints
• Solving semidefinite-quadratic-linear programs using SDPT3
• Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
• An unconstrained quadratic binary programming approach to the vertex coloring problem
• The spherical constraint in Boolean quadratic programs
• A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
• A low complexity semidefinite relaxation for large-scale MIMO detection
• The Schur complement and its applications
• On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
• Graph Implementations for Nonsmooth Convex Programs
• On clusterings
• On the Quality of Spectral Separators
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
• On search directions for minimization algorithms

This page was built for publication: Improved row-by-row method for binary quadratic optimization problems