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

DOI10.1007/S10479-018-2978-9MaRDI QIDQ2327692zbMATH OpenOpenAlexFDO

Authors 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

computer visionfirst-order methodrow-by-row methodsemidefinite programmingunconstrained quadratic binary optimization

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 751235
• An improved interior-point cutting-plane method for binary quadratic optimization
• An improved lower bound and approximation algorithm for binary constrained quadratic programming problem
• Publication:4203723
• Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
• Lower bound improvement and forcing rule for quadratic binary programming
• A rank-two feasible direction algorithm for the binary quadratic programming
• An improved algorithm for combinatorial multi-parametric quadratic programming

Cites work

• A feasible method for optimization with orthogonality constraints
• A low complexity semidefinite relaxation for large-scale MIMO detection
• A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
• An unconstrained quadratic binary programming approach to the vertex coloring problem
• Graph implementations for nonsmooth convex programs
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• On clusterings: good, bad and spectral
• On search directions for minimization algorithms
• On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
• On the Quality of Spectral Separators
• Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
• SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
• Solving semidefinite-quadratic-linear programs using SDPT3
• The Schur complement and its applications
• The spherical constraint in Boolean quadratic programs
• Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones

Cited in

(2)

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

Describes a project that uses

Uses Software

• SDPLR
• Matlab
• SeDuMi
• SDPT3
• CVX

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2327692)