Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and \(=(1/\varepsilon)\)-convergence (Q2414908): Difference between revisions

Latest revision as of 07:07, 19 July 2024

scientific article

Language	Label	Description	Also known as
English	Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and \(=(1/\varepsilon)\)-convergence	scientific article

Statements

instance of

scholarly article

0 references

title

Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and \(=(1/\varepsilon)\)-convergence (English)

@@ Property / author @@
-Zeyuan Allen Zhu
@@ Property / author: Zeyuan Allen Zhu / rank @@
-Normal rank
@@ Property / author @@
+Zeyuan Allen Zhu
@@ Property / author: Zeyuan Allen Zhu / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10107-018-1244-x
+Normal rank
@@ Property / OpenAlex ID @@
+W2963555392
@@ Property / OpenAlex ID: W2963555392 / rank @@
+Normal rank
@@ Property / cites work @@
+Using Optimization to Obtain a Width-Independent, Parallel, Simpler, and Faster Positive SDP Solver
+Normal rank
@@ Property / cites work @@
+Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates
+Normal rank
@@ Property / cites work @@
+Using Optimization to Break the Epsilon Barrier: A Faster and Simpler Width-Independent Algorithm for Solving Positive Linear Programs in Parallel
+Normal rank
@@ Property / cites work @@
+Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent
+Normal rank
@@ Property / cites work @@
+Q2913806
@@ Property / cites work: Q2913806 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5302094
@@ Property / cites work: Q5302094 / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed algorithms for multicommodity flow problems via approximate steepest descent framework
+Normal rank
@@ Property / cites work @@
+Fast, Distributed Approximation Algorithms for Positive Linear Programming with Applications to Flow Control
+Normal rank
@@ Property / cites work @@
+Improved Approximation Schemes for Linear Programming Relaxations of Combinatorial Optimization Problems
+Normal rank
@@ Property / cites work @@
+Linear-Time Approximation for Maximum Weight Matching
+Normal rank
@@ Property / cites work @@
+Accelerated, Parallel, and Proximal Coordinate Descent
+Normal rank
@@ Property / cites work @@
+Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
+Normal rank
@@ Property / cites work @@
+Faster and Simpler Algorithms for Multicommodity Flow and Other Fractional Packing Problems
+Normal rank
@@ Property / cites work @@
+Fast Approximation Schemes for Convex Programs with Many Blocks and Coupling Constraints
+Normal rank
@@ Property / cites work @@
+QIP = PSPACE
@@ Property / cites work: QIP = PSPACE / rank @@
+Normal rank
@@ Property / cites work @@
+On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms
+Normal rank
@@ Property / cites work @@
+A nearly linear-time PTAS for explicit fractional packing and covering linear programs
+Normal rank
@@ Property / cites work @@
+A parallel approximation algorithm for positive linear programming
+Normal rank
@@ Property / cites work @@
+Faster approximation schemes for fractional multicommodity flow problems via dynamic graph algorithms
+Normal rank
@@ Property / cites work @@
+Prox-Method with Rate of Convergence <i>O</i>(1/<i>t</i>) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
+Normal rank
@@ Property / cites work @@
+Rounding of convex sets and efficient gradient methods for linear programming problems
+Normal rank
@@ Property / cites work @@
+Q3320132
@@ Property / cites work: Q3320132 / rank @@
+Normal rank
@@ Property / cites work @@
+Smooth minimization of non-smooth functions
@@ Property / cites work: Smooth minimization of non-smooth functions / rank @@
+Normal rank
@@ Property / cites work @@
+Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for Fractional Packing and Covering Problems
+Normal rank
@@ Property / cites work @@
+Parallel approximation algorithms by positive linear programming
+Normal rank
@@ Property / cites work @@
+Q4598189
@@ Property / cites work: Q4598189 / rank @@
+Normal rank

Nearly linear-time packing and covering LP solvers. Nearly linear-time packing and covering LP solvers, achieving width-independence and \(=(1/\varepsilon)\)-convergence (Q2414908): Difference between revisions

Latest revision as of 07:07, 19 July 2024

Statements

Identifiers

Sitelinks

Mathematics(1 entry)