ADMM_QAP
From MaRDI portal
Software:43467
No author found.
Related Items (8)
Applications of gauge duality in robust principal component analysis and semidefinite programming ⋮ SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning ⋮ Lower bounds for the bandwidth problem ⋮ A strengthened Barvinok-Pataki bound on SDP rank ⋮ Semidefinite programming approach for the quadratic assignment problem with a sparse graph ⋮ Max-norm optimization for robust matrix recovery ⋮ A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem ⋮ On Solving the Quadratic Shortest Path Problem
This page was built for software: ADMM_QAP
