^Spall, J. C. (2012). “Cyclic Seesaw Process for Optimization and Identification”. Journal of Optimization Theory and Applications154 (1): 187–208. doi:10.1007/s10957-012-0001-1.
^Fessler, J. A.; Ficaro, E. P.; Clinthorne, N. H.; Lange, K. (1997-04-01). “Grouped-coordinate ascent algorithms for penalized-likelihood transmission image reconstruction”. IEEE Transactions on Medical Imaging16 (2): 166–175. doi:10.1109/42.563662. hdl:2027.42/86021. ISSN0278-0062. PMID9101326.
Bezdek, J. C.; Hathaway, R. J.; Howard, R. E.; Wilson, C. A.; Windham, M. P. (1987), “Local convergence analysis of a grouped variable version of coordinate descent”, Journal of Optimization Theory and Applications (Kluwer Academic/Plenum Publishers) 54 (3): pp. 471–477, doi:10.1007/BF00940196
Bertsekas, Dimitri P. (1999). Nonlinear Programming, Second Edition Athena Scientific, Belmont, Massachusetts. ISBN1-886529-00-0.
Luo, Zhiquan; Tseng, P. (1992), “On the convergence of the coordinate descent method for convex differentiable minimization”, Journal of Optimization Theory and Applications (Kluwer Academic/Plenum Publishers) 72 (1): pp. 7–35, doi:10.1007/BF00939948, hdl:1721.1/3164.
Wu, TongTong; Lange, Kenneth (2008), “Coordinate descent algorithms for Lasso penalized regression”, The Annals of Applied Statistics (Institute of Mathematical Statistics) 2 (1): pp. 224–244, arXiv:0803.3876, doi:10.1214/07-AOAS147.
Richtarik, Peter; Takac, Martin (2011-04), “Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function”, Mathematical Programming (Springer) 144 (1–2): pp. 1–38, arXiv:1107.2848, doi:10.1007/s10107-012-0614-z.
Richtarik, Peter; Takac, Martin (2012-12), “Parallel coordinate descent methods for big data optimization”, ArXiv:1212.0873, arXiv:1212.0873.
All text is available under the terms of the GNU Free Documentation License. この記事は、ウィキペディアの座標降下法 (改訂履歴)の記事を複製、再配布したものにあたり、GNU Free Documentation Licenseというライセンスの下で提供されています。
Weblio辞書に掲載されているウィキペディアの記事も、全てGNU Free Documentation Licenseの元に提供されております。