iteration complexity

On Faster Convergence of Cyclic Block Coordinate Descent-type Methods for Strongly Convex Minimization JMLR 2018 RSG: Beating Subgradient Method without Smoothness and Strong Convexity JMLR 2018 SADAGRAD: Strongly Adaptive Stochastic Gradient Methods ICML 2018 Solving Non-smooth Constrained Programs with Lower Complexity than O(1/ε): A Primal-Dual Homotopy Smoothing Approach NeurIPS 2018 Stochastic Primal-Dual Method for Empirical Risk Minimization with O(1) Per-Iteration Complexity NeurIPS 2018 ADMM without a Fixed Penalty Parameter: Faster Convergence with New Adaptive Penalization NeurIPS 2017 A Richer Theory of Convex Constrained Optimization with Reduced Projections and Improved Rates ICML 2017 Doubly Greedy Primal-Dual Coordinate Descent for Sparse Empirical Risk Minimization ICML 2017 Ignoring Is a Bliss: Learning with Large Noise Through Reweighting-Minimization COLT 2017 Less than a Single Pass: Stochastically Controlled Stochastic Gradient AISTATS 2017 On the Iteration Complexity of Support Recovery via Hard Thresholding Pursuit ICML 2017 Stochastic Convex Optimization: Faster Local Growth Implies Faster Global Convergence ICML 2017 An Improved Convergence Analysis of Cyclic Block Coordinate Descent-type Methods for Strongly Convex Minimization AISTATS 2016 Dimension-Free Iteration Complexity of Finite Sum Optimization Problems NeurIPS 2016 On the Iteration Complexity of Oblivious First-Order Optimization Algorithms ICML 2016 Improved Iteration Complexity Bounds of Cyclic Block Coordinate Descent for Convex Problems NeurIPS 2015 Approximate Policy Iteration Schemes: A Comparison ICML 2014 Bregman Alternating Direction Method of Multipliers NeurIPS 2014 Iteration Complexity of Feasible Descent Methods for Convex Optimization JMLR 2014 Parallel Direction Method of Multipliers NeurIPS 2014 Improved and Generalized Upper Bounds on the Complexity of Policy Iteration NeurIPS 2013