The following pages link to ADMM_QAP (Q43467):
Displaying 9 items.
- (Q47461) (redirect page) (← links)
- Applications of gauge duality in robust principal component analysis and semidefinite programming (Q341322) (← links)
- Max-norm optimization for robust matrix recovery (Q681486) (← links)
- Semidefinite programming approach for the quadratic assignment problem with a sparse graph (Q1744907) (← links)
- A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem (Q2028477) (← links)
- Lower bounds for the bandwidth problem (Q2669517) (← links)
- A strengthened Barvinok-Pataki bound on SDP rank (Q2670438) (← links)
- On Solving the Quadratic Shortest Path Problem (Q3386757) (← links)
- SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning (Q5084594) (← links)
