Pages that link to "Item:Q2941511"

The following pages link to Nearly-Linear Time Positive LP Solver with Faster Convergence Rate (Q2941511):

Displaying 9 items.

• Towards more practical linear programming-based techniques for algorithmic mechanism design (Q506527) (← links)
• Worst-case complexity of cyclic coordinate descent: \(O(n^2)\) gap with randomized version (Q2220668) (← links)
• A multiplicative weight updates algorithm for packing and covering semi-infinite linear programs (Q2414864) (← links)
• Optimization in High Dimensions via Accelerated, Parallel, and Proximal Coordinate Descent (Q2832112) (← links)
• On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms (Q2944569) (← links)
• A Multiplicative Weights Update Algorithm for Packing and Covering Semi-infinite Linear Programs (Q2971158) (← links)
• (Q4558559) (← links)
• Linear Coupling: An Ultimate Unification of Gradient and Mirror Descent (Q4638051) (← links)
• Fractional Set Cover in the Streaming Model. (Q5002615) (← links)