一个可扩展的原-对偶优化系统
A scalable system for primal-dual optimization
摘要:
我们提出了一些最广泛使用的大数据架构,\textit{Hadoop}和\textit{Spark},并开发了几个实现利用,每个的优点。我们实现了一个简化版本的原始-对偶优化算法,本文简要介绍,通过选择平滑函数是$\Vert \cdot \Vert^2$与零中心点。假设数据是作为一个稀疏矩阵提供的,我们评估的可扩展性的设计系统的经验,通过运行它们的样本测试。
英文摘要:
We present some of the most widely used architectures for Big Data, \textit{Hadoop} and \textit{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 $\Vert \cdot \Vert^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.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。