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

The research presented here is an improved row-by-row (RBR) algorithm for the solution of boolean quadratic programming (BQP) problems. While a faster and implementable RBR method has been widely used for semidefinite programming (SDP) relaxed BQPs, it can be challenged by SDP relaxations because of...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Annals of operations research Jg. 275; H. 2; S. 587 - 605
Hauptverfasser: Nayak, Rupaj Kumar, Mohanty, Nirmalya Kumar
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer US 01.04.2019
Springer
Springer Nature B.V
Schlagworte:
Acoustics
Algorithms
Boolean algebra
Business and Management
Combinatorics
Lower bounds
Management science
Operations research
Operations Research/Decision Theory
Optimization
Optimization theory
Original Research
Quadratic programming
Semidefinite programming
Signal processing
Studies
Theory of Computation
Computer vision
Semidefinite programming
First order method
Row-by-row method
Unconstrained quadratic binary optimization
ISSN:0254-5330, 1572-9338
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The research presented here is an improved row-by-row (RBR) algorithm for the solution of boolean quadratic programming (BQP) problems. While a faster and implementable RBR method has been widely used for semidefinite programming (SDP) relaxed BQPs, it can be challenged by SDP relaxations because of the fact that it produce a tighter lower bounds than RBR on BQPs. On the other hand, solving SDP by interior point method (IPM) is computationally expensive for large scale problems. Departing from IPM, our methods provides better lower bound than the RBR algorithm by Wai et al. (IEEE international conference on acoustics, speech and signal processing ICASSP, 2011 ) and competitive with SDP solved by IPM. The method includes the SDP cut relaxation on the SDP and is solved by a modified RBR method. The algorithm has been tested on MATLAB platform and applied to several BQPs from BQPLIB (a library by the authors). Numerical experiments show that the proposed method outperform the previous RBR method proposed by several authors and the solution of BQP by IPM as well.
Bibliographie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0254-5330
1572-9338
DOI:10.1007/s10479-018-2978-9