Exact counterexamples to R-superlinear convergence of cyclic steepest descent
Yu Li, Qihang Wang
Abstract
Cyclic steepest descent (CSD) recomputes the exact steepest-descent stepsize once per cycle and reuses it for m updates. Dai's ICM 2022 survey describes CSD as likely to converge R-superlinearly on n-dimensional convex quadratics when m(n+1)/2. We disprove the universal form of this assertion by two closed-form orbits at the stated threshold. First, for n=m=2, A=diag(1,3), b=0, and x0=(1,1/3)T, the method follows the nonterminating balanced-zigzag orbit xk=2-k(1,(-1)k/3)T, whose successive error norms have ratio 1/2. Second, for n=3, m=2, and A=diag(1,2,3), we exhibit a full-support, nonresonant cycle-boundary projective period-two orbit with gk+4=gk/49 and xk+4=xk/49. This second construction is genuinely three-dimensional and is not a two-dimensional zigzag. Thus the universal claim fails through both the classical balanced-zigzag mechanism and a distinct non-zigzag period-two mechanism.
Create a lesson
Related papers
Randomized Matvec Lower Bounds for Simplex-Based Matrix Games
Wendao Wu, Cong Fang
Optimal Stochastic Bilevel Optimization with First-Order Oracles
Linxuan Pan, Junchi Yang
Recognizing Signomial Convexity is Hard
Rui Zheng, Iosif Sakos, Antonios Varvitsiotis
Simplifying the computation of weak- second subderivatives of convex functionals via Γ-convergence
Gerd Wachsmuth
Routing in Line Networks with Handling Times
Gabriel Deza, Michal Tzur, Tal Raviv
Lower Bounds for Stochastic First-Order Algorithms with Variance Reduction in Nonconvex--Concave Minimax Optimization
Jiayi Song, Zi Xu