{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T06:32:33Z","timestamp":1778135553738,"version":"3.51.4"},"reference-count":30,"publisher":"American Mathematical Society (AMS)","issue":"325","license":[{"start":{"date-parts":[[2021,4,7]],"date-time":"2021-04-07T00:00:00Z","timestamp":1617753600000},"content-version":"am","delay-in-days":365,"URL":"https:\/\/www.ams.org\/publications\/copyright-and-permissions"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1913080"],"award-info":[{"award-number":["1913080"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1719854"],"award-info":[{"award-number":["1719854"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1913080"],"award-info":[{"award-number":["1913080"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1719854"],"award-info":[{"award-number":["1719854"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Comp."],"abstract":"<p>The full approximation storage (FAS) scheme is a widely used multigrid method for nonlinear problems. In this paper, a new framework to design and analyze FAS-like schemes for convex optimization problems is developed. The new method, the fast subspace descent (FASD) scheme, which generalizes classical FAS, can be recast as an inexact version of nonlinear multigrid methods based on space decomposition and subspace correction. The local problem in each subspace can be simplified to be linear and one gradient descent iteration (with an appropriate step size) is enough to ensure a global linear (geometric) convergence of FASD for convex optimization problems.<\/p>","DOI":"10.1090\/mcom\/3526","type":"journal-article","created":{"date-parts":[[2020,2,12]],"date-time":"2020-02-12T09:26:29Z","timestamp":1581499589000},"page":"2249-2282","source":"Crossref","is-referenced-by-count":12,"title":["Convergence analysis of the Fast Subspace Descent method for convex optimization problems"],"prefix":"10.1090","volume":"89","author":[{"given":"Long","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaozhe","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steven","family":"Wise","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"14","published-online":{"date-parts":[[2020,4,7]]},"reference":[{"key":"1","series-title":"Texts in Applied Mathematics","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-0458-4","volume-title":"Theoretical numerical analysis","volume":"39","author":"Atkinson, Kendall","year":"2009","ISBN":"https:\/\/id.crossref.org\/isbn\/9781441904577","edition":"3"},{"issue":"4","key":"2","doi-asserted-by":"publisher","first-page":"2037","DOI":"10.1137\/120887679","article-title":"On the convergence of block coordinate descent type methods","volume":"23","author":"Beck, Amir","year":"2013","journal-title":"SIAM J. Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/1052-6234","issn-type":"print"},{"issue":"138","key":"3","doi-asserted-by":"publisher","first-page":"333","DOI":"10.2307\/2006422","article-title":"Multi-level adaptive solutions to boundary-value problems","volume":"31","author":"Brandt, Achi","year":"1977","journal-title":"Math. Comp.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5718","issn-type":"print"},{"key":"4","series-title":"Classics in Applied Mathematics","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970753","volume-title":"Multigrid techniques---1984 guide with applications to fluid dynamics","volume":"67","author":"Brandt, Achi","year":"2011","ISBN":"https:\/\/id.crossref.org\/isbn\/9781611970746"},{"key":"5","unstructured":"L. Chen, Mesh smoothing schemes based on optimal Delaunay triangulations, 13th International Meshing Roundtable, pages 109\u2013120, Williamsburg, VA, 2004. Sandia National Laboratories."},{"key":"6","unstructured":"L. Chen, iFEM: An Integrated Finite Element Methods Package in MATLAB, Technical Report, University of California at Irvine, 2009."},{"issue":"2","key":"7","first-page":"299","article-title":"Optimal Delaunay triangulations","volume":"22","author":"Chen, Long","year":"2004","journal-title":"J. Comput. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0254-9409","issn-type":"print"},{"key":"8","series-title":"Cambridge Texts in Applied Mathematics","isbn-type":"print","doi-asserted-by":"crossref","DOI":"10.1017\/9781139171984","volume-title":"Introduction to numerical linear algebra and optimisation","author":"Ciarlet, Philippe G.","year":"1989","ISBN":"https:\/\/id.crossref.org\/isbn\/0521327881"},{"key":"9","series-title":"Studies in Mathematics and its Applications, Vol. 1","volume-title":"Convex analysis and variational problems","author":"Ekeland, Ivar","year":"1976"},{"key":"10","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.jcp.2016.12.046","article-title":"Preconditioned steepest descent methods for some nonlinear elliptic equations involving p-Laplacian terms","volume":"334","author":"Feng, Wenqiang","year":"2017","journal-title":"J. Comput. Phys.","ISSN":"https:\/\/id.crossref.org\/issn\/0021-9991","issn-type":"print"},{"issue":"1","key":"11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01582249","article-title":"On multilevel iterative methods for optimization problems","volume":"48","author":"Gelman, E.","year":"1990","journal-title":"Math. Programming","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5610","issn-type":"print"},{"issue":"1","key":"12","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1137\/050623012","article-title":"Recursive trust-region methods for multiscale nonlinear optimization","volume":"19","author":"Gratton, Serge","year":"2008","journal-title":"SIAM J. Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/1052-6234","issn-type":"print"},{"key":"13","series-title":"Springer Series in Computational Mathematics","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-02427-0","volume-title":"Multigrid methods and applications","volume":"4","author":"Hackbusch, Wolfgang","year":"1985","ISBN":"https:\/\/id.crossref.org\/isbn\/3540127615"},{"key":"14","unstructured":"V. E. Henson, Multigrid methods for nonlinear problems: an overview, submitted to the conference proceedings of the SPIE 15th Annual Symposium on Electronic Imaging, 2005."},{"issue":"15","key":"15","doi-asserted-by":"publisher","first-page":"5323","DOI":"10.1016\/j.jcp.2009.04.020","article-title":"Stable and efficient finite-difference nonlinear-multigrid schemes for the phase field crystal equation","volume":"228","author":"Hu, Z.","year":"2009","journal-title":"J. Comput. Phys.","ISSN":"https:\/\/id.crossref.org\/issn\/0021-9991","issn-type":"print"},{"issue":"1","key":"16","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/s10915-017-0466-z","article-title":"Multigrid methods for a mixed finite element method of the Darcy-Forchheimer model","volume":"74","author":"Huang, Jian","year":"2018","journal-title":"J. Sci. Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/0885-7474","issn-type":"print"},{"issue":"6","key":"17","doi-asserted-by":"publisher","first-page":"1811","DOI":"10.1137\/S1064827502407792","article-title":"Model problems for the multigrid optimization of systems governed by differential equations","volume":"26","author":"Lewis, Robert Michael","year":"2005","journal-title":"SIAM J. Sci. Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/1064-8275","issn-type":"print"},{"issue":"3","key":"18","doi-asserted-by":"publisher","first-page":"1910","DOI":"10.1137\/16M1082767","article-title":"Randomized block proximal damped Newton method for composite self-concordant minimization","volume":"27","author":"Lu, Zhaosong","year":"2017","journal-title":"SIAM J. Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/1052-6234","issn-type":"print"},{"issue":"1-2","key":"19","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1080\/10556780008805795","article-title":"A multigrid approach to discretized optimization problems","volume":"14","author":"Nash, Stephen G.","year":"2000","journal-title":"Optim. Methods Softw.","ISSN":"https:\/\/id.crossref.org\/issn\/1055-6788","issn-type":"print"},{"issue":"2","key":"20","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/100802001","article-title":"Efficiency of coordinate descent methods on huge-scale optimization problems","volume":"22","author":"Nesterov, Yu.","year":"2012","journal-title":"SIAM J. Optim.","ISSN":"https:\/\/id.crossref.org\/issn\/1052-6234","issn-type":"print"},{"key":"21","series-title":"Applied Optimization","isbn-type":"print","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory lectures on convex optimization","volume":"87","author":"Nesterov, Yurii","year":"2004","ISBN":"https:\/\/id.crossref.org\/isbn\/1402075537"},{"issue":"3","key":"22","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01398879","article-title":"Convergence of the multigrid full approximation scheme for a class of elliptic mildly nonlinear boundary value problems","volume":"52","author":"Reusken, Arnold","year":"1988","journal-title":"Numer. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0029-599X","issn-type":"print"},{"issue":"6","key":"23","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1007\/BF01397135","article-title":"Convergence of the multilevel full approximation scheme including the \ud835\udc49-cycle","volume":"53","author":"Reusken, Arnold","year":"1988","journal-title":"Numer. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0029-599X","issn-type":"print"},{"issue":"4","key":"24","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1016\/S0168-9274(99)00064-1","article-title":"Full-FAS multigrid grid generation algorithms","volume":"32","author":"Spitaleri, R. M.","year":"2000","journal-title":"Appl. Numer. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0168-9274","issn-type":"print"},{"issue":"4","key":"25","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1007\/s002110200404","article-title":"Rate of convergence for some constraint decomposition methods for nonlinear variational inequalities","volume":"93","author":"Tai, Xue-Cheng","year":"2003","journal-title":"Numer. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0029-599X","issn-type":"print"},{"key":"26","first-page":"130","article-title":"Subspace correction methods for convex optimization problems","author":"Tai, Xue-Cheng","year":"1999"},{"issue":"237","key":"27","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1090\/S0025-5718-01-01311-4","article-title":"Global and uniform convergence of subspace correction methods for some convex optimization problems","volume":"71","author":"Tai, Xue-Cheng","year":"2002","journal-title":"Math. Comp.","ISSN":"https:\/\/id.crossref.org\/issn\/0025-5718","issn-type":"print"},{"issue":"1","key":"28","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1016\/j.jcp.2007.04.020","article-title":"Solving the regularized, strongly anisotropic Cahn-Hilliard equation by an adaptive nonlinear multigrid method","volume":"226","author":"Wise, Steven","year":"2007","journal-title":"J. Comput. Phys.","ISSN":"https:\/\/id.crossref.org\/issn\/0021-9991","issn-type":"print"},{"issue":"4","key":"29","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1137\/1034116","article-title":"Iterative methods by space decomposition and subspace correction","volume":"34","author":"Xu, Jinchao","year":"1992","journal-title":"SIAM Rev.","ISSN":"https:\/\/id.crossref.org\/issn\/1095-7200","issn-type":"print"},{"issue":"1","key":"30","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1137\/040613809","article-title":"A multilevel nonlinear method","volume":"28","author":"Yavneh, Irad","year":"2006","journal-title":"SIAM J. Sci. Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/1064-8275","issn-type":"print"}],"container-title":["Mathematics of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.ams.org\/mcom\/2020-89-325\/S0025-5718-2020-03526-1\/mcom3526_AM.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/www.ams.org\/mcom\/earlyview\/#mcom3526\/.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/www.ams.org\/mcom\/2020-89-325\/S0025-5718-2020-03526-1\/S0025-5718-2020-03526-1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T03:45:57Z","timestamp":1776829557000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.ams.org\/mcom\/2020-89-325\/S0025-5718-2020-03526-1\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,7]]},"references-count":30,"journal-issue":{"issue":"325","published-print":{"date-parts":[[2020,9]]}},"alternative-id":["S0025-5718-2020-03526-1"],"URL":"https:\/\/doi.org\/10.1090\/mcom\/3526","archive":["CLOCKSS","Portico"],"relation":{},"ISSN":["1088-6842","0025-5718"],"issn-type":[{"value":"1088-6842","type":"electronic"},{"value":"0025-5718","type":"print"}],"subject":[],"published":{"date-parts":[[2020,4,7]]}}}