ADMM_QAP

swMATH31756MaRDI QIDQ43467FDOQ43467

Author name not available (Why is that?)

Described by source

• ADMM for the SDP relaxation of the QAP

Cited In (8)

• SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning
• Lower bounds for the bandwidth problem
• Semidefinite programming approach for the quadratic assignment problem with a sparse graph
• A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem
• Max-norm optimization for robust matrix recovery
• On Solving the Quadratic Shortest Path Problem
• A strengthened Barvinok-Pataki bound on SDP rank
• Applications of gauge duality in robust principal component analysis and semidefinite programming

This page was built for software: ADMM_QAP