Ask a Question

Prefer a chat interface with context about you and your work?

Efficient Semidefinite Programming with Approximate ADMM

Efficient Semidefinite Programming with Approximate ADMM

Abstract Tenfold improvements in computation speed can be brought to the alternating direction method of multipliers (ADMM) for Semidefinite Programming with virtually no decrease in robustness and provable convergence simply by projecting approximately to the Semidefinite cone. Instead of computing the projections via “exact” eigendecompositions that scale cubically with the …