HDSDP: Software for Semidefinite Programming
Not on the map. Why?
Abstract (arXiv)
HDSDP is a numerical software solving the semidefinite programming problems. The main framework of HDSDP resembles the dual-scaling interior point solver DSDP [BY2008] and several new features, including a dual method based on the simplified homogeneous self-dual embedding, have been implemented. The embedding technique enhances stability of the dual method and several new heuristics and computational techniques are designed to accelerate its convergence. HDSDP aims to show how dual-scaling algorithm benefits from the self-dual embedding and it is developed in parallel to DSDP5.8. Numerical experiments over several classical benchmark datasets exhibit its robustness and efficiency, and particularly its advantages on SDP instances featuring low-rank structure and sparsity. HDSDP is open-sourced under MIT license and available at https://github.com/COPT-Public/HDSDP.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). First posted on arXiv 28 Jul 2022.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2022: 1; 2023: 1.
2 papers.
- 2022Optimal Diagonal Preconditioningcited by 7
- 2023On Sinkhorn's Algorithm and Choice Modelingcited by 6
- 2023On Sinkhorn's Algorithm and Choice Modeling30 Sep 2023
- 2022Optimal Diagonal Preconditioning2 Sep 2022