An entropy-regularized ADMM for binary quadratic programming
From MaRDI portal
Recommendations
- A rank-two feasible direction algorithm for the binary quadratic programming
- An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions
- A SUCCESSIVE QUADRATIC PROGRAMMING ALGORITHM FOR SDP RELAXATION OF THE BINARY QUADRATIC PROGRAMMING
- A successive linear programming algorithm for SDP relaxation of binary quadratic programming
- Alternating direction method for bi-quadratic programming
Cites work
- scientific article; zbMATH DE number 3173999 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 5223994 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A Near-Maximum-Likelihood Decoding Algorithm for MIMO Systems Based on Semi-Definite Programming
- A feasible method for optimization with orthogonality constraints
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- A projected gradient algorithm for solving the maxcut SDP relaxation
- A unified framework for tree search decoding: rediscovering the sequential decoder
- Adaptive memory tabu search for binary quadratic programs
- Adaptive quadratically regularized Newton method for Riemannian optimization
- An Extrinsic Look at the Riemannian Hessian
- An efficient quadratic programming relaxation based algorithm for large-scale MIMO detection
- BiqCrunch: a semidefinite branch-and-bound method for solving binary quadratic problems
- Cheeger's cut, maxcut and the spectral theory of 1-Laplacian on graphs
- Deterministic guarantees for Burer-Monteiro factorizations of smooth semidefinite programs
- Factoring polynomials with rational coefficients
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- Low-rank matrix completion by Riemannian optimization
- MIMO Detection by Lagrangian Dual Maximum-Likelihood Relaxation: Reinterpreting Regularized Lattice Decoding
- On maximum-likelihood detection and the search for the closest lattice point
- Optimality conditions for the nonlinear programming problems on Riemannian manifolds
- Performance Analysis of the Gaussian Quasi-Maximum Likelihood Approach for Independent Vector Analysis
- Possible generalization of Boltzmann-Gibbs statistics.
- Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis
- Probabilistic analysis of the semidefinite relaxation detector in digital communications
- Quadratic maximization and semidefinite relaxation
- SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0)
- Semismooth Matrix-Valued Functions
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Tightness of a New and Enhanced Semidefinite Relaxation for MIMO Detection
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
Cited in
(2)
This page was built for publication: An entropy-regularized ADMM for binary quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6085714)
