Szilárd Csaba László

Prof. Dr. Szilárd Csaba László


Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 February 2016 in EURO Journal on Computational Optimization
Verified
Journal Article
Closed access
RBRadu Ioan Boţ
Radu Ioan Boţ
ECErnö Robert Csetnek
Ernö Robert Csetnek
SLSzilárd Csaba László
Szilárd Csaba László

11 June 2020 in Mathematical Programming
Verified
Journal Article
Open access
PDF file
RBRadu Ioan Boţ
Radu Ioan Boţ
ECErnö Robert Csetnek
Ernö Robert Csetnek
SLSzilárd Csaba László
Szilárd Csaba László
We investigate the asymptotic properties of the trajectories generated by a second-order dynamical system with Hessian driven damping and a Tikhonov regularization term in connection with the minimization of a smooth convex function in Hilbert spaces. We obtain fast convergence results for the function values along the trajectories. The Tikhonov regularization term enables the derivation of strong convergence results of the trajectory to the minimizer of the objective function of minimum norm.

8 June 2020 in Applied Mathematics & Optimization
Verified
Journal Article
Closed access
PDF file
CACristian Daniel Alecsa
Cristian Daniel Alecsa
SLSzilárd Csaba László
Szilárd Csaba László
TPTitus Pinţa
Titus Pinţa

27 June 2024 in Mathematical Methods of Operations Research
Verified
Journal Article
Open access
PDF file
HAHedy Attouch
Hedy Attouch
SLSzilárd Csaba László
Szilárd Csaba László
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)$$ ε ( t ) . In this dynamic, the damping coefficient is proportional to the square root of the Tikhonov regularization parameter $$\varepsilon (t)$$ ε ( t ) . By adjusting the speed of convergence of $$\varepsilon (t)$$ ε ( 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.


1 January 2021 in SIAM Journal on Optimization
Verified
Journal Article
Closed access
CACristian Daniel Alecsa
Cristian Daniel Alecsa
SLSzilárd Csaba László
Szilárd Csaba László
This paper examines a perturbed heavy ball system with vanishing damping that contains a Tikhonov regularization term in connection to the minimization problem of a convex Fréchet differentiable fu...