Algorithm 1055: HDSDP: Software for Semidefinite Programming

HDSDP is a numerical software solving semidefinite programming problems. The main framework of HDSDP resembles the dual-scaling interior point solver DSDP and several new features, including a dual method based on the simplified homogeneous self-dual embedding, have been implemented. The embedding technique enhances the stability of the dual method, and several new heuristics and computational techniques are designed to accelerate its convergence. HDSDP aims to show how the dual-scaling algorithm benefits from the self-dual embedding, and it is developed in parallel to DSDP 5.8. Numerical experiments over several classical benchmark datasets exhibit their robustness and efficiency, particularly their advantages on SDP instances featuring low-rank structure and sparsity. HDSDP is open sourced under an MIT license and available at https://github.com/Gwzwpxz/HDSDP .

Authors

Institutions

Publication Details

Journal
ACM Transactions on Mathematical Software
Published
2025-02-28
DOI
https://doi.org/10.1145/3721123
Citations
1
Primary Topic
Advanced Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
2.63
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Algorithm 1055: HDSDP: Software for Semidefinite Programming

Dongdong Ge, Yinyu Ye, Wenzhi Gao
1 citations
ACM Transactions on Mathematical Software
Advanced Optimization Algorithms Research
2.63
article

Algorithm 1055: HDSDP: Software for Semidefinite Programming

Dongdong Ge, Yinyu Ye, Wenzhi Gao
article en
1 citations

Abstract

HDSDP is a numerical software solving semidefinite programming problems. The main framework of HDSDP resembles the dual-scaling interior point solver DSDP and several new features, including a dual method based on the simplified homogeneous self-dual embedding, have been implemented. The embedding technique enhances the stability of the dual method, and several new heuristics and computational techniques are designed to accelerate its convergence. HDSDP aims to show how the dual-scaling algorithm benefits from the self-dual embedding, and it is developed in parallel to DSDP 5.8. Numerical experiments over several classical benchmark datasets exhibit their robustness and efficiency, particularly their advantages on SDP instances featuring low-rank structure and sparsity. HDSDP is open sourced under an MIT license and available at https://github.com/Gwzwpxz/HDSDP .

ACM Transactions on Mathematical SoftwareVol. 51(2)
Shanghai Jiao Tong University (CN), Stanford University (US)
Openalex Percentile: Top 17%
Advanced Optimization Algorithms Research
2.63
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.