Faster Primal-Dual Convergence for Min-Max Resource Sharing and Stronger Bounds via Local Weak Duality

11/12/2021
by   Daniel Blankenburg, et al.
0

We revisit the (block-angular) min-max resource sharing problem, which is a well-known generalization of fractional packing and the maximum concurrent flow problem. It consists of finding an ℓ_∞-minimal element in a Minkowski sum 𝒳= ∑_C ∈𝒞 X_C of non-empty closed convex sets X_C ⊆ℝ^ℛ_≥ 0, where 𝒞 and ℛ are finite sets. We assume that an oracle for approximate linear minimization over X_C is given. In this setting, the currently fastest known FPTAS is due to Müller, Radke, and Vygen. For δ∈ (0,1], it computes a σ(1+δ)-approximately optimal solution using 𝒪((|𝒞|+|ℛ|)log |ℛ| (δ^-2 + loglog |ℛ|)) oracle calls, where σ is the approximation ratio of the oracle. We describe an extension of their algorithm and improve on previous results in various ways. Our FPTAS, which, as previous approaches, is based on the multiplicative weight update method, computes close to optimal primal and dual solutions using 𝒪(|𝒞|+ |ℛ|/δ^2log |ℛ|) oracle calls. We prove that our running time is optimal under certain assumptions, implying that no warm-start analysis of the algorithm is possible. A major novelty of our analysis is the concept of local weak duality, which illustrates that the algorithm optimizes (close to) independent parts of the instance separately. Interestingly, this implies that the computed solution is not only approximately ℓ_∞-minimal, but among such solutions, also its second-highest entry is approximately minimal. We prove that this statement cannot be extended to the third-highest entry.

READ FULL TEXT
research
11/17/2020

Simple Iterative Methods for Linear Optimization over Convex Sets

We give simple iterative methods for computing approximately optimal pri...
research
09/25/2019

A New Deterministic Algorithm for Dynamic Set Cover

We present a deterministic dynamic algorithm for maintaining a (1+ϵ)f-ap...
research
11/25/2017

Constraint Coupled Distributed Optimization: a Relaxation and Duality Approach

In this paper we consider a distributed optimization scenario in which a...
research
06/30/2023

A simpler and parallelizable O(√(log n))-approximation algorithm for Sparsest Cut

Currently, the best known tradeoff between approximation ratio and compl...
research
07/03/2020

Minimizing Convex Functions with Integral Minimizers

Given a separation oracle 𝖲𝖮 for a convex function f that has an integra...
research
01/15/2023

Max-min Learning of Approximate Weight Matrices from Fuzzy Data

In this article, we study the approximate solutions set Λ_b of an incons...
research
07/08/2023

Explicit a posteriori error representation for variational problems and application to TV-minimization

In this paper, we propose a general approach for explicit a posteriori e...

Please sign up or login with your details

Forgot password? Click here to reset