Dynamical systems and forward-backward algorithms associated with the sum of a convex subdifferential and a monotone cocoercive operator
Authors:
- Boushra AbbasBABoushra Abbas
- Hedy AttouchHAHedy Attouch
Preprint
Abstract
In a Hilbert framework, we introduce continuous and discrete dynamical systems which aim at solving inclusions governed by structured monotone operators $A=\partial\Phi+B$, where $\partial\Phi$ is the subdifferential of a convex lower semicontinuous function $\Phi$, and $B$ is a monotone cocoercive operator. We first consider the extension to this setting of the regularized Newton dynamic with two potentials. Then, we revisit some related dynamical systems, namely the semigroup of contractions generated by $A$, and the continuous gradient projection dynamic. By a Lyapunov analysis, we show the convergence properties of the orbits of these systems. The time discretization of these dynamics gives various forward-backward splitting methods (some new) for solving structured monotone inclusions involving non-potential terms. The convergence of these algorithms is obtained under classical step size limitation. Perspectives are given in the field of numerical splitting methods for optimization, and multi-criteria decision processes.
Keywords
All Related Versions
This publication has 33 references indexed in Scilit:
- Newton-Like Dynamics and Forward-Backward Methods for Structured Monotone Inclusions in Hilbert SpacesJournal of Optimization Theory and Applications, 2013
- Global Convergence of a Closed-Loop Regularized Newton Method for Solving Monotone Inclusions in Hilbert SpacesJournal of Optimization Theory and Applications, 2012
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward–backward splitting, and regularized Gauss–Seidel methodsMathematical Programming, 2011
- Stable signal recovery from incomplete and inaccurate measurementsCommunications on Pure and Applied Mathematics, 2006
- Introductory Lectures on Convex Optimization2004
- A Convergence Result for Nonautonomous Subgradient Evolution Equations and Its Application to the Steepest Descent Exponential Penalty Trajectory in Linear ProgrammingJournal of Functional Analysis, 2001
- A Dynamical Approach to Convex Minimization Coupling Approximation with the Steepest Descent MethodJournal of Differential Equations, 1996
- A proximal-based decomposition method for convex minimization problemsMathematical Programming, 1994
- Further applications of a splitting algorithm to decomposition in variational inequalities and convex programmingMathematical Programming, 1990
- Asymptotic convergence of nonlinear contraction semigroups in Hilbert spaceJournal of Functional Analysis, 1975