Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for Feasibility Problems

10 April 2024

Papers citing "Gradient Descent is Pareto-Optimal in the Oracle Complexity and Memory Tradeoff for Feasibility Problems"

1 / 1 papers shown

Title
Efficient Convex Optimization Requires Superlinear Memory A. Marsden Vatsal Sharan Aaron Sidford Gregory Valiant 29 14 0 29 Mar 2022