Get started
Keyword

iteration complexity

Description: The number of algorithm iterations required to achieve a solution or accuracy target, analyzed in optimization and numerical methods.
OpenAlex ID: keywords/iteration-complexity
Smooth minimization of non-smooth functions
2004 · Yu. Nesterov · Mathematical Programming · 2,474
Pegasos: primal estimated sub-gradient solver for SVM
2010 · Shai Shalev-Shwartz, Yoram Singer, et al. · Mathematical Programming · 1,499
Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function
2012 · Peter Richtárik, Martin Takáč · Mathematical Programming · 655
PDF
Interior path following primal-dual algorithms. part I: Linear programming
1989 · Renato D. C. Monteiro, Ilan Adler · Mathematical Programming · 486
An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
1994 · Yinyu Ye, Michael J. Todd, et al. · Mathematics of Operations Research · 354
Interior path following primal-dual algorithms. part II: Convex quadratic programming
1989 · Renato D. C. Monteiro, Ilan Adler · Mathematical Programming · 333
Primal--Dual Path-Following Algorithms for Semidefinite Programming
1997 · Renato D. C. Monteiro · SIAM Journal on Optimization · 303
On non-ergodic convergence rate of Douglas–Rachford alternating direction method of multipliers
2014 · Bingsheng He, Xiaoming Yuan · Numerische Mathematik · 294
An O(n 3 L) potential reduction algorithm for linear programming
1991 · Yinyu Ye · Mathematical Programming · 289
An Accelerated Dual Gradient-Projection Algorithm for Embedded Linear Model Predictive Control
2013 · Panagiotis Patrinos, Alberto Bemporad · IEEE Transactions on Automatic Control · 288
Path Finding Methods for Linear Programming: Solving Linear Programs in Õ(vrank) Iterations and Faster Algorithms for Maximum Flow
2014 · Yin Tat Lee, Aaron Sidford · Annual Symposium on Foundations of Computer Science · 223
On the Complexity of Steepest Descent, Newton's and Regularized Newton's Methods for Nonconvex Unconstrained Optimization Problems
2010 · C. Cartis, N. I. M. Gould, et al. · SIAM Journal on Optimization · 207
On the complexity analysis of randomized block-coordinate descent methods
2014 · Zhaosong Lu, Lin Xiao · Mathematical Programming · 204
PDF
A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
1990 · Renato D. C. Monteiro, Ilan Adler, et al. · Mathematics of Operations Research · 199
Iteration-Complexity of Block-Decomposition Algorithms and the Alternating Direction Method of Multipliers
2013 · Renato D. C. Monteiro, Benar F. Svaiter · SIAM Journal on Optimization · 188
Accelerating the cubic regularization of Newton’s method on convex problems
2007 · Yu. Nesterov · Mathematical Programming · 174
An $$O(\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problems
1991 · Masakazu Kojima, Shinji Mizuno, et al. · Mathematical Programming · 173
Bregman Alternating Direction Method of Multipliers
2013 · Wang, Huahua, Banerjee, Arindam · arXiv (Cornell University) · 171
PDF
Stochastic Quasi-Newton Methods for Nonconvex Stochastic Optimization
2017 · Xiao Wang, Shiqian Ma, et al. · SIAM Journal on Optimization · 169
Iteration complexity analysis of block coordinate descent methods
2016 · Mingyi Hong, Xiangfeng Wang, et al. · Mathematical Programming · 163
PDF
Optimal computational and statistical rates of convergence for sparse nonconvex learning problems
2014 · Zhaoran Wang, Han Liu, et al. · The Annals of Statistics · 159
PDF
On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean
2010 · Renato D. C. Monteiro, B. F. Svaiter · SIAM Journal on Optimization · 159
An O(n 3 L) primal interior point algorithm for convex quadratic programming
1990 · D. Goldfarb, S. Liu · Mathematical Programming · 159
Block-Coordinate Frank-Wolfe Optimization for Structural SVMs
2012 · Lacoste-Julien, Simon, Jaggi, Martin, et al. · arXiv (Cornell University) · 158
PDF
Newton-type methods for non-convex optimization under inexact Hessian information
2019 · Peng Xu, Fred Roosta, et al. · Mathematical Programming · 157
PDF
Works count: 1,941
Citation count: 28,200
Year
Topic
Type