An entropy-regularized ADMM for binary quadratic programming
From MaRDI portal
Publication:6085714
DOI10.1007/s10898-022-01144-0OpenAlexW4212797225MaRDI QIDQ6085714
ZaiWen Wen, Kangkang Deng, Haoyang Liu, Haoming Liu
Publication date: 8 November 2023
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-022-01144-0
Riemannian manifoldalternating direction method of multipliersbinary quadratic programminglow-rank factorizationentropy penalty
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A feasible method for optimization with orthogonality constraints
- Cheeger's cut, maxcut and the spectral theory of 1-Laplacian on graphs
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Factoring polynomials with rational coefficients
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Quadratic maximization and semidefinite relaxation
- Possible generalization of Boltzmann-Gibbs statistics.
- Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- A projected gradient algorithm for solving the maxcut SDP relaxation
- Adaptive Memory Tabu Search for Binary Quadratic Programs
- Low-Rank Matrix Completion by Riemannian Optimization
- BiqCrunch
- Adaptive Quadratically Regularized Newton Method for Riemannian Optimization
- On maximum-likelihood detection and the search for the closest lattice point
- A unified framework for tree search decoding: rediscovering the sequential decoder
- A Near-Maximum-Likelihood Decoding Algorithm for MIMO Systems Based on Semi-Definite Programming
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- MIMO Detection by Lagrangian Dual Maximum-Likelihood Relaxation: Reinterpreting Regularized Lattice Decoding
- Performance Analysis of the Gaussian Quasi-Maximum Likelihood Approach for Independent Vector Analysis
- Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection
- SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
- An Efficient Quadratic Programming Relaxation Based Algorithm for Large-Scale MIMO Detection
- Deterministic Guarantees for Burer‐Monteiro Factorizations of Smooth Semidefinite Programs
- An Extrinsic Look at the Riemannian Hessian
- Semismooth Matrix-Valued Functions
