A scalable system for primal-dual optimization
Abstract
We present some of the most widely used architectures for Big Data, Hadoop and Spark, and develop several implementations exploiting, the advantages of each. We implement a simplified version of the primal-dual optimization algorithm, described briefly in this paper, by choosing the smoothing functions to be · 2 with a zero center point. Under the assumption that data is provided as a sparse matrix, we assess the scalability of the designed systems empirically by running them on sample tests.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.