Newton-like Inertial Dynamics and Proximal Algorithms Governed by Maximally Monotone Operators
نویسندگان
چکیده
منابع مشابه
Inexact Inertial Proximal Algorithm for Maximal Monotone Operators
In this paper, convergence of the sequence generated by the inexact form of the inertial proximal algorithm is studied. This algorithm which is obtained by the discretization of a nonlinear oscillator with damping dynamical system, has been introduced by Alvarez and Attouch (2001) and Jules and Maingé (2002) for the approximation of a zero of a maximal monotone operator. We establish weak and s...
متن کاملCommon Zero Points of Two Finite Families of Maximal Monotone Operators via Proximal Point Algorithms
In this work, it is presented iterative schemes for achieving to common points of the solutions set of the system of generalized mixed equilibrium problems, solutions set of the variational inequality for an inverse-strongly monotone operator, common fixed points set of two infinite sequences of relatively nonexpansive mappings and common zero points set of two finite sequences of maximal monot...
متن کاملIterative Algorithms for Variational Inequalities Governed by Boundedly Lipschitzian and Strongly Monotone Operators
Consider the variational inequality V I(C, F ) of finding a point x∗ ∈ C satisfying the property 〈Fx∗, x − x∗〉 ≥ 0 for all x ∈ C, where C is a nonempty closed convex subset of a real Hilbert space H and F : C → H is a nonlinear mapping. If F is boundedly Lipschitzian and strongly monotone, then we prove that V I(C, F ) has a unique solution and iterative algorithms can be devised to approximate...
متن کاملSecond-order differential equations on R+ governed by monotone operators
Consider in a real Hilbert space H the differential equation (E) : p(t)u′′(t) + q(t)u′(t) ∈ Au(t) + f(t), for a.a. t ∈ R+ = [0,∞), with the condition u(0) = x ∈ D(A), where A : D(A) ⊂ H → H is a maximal monotone operator, with [0, 0] ∈ A (or, more generally, 0 ∈ R(A)); p, q ∈ L∞(R+), with ess inf p > 0 and either ess inf q > 0 or ess sup q < 0; and f : R+ → H is a given function. Recall that eq...
متن کاملSum theorems for maximally monotone operators of type (FPV)
The most important open problem in Monotone Operator Theory concerns the maximal monotonicity of the sum of two maximally monotone operators provided that the classical Rockafellar’s constraint qualification holds. In this paper, we establish the maximal monotonicity of A+ B provided that A and B are maximally monotone operators such that star(domA)∩ int domB 6= ∅, and A is of type (FPV). We sh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2020
ISSN: 1052-6234,1095-7189
DOI: 10.1137/20m1333316