An Entropy-Regularized ADMM For Binary Quadratic Programming

We propose an entropy regularized splitting model using low-rank factorization for solving binary quadratic programming with linear inequality constraints. Different from the semidefinite programming relaxation model, our model preserves the rank-one constraint and aims to find high quality rank-one...

Full description

Saved in:
Bibliographic Details
Published in:Journal of global optimization Vol. 87; no. 2-4; pp. 447 - 479
Main Authors: Liu, Haoming, Deng, Kangkang, Liu, Haoyang, Wen, Zaiwen
Format: Journal Article
Language:English
Published: New York Springer US 01.11.2023
Springer
Subjects:
ISSN:0925-5001, 1573-2916
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Be the first to leave a comment!
You must be logged in first