Second Order Forward-Backward Dynamical Systems For Monotone Inclusion Problems

نویسندگان

  • Radu Ioan Bot
  • Ernö Robert Csetnek
چکیده

We begin by considering second order dynamical systems of the from ẍ(t) + Γ(ẋ(t)) + λ(t)B(x(t)) = 0, where Γ : H → H is an elliptic bounded self-adjoint linear operator defined on a real Hilbert space H, B : H → H is a cocoercive operator and λ : [0,+∞)→ [0,+∞) is a relaxation function depending on time. We show the existence and uniqueness of strong global solutions in the framework of the Cauchy-Lipschitz-Picard Theorem and prove weak convergence for the generated trajectories to a zero of the operator B, by using Lyapunov analysis combined with the celebrated Opial Lemma in its continuous version. The framework allows to address from similar perspectives second order dynamical systems associated with the problem of finding zeros of the sum of a maximally monotone operator and a cocoercive one. This captures as particular case the minimization of the sum of a nonsmooth convex function with a smooth convex one and allows us to recover and improve several results from the literature concerning the minimization of a convex smooth function subject to a convex closed set by means of second order dynamical systems. When considering the unconstrained minimization of a smooth convex function we prove a rate of O(1/t) for the convergence of the function value along the ergodic trajectory to its minimum value. A similar analysis is carried out also for second order dynamical systems having as first order term γ(t)ẋ(t), where γ : [0,+∞)→ [0,+∞) is a damping function depending on time.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamical Behavior of a Stochastic Forward-Backward Algorithm Using Random Monotone Operators

The purpose of this paper is to study the dynamical behavior of the sequence produced by a forward-backward algorithm, involving two random maximal monotone operators and a sequence of decreasing step sizes. Defining a mean monotone operator as an Aumann integral, and assuming that the sum of the two mean operators is maximal (sufficient maximality conditions are provided), it is shown that wit...

متن کامل

Convergence rates for forward-backward dynamical systems associated with strongly monotone inclusions

We investigate the convergence rates of the trajectories generated by implicit first and second order dynamical systems associated to the determination of the zeros of the sum of a maximally monotone operator and a monotone and Lipschitz continuous one in a real Hilbert space. We show that these trajectories strongly converge with exponential rate to a zero of the sum, provided the latter is st...

متن کامل

Backward-forward Algorithms for Structured Monotone Inclusions in Hilbert Spaces

In this paper, we study the backward-forward algorithm as a splitting method to solve structured monotone inclusions, and convex minimization problems in Hilbert spaces. It has a natural link with the forward-backward algorithm and has the same computational complexity, since it involves the same basic blocks, but organized differently. Surprisingly enough, this kind of iteration arises when st...

متن کامل

Forward-Backward and Tseng’s Type Penalty Schemes for Monotone Inclusion Problems

We deal with monotone inclusion problems of the form 0 ∈ Ax+Dx+NC(x) in real Hilbert spaces, where A is a maximally monotone operator, D a cocoercive operator and C the nonempty set of zeros of another cocoercive operator. We propose a forwardbackward penalty algorithm for solving this problem which extends the one proposed by H. Attouch, M.-O. Czarnecki and J. Peypouquet in [3]. The condition ...

متن کامل

Almost sure convergence of the forward-backward-forward splitting algorithm

In this paper, we propose a stochastic forward–backward–forward splitting algorithm and prove its almost sure weak convergence in real separable Hilbert spaces. Applications to composite monotone inclusion andminimization problems are demonstrated.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Control and Optimization

دوره 54  شماره 

صفحات  -

تاریخ انتشار 2016