ADMM_QAP

MaRDI QIDQ43467swMATHFDO

Official website https://xu-yangyang.github.io/ADMM_QAP/

Described by source

• ADMM for the SDP relaxation of the QAP

Cited in

(17)

• Lower bounds for the bandwidth problem
• SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning
• Semidefinite programming approach for the quadratic assignment problem with a sparse graph
• On solving the quadratic shortest path problem
• A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem
• Max-norm optimization for robust matrix recovery
• SNLSDP
• SDPNAL+
• SAcb
• TScb
• Rudy
• Sieve-SDP
• just-continuity
• rare
• A strengthened Barvinok-Pataki bound on SDP rank
• Applications of gauge duality in robust principal component analysis and semidefinite programming
• BioMagResBank

This page was built for software: ADMM_QAP