Worst-case complexity of cyclic coordinate descent: $$O(n^2)$$ O ( n 2 )

[1]  Peter Richtárik,et al.  Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates , 2019, SIAM J. Optim..

[2]  Weizhu Chen,et al.  DSCOVR: Randomized Primal-Dual Block Coordinate Algorithms for Asynchronous Distributed Optimization , 2017, J. Mach. Learn. Res..

[3]  Ion Necoara,et al.  Randomized projection methods for convex feasibility problems: conditioning and convergence rates , 2018, 1801.04873.

[4]  Stephen J. Wright,et al.  Random permutations fix a worst case for cyclic coordinate descent , 2016, IMA Journal of Numerical Analysis.

[5]  Zhi-Quan Luo,et al.  Iteration complexity analysis of block coordinate descent methods , 2013, Mathematical Programming.

[6]  Zhi-Quan Luo,et al.  On the linear convergence of the alternating direction method of multipliers , 2012, Mathematical Programming.

[7]  Bingsheng He,et al.  The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent , 2014, Mathematical Programming.

[8]  Mingyi Hong,et al.  Improved Iteration Complexity Bounds of Cyclic Block Coordinate Descent for Convex Problems , 2015, NIPS.

[9]  Lin Xiao,et al.  An Accelerated Randomized Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization , 2015, SIAM J. Optim..

[10]  Zeyuan Allen Zhu,et al.  Nearly-Linear Time Positive LP Solver with Faster Convergence Rate , 2015, STOC.

[11]  Inderjit S. Dhillon,et al.  PASSCoDe: Parallel ASynchronous Stochastic dual Co-ordinate Descent , 2015, ICML.

[12]  Y. Ye,et al.  On the Expected Convergence of Randomly Permuted ADMM , 2015 .

[13]  Stephen J. Wright.  Coordinate descent algorithms , 2015, Mathematical Programming.

[14]  Amir Beck,et al.  On the Convergence of Alternating Minimization for Convex Programming with Applications to Iteratively Reweighted Least Squares and Decomposition Schemes , 2015, SIAM J. Optim..

[15]  Zhi-Quan Luo,et al.  Guaranteed Matrix Completion via Non-Convex Factorization , 2014, IEEE Transactions on Information Theory.

[16]  Yuchen Zhang,et al.  Stochastic Primal-Dual Coordinate Method for Regularized Empirical Risk Minimization , 2014, ICML.

[17]  Peter Richtárik,et al.  Accelerated, Parallel, and Proximal Coordinate Descent , 2013, SIAM J. Optim..

[18]  Stephen J. Wright,et al.  An asynchronous parallel stochastic coordinate descent algorithm , 2013, J. Mach. Learn. Res..

[19]  Lin Xiao,et al.  On the complexity analysis of randomized block-coordinate descent methods , 2013, Mathematical Programming.

[20]  Ion Necoara,et al.  Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization , 2013, Journal of Global Optimization.

[21]  Peter Richtárik,et al.  Randomized Dual Coordinate Ascent with Arbitrary Sampling , 2014, ArXiv.

[22]  Zhi-Quan Luo,et al.  Cross-Layer Provision of Future Cellular Networks: A WMMSE-based approach , 2014, IEEE Signal Processing Magazine.

[23]  Tianyi Lin,et al.  On the Convergence Rate of Multi-Block ADMM , 2014 .

[24]  Zhaosong Lu,et al.  An Accelerated Proximal Coordinate Gradient Method and its Application to Regularized Empirical Risk Minimization , 2014, 1407.1296.

[25]  Peter Richtárik,et al.  Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function , 2011, Mathematical Programming.

[26]  Shang-Hua Teng,et al.  Nearly-Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems , 2006, SIAM J. Matrix Anal. Appl..

[27]  Xiaoming Yuan,et al.  The direct extension of ADMM for three-block separable convex minimization models is convergent when one function is strongly convex , 2014 .

[28]  Amir Beck,et al.  On the Convergence of Block Coordinate Descent Type Methods , 2013, SIAM J. Optim..

[29]  Zhi-Quan Luo,et al.  Long-term transmit point association for coordinated multipoint transmission by stochastic optimization , 2013, 2013 IEEE 14th Workshop on Signal Processing Advances in Wireless Communications (SPAWC).

[30]  Yin Tat Lee,et al.  Efficient Accelerated Coordinate Descent Methods and Faster Algorithms for Solving Linear Systems , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

[31]  Christopher Ré,et al.  Parallel stochastic gradient algorithms for large-scale matrix completion , 2013, Math. Program. Comput..

[32]  Ambuj Tewari,et al.  On the Nonasymptotic Convergence of Cyclic Coordinate Descent Methods , 2013, SIAM J. Optim..

[33]  Zhi-Quan Luo,et al.  A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization , 2012, SIAM J. Optim..

[34]  Shai Shalev-Shwartz,et al.  Stochastic dual coordinate ascent methods for regularized loss , 2012, J. Mach. Learn. Res..

[35]  Zhi-Quan Luo,et al.  Joint Base Station Clustering and Beamformer Design for Partial Coordinated Transmission in Heterogeneous Networks , 2012, IEEE Journal on Selected Areas in Communications.

[36]  H. Zou,et al.  A coordinate majorization descent algorithm for ℓ1 penalized learning , 2014 .

[37]  Yurii Nesterov,et al.  Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems , 2012, SIAM J. Optim..

[38]  Katya Scheinberg,et al.  Block Coordinate Descent Methods for Semidefinite Programming , 2012 .

[39]  M. Raydan,et al.  Alternating Projection Methods , 2011 .

[40]  T. Hastie,et al.  SparseNet: Coordinate Descent With Nonconvex Penalties , 2011, Journal of the American Statistical Association.

[41]  Joseph K. Bradley,et al.  Parallel Coordinate Descent for L1-Regularized Loss Minimization , 2011, ICML.

[42]  Chih-Jen Lin,et al.  LIBSVM: A library for support vector machines , 2011, TIST.

[43]  Gary L. Miller,et al.  Approaching Optimality for Solving SDD Linear Systems , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[44]  Trevor Hastie,et al.  Regularization Paths for Generalized Linear Models via Coordinate Descent. , 2010, Journal of statistical software.

[45]  Adrian S. Lewis,et al.  Randomized Methods for Linear Constraints: Convergence Rates and Conditioning , 2008, Math. Oper. Res..

[46]  Tamara G. Kolda,et al.  Tensor Decompositions and Applications , 2009, SIAM Rev..

[47]  Marc Teboulle,et al.  A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems , 2009, SIAM J. Imaging Sci..

[48]  Chih-Jen Lin,et al.  A dual coordinate descent method for large-scale linear SVM , 2008, ICML '08.

[49]  R. Vershynin,et al.  A Randomized Kaczmarz Algorithm with Exponential Convergence , 2007, math/0702226.

[50]  A. Galántai.  On the rate of convergence of the alternating projection method in finite dimensional spaces , 2005 .

[51]  P. Oswald.  On the convergence rate of SOR: A worst case estimate , 2005, Computing.

[52]  Manindra Agrawal,et al.  PRIMES is in P , 2004 .

[53]  Shang-Hua Teng,et al.  Nearly-linear time algorithms for graph partitioning, graph sparsification, and solving linear systems , 2003, STOC '04.

[54]  A. Galántai.  Projectors and Projection Methods , 2003 .

[55]  Adrian A Canutescu,et al.  Cyclic coordinate descent: A robotics algorithm for protein loop closure , 2003, Protein science : a publication of the Protein Society.

[56]  Shang-Hua Teng,et al.  Smoothed analysis of algorithms: why the simplex algorithm usually takes polynomial time , 2001, STOC '01.

[57]  P. Tseng.  Convergence of a Block Coordinate Descent Method for Nondifferentiable Minimization , 2001 .

[58]  Luigi Grippo,et al.  On the convergence of the block nonlinear Gauss-Seidel method under convex constraints , 2000, Oper. Res. Lett..

[59]  P. Cubiotti.  On Periodic Solutions of Linear Control Systems , 1999 .

[60]  Hein Hundal,et al.  The Rate of Convergence for the Method of Alternating Projections, II , 1997 .

[61]  Anne Greenbaum,et al.  Iterative methods for solving linear systems , 1997, Frontiers in applied mathematics.

[62]  Heinz H. Bauschke,et al.  The method of cyclic projections for closed convex sets in Hilbert space , 1997 .

[63]  Ken D. Sauer,et al.  A unified approach to statistical tomography using coordinate descent optimization , 1996, IEEE Trans. Image Process..

[64]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

[65]  M. Glasser.  The quadratic formula made hard: A less radical approach to solving equations , 1994, math/9411224.

[66]  Carl C. Cowen,et al.  Triangular truncation and finding the norm of a Hadamard multiplier , 1992 .

[67]  P. Tseng,et al.  On the convergence of the coordinate descent method for convex differentiable minimization , 1992 .

[68]  Frank Deutsch,et al.  The Method of Alternating Orthogonal Projections , 1992 .

[69]  A. Edelman.  Eigenvalues and condition numbers of random matrices , 1988 .

[70]  Howard L. Weinert,et al.  Error bounds for the method of alternating projections , 1988, Math. Control. Signals Syst..

[71]  Kennan T. Smith,et al.  Practical and mathematical aspects of the problem of reconstructing objects from radiographs , 1977 .

[72]  D. J. Uherka,et al.  On the Continuous Dependence of the Roots of a Polynomial on its Coefficients , 1977 .

[73]  M. J. D. Powell,et al.  On search directions for minimization algorithms , 1973, Math. Program..

[74]  Olof B. Widlund,et al.  On the effects of scaling of the Peaceman-Rachford method , 1971 .

[75]  G. Forsythe,et al.  On best conditioned matrices , 1955 .

[76]  D. Young.  Iterative methods for solving partial difference equations of elliptic type , 1954 .

[77]  J. Neumann.  Functional Operators (AM-22), Volume 2: The Geometry of Orthogonal Spaces. (AM-22) , 1951 .

[78]  J. Neumann.  On Rings of Operators. Reduction Theory , 1949 .

[79]  F. Murray.  On Rings of Operators , 1936 .