Ernö Robert Csetnek
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Ernö Robert Csetnek has a total of 16 co-authors. Here are the top co-authors by number of shared publications:
- Radu Ioan Boţ
Faculty of Mathematics, University of Vienna, Vienna, Austria
40 shared publications - Szilárd Csaba László
Department of Mathematics, Technical University of Cluj-Napoca, Cluj-Napoca, Romania
7 shared publications - Andrew Eberhard
School of Mathematical Sciences, RMIT University, Melbourne, Australia
2 shared publications - Christopher Hendrich
Chemnitz University of Technology
2 shared publications - Matthew K. Tam
School of Mathematics & Statistics The University of Melbourne Australia
2 shared publications - Nimit Nimana
Department of Mathematics, Faculty of Science, Khon Kaen University, Khon Kaen, Thailand
2 shared publications
Latest Publications
- 24 August 2021
- Published by Springer Nature in Advances in Computational Mathematics
- Vol. 47 (5) , 1-18
Convergence rates for boundedly regular systems
- 24 August 2021
- Published by Springer Nature in Advances in Computational Mathematics
- Vol. 47 (5) , 1-18
Convergence rates for boundedly regular systems
- Open Access
Convergence Rates for Boundedly Regular Systems
In this work, we consider a continuous dynamical system associated with the fixed point set of a nonexpansive operator which was originally studied by Bo\c{t} & Csetnek (2015). Our main results establish convergence rates for the system's trajectories when the nonexpansive operator satisfies an additional regularity property. This setting is the natural continuous-time analogue to discrete-time results obtained in Bauschke, Noll & Phan (2015) and Borwein, Li & Tam (2017) by using the same regularity properties.
Open AccessConvergence Rates for Boundedly Regular Systems
In this work, we consider a continuous dynamical system associated with the fixed point set of a nonexpansive operator which was originally studied by Bo\c{t} & Csetnek (2015). Our main results establish convergence rates for the system's trajectories when the nonexpansive operator satisfies an additional regularity property. This setting is the natural continuous-time analogue to discrete-time results obtained in Bauschke, Noll & Phan (2015) and Borwein, Li & Tam (2017) by using the same regularity properties.
- Open Access
- 1 January 2021
- Published by Taylor & Francis in Numerical Functional Analysis and Optimization
- Vol. 42 (1) , 1-38
A Dynamical Approach to Two-Block Separable Convex Optimization Problems with Linear Constraints
The aim of this manuscript is to approach by means of first order differential equations/inclusions convex programming problems with two-block separable linear constraints and objectives, whereby (at least) one of the components of the latter is assumed to be strongly convex. Each block of the objective contains a further smooth convex function. We investigate the dynamical system proposed and prove that its trajectories converge weakly to a saddle point of the Lagrangian of the convex optimization problem. The dynamical system provides through time discretization the alternating minimization algorithm AMA and also its proximal variant recently introduced in the literature.
- 1 January 2021
- Published by Taylor & Francis in Numerical Functional Analysis and Optimization
- Vol. 42 (1) , 1-38
Open AccessA Dynamical Approach to Two-Block Separable Convex Optimization Problems with Linear Constraints
The aim of this manuscript is to approach by means of first order differential equations/inclusions convex programming problems with two-block separable linear constraints and objectives, whereby (at least) one of the components of the latter is assumed to be strongly convex. Each block of the objective contains a further smooth convex function. We investigate the dynamical system proposed and prove that its trajectories converge weakly to a saddle point of the Lagrangian of the convex optimization problem. The dynamical system provides through time discretization the alternating minimization algorithm AMA and also its proximal variant recently introduced in the literature.
- 1 November 2020
- Published by Elsevier in European Journal of Operational Research
- Vol. 287 (1) , 49-60
The forward–backward–forward method from continuous and discrete perspective for pseudo-monotone variational inequalities in Hilbert spaces
- 1 November 2020
- Published by Elsevier in European Journal of Operational Research
- Vol. 287 (1) , 49-60
The forward–backward–forward method from continuous and discrete perspective for pseudo-monotone variational inequalities in Hilbert spaces
- Open Access
Tikhonov regularization of a second order dynamical system with Hessian driven damping
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.
Open AccessTikhonov regularization of a second order dynamical system with Hessian driven damping
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.
- Open Access
A primal-dual dynamical approach to structured convex minimization problems
In this paper we propose a primal-dual dynamical approach to the minimization of a structured convex function consisting of a smooth term, a nonsmooth term, and the composition of another nonsmooth term with a linear continuous operator. In this scope we introduce a dynamical system for which we prove that its trajectories asymptotically converge to a saddle point of the Lagrangian of the underlying convex minimization problem as time tends to infinity. In addition, we provide rates for both the violation of the feasibility condition by the ergodic trajectories and the convergence of the objective function along these ergodic trajectories to its minimal value. Explicit time discretization of the dynamical system results in a numerical algorithm which is a combination of the linearized proximal method of multipliers and the proximal ADMM algorithm.
Open AccessA primal-dual dynamical approach to structured convex minimization problems
In this paper we propose a primal-dual dynamical approach to the minimization of a structured convex function consisting of a smooth term, a nonsmooth term, and the composition of another nonsmooth term with a linear continuous operator. In this scope we introduce a dynamical system for which we prove that its trajectories asymptotically converge to a saddle point of the Lagrangian of the underlying convex minimization problem as time tends to infinity. In addition, we provide rates for both the violation of the feasibility condition by the ergodic trajectories and the convergence of the objective function along these ergodic trajectories to its minimal value. Explicit time discretization of the dynamical system results in a numerical algorithm which is a combination of the linearized proximal method of multipliers and the proximal ADMM algorithm.
- Open Access
The Forward-Backward-Forward Method from continuous and discrete perspective for pseudo-monotone variational inequalities in Hilbert spaces
Tseng's forward-backward-forward algorithm is a valuable alternative for Korpelevich's extragradient method when solving variational inequalities over a convex and closed set governed by monotone and Lipschitz continuous operators, as it requires in every step only one projection operation. However, it is well-known that Korpelevich's method converges and can therefore be used also for solving variational inequalities governed by pseudo-monotone and Lipschitz continuous operators. In this paper, we first associate to a pseudo-monotone variational inequality a forward-backward-forward dynamical system and carry out an asymptotic analysis for the generated trajectories. The explicit time discretization of this system results into Tseng's forward-backward-forward algorithm with relaxation parameters, which we prove to converge also when it is applied to pseudo-monotone variational inequalities. In addition, we show that linear convergence is guaranteed under strong pseudo-monotonicity. Numerical experiments are carried out for pseudo-monotone variational inequalities over polyhedral sets and fractional programming problems.
Open AccessThe Forward-Backward-Forward Method from continuous and discrete perspective for pseudo-monotone variational inequalities in Hilbert spaces
Tseng's forward-backward-forward algorithm is a valuable alternative for Korpelevich's extragradient method when solving variational inequalities over a convex and closed set governed by monotone and Lipschitz continuous operators, as it requires in every step only one projection operation. However, it is well-known that Korpelevich's method converges and can therefore be used also for solving variational inequalities governed by pseudo-monotone and Lipschitz continuous operators. In this paper, we first associate to a pseudo-monotone variational inequality a forward-backward-forward dynamical system and carry out an asymptotic analysis for the generated trajectories. The explicit time discretization of this system results into Tseng's forward-backward-forward algorithm with relaxation parameters, which we prove to converge also when it is applied to pseudo-monotone variational inequalities. In addition, we show that linear convergence is guaranteed under strong pseudo-monotonicity. Numerical experiments are carried out for pseudo-monotone variational inequalities over polyhedral sets and fractional programming problems.
- Open Access
- 13 July 2020
- Published by Springer Nature in Set-Valued and Variational Analysis
- Vol. 28 (4) , 611-642
Continuous Dynamics Related to Monotone Inclusions and Non-Smooth Optimization Problems
- 13 July 2020
- Published by Springer Nature in Set-Valued and Variational Analysis
- Vol. 28 (4) , 611-642
Open AccessContinuous Dynamics Related to Monotone Inclusions and Non-Smooth Optimization Problems
- Top Cited PapersOpen Access
- 11 June 2020
- Published by Springer Nature in Mathematical Programming
- Vol. 189 (1-2) , 151-186
Tikhonov regularization of a second order dynamical system with Hessian driven damping
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.
- 11 June 2020
- Published by Springer Nature in Mathematical Programming
- Vol. 189 (1-2) , 151-186
Top Cited PapersOpen AccessTikhonov regularization of a second order dynamical system with Hessian driven damping
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.
- Open Access
- 14 May 2020
- Published by Springer Nature in Numerical Algorithms
- Vol. 86 (3) , 1303-1325
Fixing and extending some recent results on the ADMM algorithm
We investigate the techniques and ideas used in Shefi and Teboulle (SIAM J Optim 24(1), 269–297, 2014) in the convergence analysis of two proximal ADMM algorithms for solving convex optimization problems involving compositions with linear operators. Besides this, we formulate a variant of the ADMM algorithm that is able to handle convex optimization problems involving an additional smooth function in its objective, and which is evaluated through its gradient. Moreover, in each iteration, we allow the use of variable metrics, while the investigations are carried out in the setting of infinite-dimensional Hilbert spaces. This algorithmic scheme is investigated from the point of view of its convergence properties.
- 14 May 2020
- Published by Springer Nature in Numerical Algorithms
- Vol. 86 (3) , 1303-1325
Open AccessFixing and extending some recent results on the ADMM algorithm
We investigate the techniques and ideas used in Shefi and Teboulle (SIAM J Optim 24(1), 269–297, 2014) in the convergence analysis of two proximal ADMM algorithms for solving convex optimization problems involving compositions with linear operators. Besides this, we formulate a variant of the ADMM algorithm that is able to handle convex optimization problems involving an additional smooth function in its objective, and which is evaluated through its gradient. Moreover, in each iteration, we allow the use of variable metrics, while the investigations are carried out in the setting of infinite-dimensional Hilbert spaces. This algorithmic scheme is investigated from the point of view of its convergence properties.