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:

Gradient methods based on non-standard Lagrange–Burmann Runge–Kutta method

Gerasim V. Krivovichev and Roman B. Kirillov
Journal of Computational and Applied Mathematics 483 117434 (2026)
https://doi.org/10.1016/j.cam.2026.117434

Application of Runge–Kutta method with non-standard finite difference for the construction of preconditioned gradient methods

Gerasim V. Krivovichev and Ksenia I. Semina
Applied Mathematics and Computation 515 129854 (2026)
https://doi.org/10.1016/j.amc.2025.129854

The application of an integrator based on the Lyapunov function in Runge–Kutta gradient methods for convex optimization

Gerasim Krivovichev
Journal of Applied Mathematics and Computing 71 (S2) 1665 (2025)
https://doi.org/10.1007/s12190-025-02638-2

Application of stochastic gradient method with momentum inspired by explicit stabilized Runge–Kutta method in unconstrained convex optimization

Gerasim Krivovichev
Numerical Algorithms (2025)
https://doi.org/10.1007/s11075-025-02251-1

Adaptive POD-DEIM correction for Turing pattern approximation in reaction–diffusion PDE systems

Alessandro Alla, Angela Monti and Ivonne Sgura
Journal 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ès
SIAM 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ès
Journal 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 Bhaya
Journal 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 Pazos
Numerical 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 Ruggiero
Applied 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 Landi
Journal 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 Bhaya
Journal of Computational and Applied Mathematics 279 123 (2015)
https://doi.org/10.1016/j.cam.2014.10.022

An Optimally Generalized Steepest-Descent Algorithm for Solving Ill-Posed Linear Systems

Chein-Shan Liu
Journal of Applied Mathematics 2013 1 (2013)
https://doi.org/10.1155/2013/154358

Optimal estimation of $\ell_1$-regularization prior from a regularized empirical Bayesian risk standpoint

Hui Huang, Eldad Haber and Lior Horesh
Inverse Problems & Imaging 6 (3) 447 (2012)
https://doi.org/10.3934/ipi.2012.6.447