arXiv:1502.06784 Abstract | arXiv Analytics

arXiv:1502.06784 [math.OC]Abstract References Reviews Resources

Asynchronous Algorithms for Linear Programs

Published 2015-02-24Version 1

In this paper we design and analyze algorithms for asynchronously solving linear programs using nonlinear signal processing structures. In particular, we discuss a general procedure for generating these structures such that a fixed-point of the structure is within a change of basis the minimizer of an associated linear program. We discuss methods for organizing the computation into distributed implementations and provide a treatment of convergence. The presented algorithms are accompanied by numerical simulations of the Chebyshev center and basis pursuit problems.

Categories: math.OC

Keywords: asynchronous algorithms, basis pursuit problems, nonlinear signal processing structures, chebyshev center, asynchronously solving linear programs

Related articles: Most relevant | Search more

arXiv:1708.05136 [math.OC] (Published 2017-08-17)

More Iterations per Second, Same Quality -- Why Asynchronous Algorithms may Drastically Outperform Traditional Ones

Robert Hannah, Wotao Yin

arXiv:1003.3127 [math.OC] (Published 2010-03-16)

Chebyshev Sets, Klee Sets, and Chebyshev Centers with respect to Bregman Distances: Recent Results and Open Problems

Heinz H. Bauschke, Mason S. Macklem, Xianfu Wang

arXiv:2103.13560 [math.OC] (Published 2021-03-25)

Distributed and Asynchronous Algorithms for N-block Convex Optimization with Coupling Constraints

Run Chen, Andrew L. Liu