Szilárd Csaba László
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Szilárd Csaba László has a total of 23 co-authors. Here are the top co-authors by number of shared publications:
- Radu Ioan Boţ
Faculty of Mathematics, University of Vienna, Vienna, Austria
10 shared publications - Ernö Robert Csetnek
Faculty of Mathematics, University of Vienna, Vienna, Austria
7 shared publications - Cristian Daniel Alecsa
Romanian Institute of Science and Technology Technical University of Cluj-Napoca Cluj-Napoca Romania
4 shared publications Ernö Robert Csetnek
4 shared publications- Hedy Attouch
IMAG, Univ. Montpellier, CNRS, Montpellier, France
3 shared publications Adrian Viorel
Department of Mathematics , Technical University of Cluj Napoca , Cluj-Napoca , Romania
2 shared publications
Latest Publications
- Open Access
- 25 February 2026
- Published by Springer Nature in Journal of Evolution Equations
- Vol. 26 (1) , 40
Strong convergence and fast rates for dynamical systems with Tikhonov regularization
We introduce and investigate the asymptotic behaviour of the trajectories of a second order dynamical system with Tikhonov regularization for solving a monotone equation with single valued, monotone and continuous operator acting on a real Hilbert space. We consider a vanishing damping which is correlated with the Tikhonov parameter and which is in line with recent developments in the literature on this topic. A correction term which involves the time derivative of the operator along the trajectory is also involved in the system and makes the link with Newton and Levenberg-Marquardt type methods. We obtain strong convergence of the trajectory to the minimal norm solution and fast convergence rates for the velocity and a quantity involving the operator along the trajectory. The rates are very close to the known fast convergence results for systems without Tikhonov regularization, the novelty with respect to this is that we also obtain strong convergence of the trajectory to the minimal norm solution. As an application we introduce a primal-dual dynamical system for solving linearly constrained convex optimization problems, where the strong convergence of the trajectories is highlighted together with fast convergence rates for the feasibility measure and function values.
- 25 February 2026
- Published by Springer Nature in Journal of Evolution Equations
- Vol. 26 (1) , 40
Open AccessStrong convergence and fast rates for dynamical systems with Tikhonov regularization
We introduce and investigate the asymptotic behaviour of the trajectories of a second order dynamical system with Tikhonov regularization for solving a monotone equation with single valued, monotone and continuous operator acting on a real Hilbert space. We consider a vanishing damping which is correlated with the Tikhonov parameter and which is in line with recent developments in the literature on this topic. A correction term which involves the time derivative of the operator along the trajectory is also involved in the system and makes the link with Newton and Levenberg-Marquardt type methods. We obtain strong convergence of the trajectory to the minimal norm solution and fast convergence rates for the velocity and a quantity involving the operator along the trajectory. The rates are very close to the known fast convergence results for systems without Tikhonov regularization, the novelty with respect to this is that we also obtain strong convergence of the trajectory to the minimal norm solution. As an application we introduce a primal-dual dynamical system for solving linearly constrained convex optimization problems, where the strong convergence of the trajectories is highlighted together with fast convergence rates for the feasibility measure and function values.
- Open Access
Solving nonconvex optimization problems via a second order dynamical system with unbounded damping
In this paper we study a second order dynamical system with variable coefficients in connection to the minimization problem of a smooth nonconvex function. The convergence of the trajectories generated by the dynamical system to a critical point of the objective function is assured, provided a regularization of the objective function satisfies the Kurdyka-Łojasiewicz property. We also provide convergence rates for the trajectories generated by the dynamical system, formulated in terms of the Łojasiewicz exponent, and we show that the unbounded damping considered in our dynamical system significantly improves the convergence rates known so far in the literature, that is, instead of linear rates we obtain superlinear rates.
Open AccessSolving nonconvex optimization problems via a second order dynamical system with unbounded damping
In this paper we study a second order dynamical system with variable coefficients in connection to the minimization problem of a smooth nonconvex function. The convergence of the trajectories generated by the dynamical system to a critical point of the objective function is assured, provided a regularization of the objective function satisfies the Kurdyka-Łojasiewicz property. We also provide convergence rates for the trajectories generated by the dynamical system, formulated in terms of the Łojasiewicz exponent, and we show that the unbounded damping considered in our dynamical system significantly improves the convergence rates known so far in the literature, that is, instead of linear rates we obtain superlinear rates.
- Open Access
- 14 May 2025
- Published by Elsevier in Communications in Nonlinear Science and Numerical Simulation
- Vol. 149
On the convergence of an inertial proximal algorithm with a Tikhonov regularization term
- 14 May 2025
- Published by Elsevier in Communications in Nonlinear Science and Numerical Simulation
- Vol. 149
Open AccessOn the convergence of an inertial proximal algorithm with a Tikhonov regularization term
- Open Access
- 19 October 2024
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 90 (1) , 113-149
Solving convex optimization problems via a second order dynamical system with implicit Hessian damping and Tikhonov regularization
This paper deals with a second order dynamical system with a Tikhonov regularization term in connection to the minimization problem of a convex Fréchet differentiable function. The fact that beside the asymptotically vanishing damping we also consider an implicit Hessian driven damping in the dynamical system under study allows us, via straightforward explicit discretization, to obtain inertial algorithms of gradient type. We show that the value of the objective function in a generated trajectory converges rapidly to the global minimum of the objective function and depending the Tikhonov regularization parameter the generated trajectory converges weakly to a minimizer of the objective function or the generated trajectory converges strongly to the element of minimal norm from the $$\mathop {\text {argmin}}$$ set of the objective function. We also obtain the fast convergence of the velocities towards zero and some integral estimates. Our analysis reveals that the Tikhonov regularization parameter and the damping parameters are strongly correlated, there is a setting of the parameters that separates the cases when weak convergence of the trajectories to a minimizer and strong convergence of the trajectories to the minimal norm minimizer can be obtained.- 19 October 2024
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 90 (1) , 113-149
Open AccessSolving convex optimization problems via a second order dynamical system with implicit Hessian damping and Tikhonov regularization
This paper deals with a second order dynamical system with a Tikhonov regularization term in connection to the minimization problem of a convex Fréchet differentiable function. The fact that beside the asymptotically vanishing damping we also consider an implicit Hessian driven damping in the dynamical system under study allows us, via straightforward explicit discretization, to obtain inertial algorithms of gradient type. We show that the value of the objective function in a generated trajectory converges rapidly to the global minimum of the objective function and depending the Tikhonov regularization parameter the generated trajectory converges weakly to a minimizer of the objective function or the generated trajectory converges strongly to the element of minimal norm from the $$\mathop {\text {argmin}}$$ set of the objective function. We also obtain the fast convergence of the velocities towards zero and some integral estimates. Our analysis reveals that the Tikhonov regularization parameter and the damping parameters are strongly correlated, there is a setting of the parameters that separates the cases when weak convergence of the trajectories to a minimizer and strong convergence of the trajectories to the minimal norm minimizer can be obtained. - Open Access
A proximal-gradient inertial algorithm with Tikhonov regularization: strong convergence to the minimal norm solution
We investigate the strong convergence properties of a proximal-gradient inertial algorithm with two Tikhonov regularization terms in connection to the minimization problem of the sum of a convex lower semi-continuous function $f$ and a smooth convex function $g$. For the appropriate setting of the parameters we provide strong convergence of the generated sequence $(x_k)$ to the minimum norm minimizer of our objective function $f+g$. Further, we obtain fast convergence to zero of the objective function values in a generated sequence but also for the discrete velocity and the sub-gradient of the objective function. We also show that for another settings of the parameters the optimal rate of order $\mathcal{O}(k^{-2})$ for the potential energy $(f+g)(x_k)-\min(f+g)$ can be obtained.Open AccessA proximal-gradient inertial algorithm with Tikhonov regularization: strong convergence to the minimal norm solution
We investigate the strong convergence properties of a proximal-gradient inertial algorithm with two Tikhonov regularization terms in connection to the minimization problem of the sum of a convex lower semi-continuous function $f$ and a smooth convex function $g$. For the appropriate setting of the parameters we provide strong convergence of the generated sequence $(x_k)$ to the minimum norm minimizer of our objective function $f+g$. Further, we obtain fast convergence to zero of the objective function values in a generated sequence but also for the discrete velocity and the sub-gradient of the objective function. We also show that for another settings of the parameters the optimal rate of order $\mathcal{O}(k^{-2})$ for the potential energy $(f+g)(x_k)-\min(f+g)$ can be obtained. - Open Access
- 5 July 2024
- Published by Springer Nature in Applied Mathematics & Optimization
- Vol. 90 (1) , 1-29
A Nesterov Type Algorithm with Double Tikhonov Regularization: Fast Convergence of the Function Values and Strong Convergence to the Minimal Norm Solution
We investigate the strong convergence properties of a Nesterov type algorithm with two Tikhonov regularization terms in connection to the minimization problem of a smooth convex functionf. We show that the generated sequences converge strongly to the minimal norm element from $$\text {argmin}f$$ . We also show fast convergence for the potential energies $$f(x_n)-\text {min}f$$ and $$f(y_n)-\text {min}f$$ , where $$(x_n),\,(y_n)$$ are the sequences generated by our algorithm. Further we obtain fast convergence to zero of the discrete velocity and some estimates concerning the value of the gradient of the objective function in the generated sequences. Via some numerical experiments we show that we need both Tikhonov regularization terms in our algorithm in order to obtain the strong convergence of the generated sequences to the minimum norm minimizer of our objective function.- 5 July 2024
- Published by Springer Nature in Applied Mathematics & Optimization
- Vol. 90 (1) , 1-29
Open AccessA Nesterov Type Algorithm with Double Tikhonov Regularization: Fast Convergence of the Function Values and Strong Convergence to the Minimal Norm Solution
We investigate the strong convergence properties of a Nesterov type algorithm with two Tikhonov regularization terms in connection to the minimization problem of a smooth convex functionf. We show that the generated sequences converge strongly to the minimal norm element from $$\text {argmin}f$$ . We also show fast convergence for the potential energies $$f(x_n)-\text {min}f$$ and $$f(y_n)-\text {min}f$$ , where $$(x_n),\,(y_n)$$ are the sequences generated by our algorithm. Further we obtain fast convergence to zero of the discrete velocity and some estimates concerning the value of the gradient of the objective function in the generated sequences. Via some numerical experiments we show that we need both Tikhonov regularization terms in our algorithm in order to obtain the strong convergence of the generated sequences to the minimum norm minimizer of our objective function. - Top Cited PapersOpen Access
- 27 June 2024
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 99 (3) , 307-347
Convex optimization via inertial algorithms with vanishing Tikhonov regularization: fast convergence to the minimum norm solution
In a Hilbertian framework, for the minimization of a general convex differentiable function f, we introduce new inertial dynamics and algorithms that generate trajectories and iterates that converge fastly towards the minimizer of f with minimum norm. Our study is based on the non-autonomous version of the Polyak heavy ball method, which, at time t, is associated with the strongly convex function obtained by adding to f a Tikhonov regularization term with vanishing coefficient $$\varepsilon (t)$$ . In this dynamic, the damping coefficient is proportional to the square root of the Tikhonov regularization parameter $$\varepsilon (t)$$ . By adjusting the speed of convergence of $$\varepsilon (t)$$ towards zero, we will obtain both rapid convergence towards the infimal value of f, and the strong convergence of the trajectories towards the element of minimum norm of the set of minimizers of f. In particular, we obtain an improved version of the dynamic of Su-Boyd-Candès for the accelerated gradient method of Nesterov. This study naturally leads to corresponding first-order algorithms obtained by temporal discretization. In the case of a proper lower semicontinuous and convex function f, we study the proximal algorithms in detail, and show that they benefit from similar properties.- 27 June 2024
- Published by Springer Nature in Mathematical Methods of Operations Research
- Vol. 99 (3) , 307-347
Top Cited PapersOpen AccessConvex optimization via inertial algorithms with vanishing Tikhonov regularization: fast convergence to the minimum norm solution
In a Hilbertian framework, for the minimization of a general convex differentiable function f, we introduce new inertial dynamics and algorithms that generate trajectories and iterates that converge fastly towards the minimizer of f with minimum norm. Our study is based on the non-autonomous version of the Polyak heavy ball method, which, at time t, is associated with the strongly convex function obtained by adding to f a Tikhonov regularization term with vanishing coefficient $$\varepsilon (t)$$ . In this dynamic, the damping coefficient is proportional to the square root of the Tikhonov regularization parameter $$\varepsilon (t)$$ . By adjusting the speed of convergence of $$\varepsilon (t)$$ towards zero, we will obtain both rapid convergence towards the infimal value of f, and the strong convergence of the trajectories towards the element of minimum norm of the set of minimizers of f. In particular, we obtain an improved version of the dynamic of Su-Boyd-Candès for the accelerated gradient method of Nesterov. This study naturally leads to corresponding first-order algorithms obtained by temporal discretization. In the case of a proper lower semicontinuous and convex function f, we study the proximal algorithms in detail, and show that they benefit from similar properties. - Open Access
On the convergence of an inertial proximal algorithm with a Tikhonov regularization term
This paper deals with an inertial proximal algorithm that contains a Tikhonov regularization term, in connection to the minimization problem of a convex lower semicontinuous function $f$. We show that for appropriate Tikhonov regularization parameters the value of the objective function in the sequences generated by our algorithm converges fast (with arbitrary rate) to the global minimum of the objective function and the generated sequences converges weakly to a minimizer of the objective function. We also obtain the fast convergence of the discrete velocities towards zero and some sum estimates. Nevertheless, our main goal is to obtain strong convergence results and also pointwise and sum estimates for the same constellation of the parameters involved. Our analysis reveals that the extrapolation coefficient and the Tikhonov regularization coefficient are strongly correlated and there is a critical setting of the parameters that separates the cases when strong respective weak convergence results can be obtained.Open AccessOn the convergence of an inertial proximal algorithm with a Tikhonov regularization term
This paper deals with an inertial proximal algorithm that contains a Tikhonov regularization term, in connection to the minimization problem of a convex lower semicontinuous function $f$. We show that for appropriate Tikhonov regularization parameters the value of the objective function in the sequences generated by our algorithm converges fast (with arbitrary rate) to the global minimum of the objective function and the generated sequences converges weakly to a minimizer of the objective function. We also obtain the fast convergence of the discrete velocities towards zero and some sum estimates. Nevertheless, our main goal is to obtain strong convergence results and also pointwise and sum estimates for the same constellation of the parameters involved. Our analysis reveals that the extrapolation coefficient and the Tikhonov regularization coefficient are strongly correlated and there is a critical setting of the parameters that separates the cases when strong respective weak convergence results can be obtained. - Open Access
Solving convex optimization problems via a second order dynamical system with implicit Hessian damping and Tikhonov regularization
This paper deals with a second order dynamical system with a Tikhonov regularization term in connection to the minimization problem of a convex Fréchet differentiable function. The fact that beside the asymptotically vanishing damping we also consider an implicit Hessian driven damping in the dynamical system under study allows us, via straightforward explicit discretization, to obtain inertial algorithms of gradient type. We show that the value of the objective function in a generated trajectory converges rapidly to the global minimum of the objective function and depending the Tikhonov regularization parameter the generated trajectory converges weakly to a minimizer of the objective function or the generated trajectory converges strongly to the element of minimal norm from the $\argmin$ set of the objective function. We also obtain the fast convergence of the velocities towards zero and some integral estimates. Our analysis reveals that the Tikhonov regularization parameter and the damping parameters are strongly correlated, there is a setting of the parameters that separates the cases when weak convergence of the trajectories to a minimizer and strong convergence of the trajectories to the minimal norm minimizer can be obtained.Open AccessSolving convex optimization problems via a second order dynamical system with implicit Hessian damping and Tikhonov regularization
This paper deals with a second order dynamical system with a Tikhonov regularization term in connection to the minimization problem of a convex Fréchet differentiable function. The fact that beside the asymptotically vanishing damping we also consider an implicit Hessian driven damping in the dynamical system under study allows us, via straightforward explicit discretization, to obtain inertial algorithms of gradient type. We show that the value of the objective function in a generated trajectory converges rapidly to the global minimum of the objective function and depending the Tikhonov regularization parameter the generated trajectory converges weakly to a minimizer of the objective function or the generated trajectory converges strongly to the element of minimal norm from the $\argmin$ set of the objective function. We also obtain the fast convergence of the velocities towards zero and some integral estimates. Our analysis reveals that the Tikhonov regularization parameter and the damping parameters are strongly correlated, there is a setting of the parameters that separates the cases when weak convergence of the trajectories to a minimizer and strong convergence of the trajectories to the minimal norm minimizer can be obtained. - Open Access
- 2 May 2023
- Published by Springer Nature in Research Square
On the convergence of an inertial proximal algorithm with a Tikhonov regularization term
This paper deals with an inertial proximal algorithm that contains a Tikhonov regularization term, in connection to the minimization problem of a convex lower semicontinuous function f. We show that for appropriate Tikhonov regularization parameters the value of the objective function in the sequences generated by our algorithm converges fast (with arbitrary rate) to the global minimum of the objective function and the generated sequences converges weakly to a minimizer of the objective function. We also obtain the fast convergence of the discrete velocities towards zero and some sum estimates. Nevertheless, our main goal is to obtain strong convergence results and also pointwise and sum estimates for the same constellation of the parameters involved. Our analysis reveals that the extrapolation coefficient and the Tikhonov regularization coefficient are strongly correlated and there is a critical setting of the parameters that separates the cases when strong convergence results or weak convergence results can be obtained. AMS subject classification. 46N10, 65K05, 65K10, 90C25, 90C30
- 2 May 2023
- Published by Springer Nature in Research Square
Open AccessOn the convergence of an inertial proximal algorithm with a Tikhonov regularization term
This paper deals with an inertial proximal algorithm that contains a Tikhonov regularization term, in connection to the minimization problem of a convex lower semicontinuous function f. We show that for appropriate Tikhonov regularization parameters the value of the objective function in the sequences generated by our algorithm converges fast (with arbitrary rate) to the global minimum of the objective function and the generated sequences converges weakly to a minimizer of the objective function. We also obtain the fast convergence of the discrete velocities towards zero and some sum estimates. Nevertheless, our main goal is to obtain strong convergence results and also pointwise and sum estimates for the same constellation of the parameters involved. Our analysis reveals that the extrapolation coefficient and the Tikhonov regularization coefficient are strongly correlated and there is a critical setting of the parameters that separates the cases when strong convergence results or weak convergence results can be obtained. AMS subject classification. 46N10, 65K05, 65K10, 90C25, 90C30