pith. sign in

arxiv: 1509.06397 · v2 · pith:NAHQTXQDnew · submitted 2015-09-21 · 💻 cs.SI · cs.MS· math.OC

SnapVX: A Network-Based Convex Optimization Solver

classification 💻 cs.SI cs.MSmath.OC
keywords snapvxoptimizationproblemssnapconvexcvxpylargeprovides
0
0 comments X
read the original abstract

SnapVX is a high-performance Python solver for convex optimization problems defined on networks. For these problems, it provides a fast and scalable solution with guaranteed global convergence. SnapVX 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 interface with out-of-the-box functionality. Based on the Alternating Direction Method of Multipliers (ADMM), it is able to efficiently store, analyze, and solve large optimization problems from a variety of different applications. Documentation, examples, and more can be found on the SnapVX website at http://snap.stanford.edu/snapvx.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.