SnapVX: A Network-Based Convex Optimization Solver

SnapVX is a high-performance solver for convex optimization problems defined on networks. For problems of this form, SnapVX provides a fast and scalable solution with guaranteed global convergence. It combines the capabilities of two open source software packages: Snap.py and CVXPY. Snap.py is a large scale graph processing library, and CVXPY provides a general modeling framework for small-scale subproblems. SnapVX offers a customizable yet easy-to-use Python interface with out-of- the- box functionality. Based on the Alternating Direction Method of Multipliers (ADMM), it is able to efficiently store, analyze, parallelize, and solve large optimization problems from a variety of different applications. Documentation, examples, and more can be found on the SnapVX website at snap.stanford.edu/snapvx. [abs] [ pdf ][ bib ] [ code ] [ stanford.edu ] &copy JMLR 2017. ( edit, beta )

Authors

• David Hallac
• Christopher Wong
• Steven Diamond
• Abhijit Sharang
• Rok Sosič
• Stephen Boyd
• Jure Leskovec Stanford University, Department of Computer Science

Keywords

No keywords are indexed for this paper.