DeepAI AI Chat
Log In Sign Up

HDSDP: Software for Semidefinite Programming

by   Wenzhi Gao, et al.
Stanford University

HDSDP is a numerical software solving the semidefinite programming problems. The main framework of HDSDP resembles the dual-scaling interior point solver DSDP[2] and several new features, especially a dual method based on the simplified homogeneous self-dual embedding, have been implemented. The embedding enhances stability of dual method and several new heuristics and computational techniques are designed to accelerate its convergence. HDSDP aims to show how dual-scaling algorithms benefit 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. The pre-built binary of HDSDP is currently freely available at


page 1

page 2

page 3

page 4


A Simplified Treatment of Ramana's Exact Dual for Semidefinite Programming

In semidefinite programming the dual may fail to attain its optimal valu...

Barrier and penalty methods for low-rank semidefinite programming with application to truss topology design

The aim of this paper is to solve large-and-sparse linear Semidefinite P...

A relaxed interior point method for low-rank semidefinite programming problems

A new relaxed variant of interior point method for low-rank semidefinite...

Linear optimization over homogeneous matrix cones

A convex cone is homogeneous if its automorphism group acts transitively...

Low-rank semidefinite programming for the MAX2SAT problem

This paper proposes a new algorithm for solving MAX2SAT problems based o...

Graph Coloring and Semidefinite Rank

This paper considers the interplay between semidefinite programming, mat...

Fast randomized entropically regularized semidefinite programming

We develop a practical approach to semidefinite programming (SDP) that i...