Solving Packing and Covering LPs in $\tilde{O}(\frac{1}{\epsilon^2})$ Distributed Iterations with a Single Algorithm and Simpler Analysis

نویسندگان

  • Jelena Diakonikolas
  • Lorenzo Orecchia
چکیده

Packing and covering linear programs belong to the narrow class of linear programs that are efficiently solvable in parallel and distributed models of computation, yet are a powerful modeling tool for a wide range of fundamental problems in theoretical computer science, operations research, and many other areas. Following recent progress in obtaining faster distributed and parallel algorithms for packing and covering linear programs, we present a simple algorithm whose iteration count matches the best known Õ( 1 ǫ 2 ) for this class of problems. The algorithm is similar to the algorithm of Allen-Zhu and Orecchia [2], it can be interpreted as Nesterov’s dual averaging, and it constructs approximate solutions to both primal (packing) and dual (covering) problems. However, the analysis relies on the construction of an approximate optimality gap and a primal-dual view, leading to a more intuitive interpretation. Moreover, our analysis suggests that all existing algorithms for solving packing and covering linear programs in parallel/distributed models of computation are, in fact, unaccelerated, and raises the question of designing accelerated algorithms for this class of problems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

2 4 O ct 2 01 7 Solving Packing and Covering LPs in Õ ( 1 ǫ 2 ) Distributed Iterations with a Single Algorithm and Simpler Analysis

Packing and covering linear programs belong to the narrow class of linear programs that are efficiently solvable in parallel and distributed models of computation, yet are a powerful modeling tool for a wide range of fundamental problems in theoretical computer science, operations research, and many other areas. Following recent progress in obtaining faster distributed and parallel algorithms f...

متن کامل

Approximating the Solution to Mixed Packing and Covering LPs in parallel Õ( −3) time

We study the problem of approximately solving positive linear programs (LPs). This class of LPs models a wide range of fundamental problems in combinatorial optimization and operations research, such as many resource allocation problems, solving non-negative linear systems, computing tomography, single/multi commodity flows on graphs, etc. For the special cases of pure packing or pure covering ...

متن کامل

Accelerated Gradient Descent Escapes Saddle Points Faster than Gradient Descent

Nesterov's accelerated gradient descent (AGD), an instance of the general family of"momentum methods", provably achieves faster convergence rate than gradient descent (GD) in the convex setting. However, whether these methods are superior to GD in the nonconvex setting remains open. This paper studies a simple variant of AGD, and shows that it escapes saddle points and finds a second-order stat...

متن کامل

Using Optimization to Obtain a Width-Independent, Parallel, Simpler, and Faster Positive SDP Solver

We study the design of polylogarithmic depth algorithms for approximately solving packing and covering semidefinite programs (or positive SDPs for short). This is a natural SDP generalization of the well-studied positive LP problem. Although positive LPs can be solved in polylogarithmic depth while using only Õ(log n/ε) parallelizable iterations [4, 33], the best known positive SDP solvers due ...

متن کامل

Faster and simpler approximation algorithms for mixed packing and covering problems

We propose an algorithm for approximately solving the mixed packing and covering problem; given a convex compact set ∅ = B ⊆ RN , either compute x ∈ B such that f (x) ≤ (1 + )a and g(x) ≥ (1 − )b or decide that {x ∈ B | f (x) ≤ a, g(x) ≥ b} = ∅. Here f, g : B → RM + are vectors whose components are M non-negative convex and concave functions, respectively, and a, b ∈ RM ++ are constant positive...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017