scientific article; zbMATH DE number 6820239
From MaRDI portal
Publication:4598189
DOI10.4230/LIPIcs.ICALP.2016.50zbMath1388.90130arXiv1508.02439MaRDI QIDQ4598189
Di Wang, Satish B. Rao, Michael W. Mahoney
Publication date: 19 December 2017
Full work available at URL: https://arxiv.org/abs/1508.02439
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
convex optimizationapproximation algorithmlinear programpacking and coveringaccelerated gradient descent
Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Combinatorial optimization (90C27)
Related Items (8)
Partial Resampling to Approximate Covering Integer Programs ⋮ A multiplicative weight updates algorithm for packing and covering semi-infinite linear programs ⋮ Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and \(=(1/\varepsilon)\)-convergence ⋮ Multiplicative auction algorithm for approximate maximum weight bipartite matching ⋮ A Multiplicative Weights Update Algorithm for Packing and Covering Semi-infinite Linear Programs ⋮ Fractional Set Cover in the Streaming Model. ⋮ Towards more practical linear programming-based techniques for algorithmic mechanism design ⋮ Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent
This page was built for publication:
