Gradient descent and fast artificial time integration
ESAIM: M2AN, 43 4 (2009) 689-708
Published online: 2009-07-08
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
The application of Goeken–Johnson’s Runge–Kutta methods in unconstrained convex optimization
Gerasim KrivovichevNumerical Algorithms (2024)
https://doi.org/10.1007/s11075-024-02001-9
Adaptive POD-DEIM correction for Turing pattern approximation in reaction–diffusion PDE systems
Alessandro Alla, Angela Monti and Ivonne SguraJournal of Numerical Mathematics 31 (3) 205 (2023)
https://doi.org/10.1515/jnma-2022-0025
Delayed Gradient Methods for Symmetric and Positive Definite Linear Systems
Qinmeng Zou and Frédéric MagoulèsSIAM Review 64 (3) 517 (2022)
https://doi.org/10.1137/20M1321140
Fast gradient methods with alignment for symmetric linear systems without using Cauchy step
Qinmeng Zou and Frédéric MagoulèsJournal of Computational and Applied Mathematics 381 113033 (2021)
https://doi.org/10.1016/j.cam.2020.113033
Matrix forms of iterative algorithms to solve large-scale discrete ill-posed problems with an application to image restoration
Fernando Pazos and Amit BhayaJournal of Applied Mathematics and Computing 60 (1-2) 113 (2019)
https://doi.org/10.1007/s12190-018-1205-9
Cooperative concurrent asynchronous computation of the solution of symmetric linear systems
Amit Bhaya, Pierre-Alexandre Bliman and Fernando PazosNumerical Algorithms 75 (3) 587 (2017)
https://doi.org/10.1007/s11075-016-0213-9
Runge–Kutta-like scaling techniques for first-order methods in convex optimization
Federica Porta, Anastasia Cornelio and Valeria RuggieroApplied Numerical Mathematics 116 256 (2017)
https://doi.org/10.1016/j.apnum.2016.08.011
On the regularizing behavior of the SDA and SDC gradient methods in the solution of linear ill-posed problems
Roberta De Asmundis, Daniela di Serafino and Germana LandiJournal of Computational and Applied Mathematics 302 81 (2016)
https://doi.org/10.1016/j.cam.2016.01.007
Adaptive choice of the Tikhonov regularization parameter to solve ill-posed linear algebraic equations via Liapunov Optimizing Control
Fernando Pazos and Amit BhayaJournal of Computational and Applied Mathematics 279 123 (2015)
https://doi.org/10.1016/j.cam.2014.10.022
A vector regularization method to solve linear inverse problems
Chein-Shan LiuInverse Problems in Science and Engineering 22 (5) 765 (2014)
https://doi.org/10.1080/17415977.2013.823415
Faster Gradient Descent and the Efficient Recovery of Images
Hui Huang and Uri AscherVietnam Journal of Mathematics 42 (1) 115 (2014)
https://doi.org/10.1007/s10013-013-0055-x
An Optimally Generalized Steepest-Descent Algorithm for Solving Ill-Posed Linear Systems
Chein-Shan LiuJournal of Applied Mathematics 2013 1 (2013)
https://doi.org/10.1155/2013/154358
An optimal tri-vector iterative algorithm for solving ill-posed linear inverse problems
Chein-Shan LiuInverse Problems in Science and Engineering 21 (4) 650 (2013)
https://doi.org/10.1080/17415977.2012.717077
The Courant–Friedrichs–Lewy (CFL) Condition
Uri Ascher and Kees van den DoelThe Courant–Friedrichs–Lewy (CFL) Condition 147 (2013)
https://doi.org/10.1007/978-0-8176-8394-8_10
881 (2013)
https://doi.org/10.1109/CoDIT.2013.6689659
Optimal estimation of $\ell_1$-regularization prior from a regularized empirical Bayesian risk standpoint
Hui Huang, Eldad Haber and Lior HoreshInverse Problems & Imaging 6 (3) 447 (2012)
https://doi.org/10.3934/ipi.2012.6.447
The Chaotic Nature of Faster Gradient Descent Methods
Kees van den Doel and Uri AscherJournal of Scientific Computing 51 (3) 560 (2012)
https://doi.org/10.1007/s10915-011-9521-3
A dynamical systems framework for intermittent data assimilation
Sebastian ReichBIT Numerical Mathematics 51 (1) 235 (2011)
https://doi.org/10.1007/s10543-010-0302-4
774 (2010)
https://doi.org/10.1109/CDC.2010.5717471