Related papers: The Forward-Backward-Forward Method from continuou…
We analyze backward step control globalization for finding zeros of G\^ateaux-differentiable functions that map from a Banach space to a Hilbert space. The results include global convergence to a distinctive solution characterized by…
Composite optimization problems, where the sum of a smooth and a merely lower semicontinuous function has to be minimized, are often tackled numerically by means of proximal gradient methods as soon as the lower semicontinuous part of the…
We address the problem of finding the zeros of the sum of a maximally monotone operator and a cocoercive operator. Our approach introduces a modification to the forward-backward method by integrating an inertial/momentum term alongside a…
Let $Q$ be a nonempty closed and convex subset of a real Hilbert space $% \mathcal{H}$. $T:Q\rightarrow Q$ is a nonexpansive mapping which has a least one fixed point. $f:Q\rightarrow \mathcal{H}$ is a Lipschitzian function, and $%…
We present a forward-backward-based algorithm to minimize a sum of a differentiable function and a nonsmooth function, both being possibly nonconvex. The main contribution of this work is to consider the challenging case where the nonsmooth…
This work is concerned with the classical problem of finding a zero of a sum of maximal monotone operators. For the projective splitting framework recently proposed by Combettes and Eckstein, we show how to replace the fundamental…
We present and prove a Newton-Kantorovitch method for solving decoupled forward-backward stochastic differential equations (FBSDEs) involving smooth coefficients with uniformly bounded derivatives. As Newton's method is required a suitable…
The recently introduced backward Monte-Carlo method [Johan Carlsson, arXiv:math.NA/0010118] is validated, benchmarked, and compared to the conventional, forward Monte-Carlo method by analyzing the error in the Monte-Carlo solutions to a…
We propose a forward-backward splitting algorithm based on Bregman distances for composite minimization problems in general reflexive Banach spaces. The convergence is established using the notion of variable quasi-Bregman monotone…
In this paper we provide a splitting algorithm for solving coupled monotone inclusions in a real Hilbert space involving the sum of a normal cone to a vector subspace, a maximally monotone, a monotone-Lipschitzian, and a cocoercive…
This paper is devoted to the variational inequality problems. We consider two classes of problems, the first is classical constrained variational inequality and the second is the same problem with functional (inequality type) constraints.…
This work concerns about forward-backward multivalued stochastic systems. First of all, we prove one average principle for general stochastic differential equations in the $L^{2p}$ ($p\geq 1$) sense. Moreover, for $p=1$ a convergence rate…
In this paper, we propose an inertial forward backward splitting algorithm to compute a zero of the sum of two monotone operators, with one of the two operators being co-coercive. The algorithm is inspired by the accelerated gradient method…
The nonlinear, or warped, resolvent recently explored by Giselsson and B\`ui-Combettes has been used to model a large set of existing and new monotone inclusion algorithms. To establish convergent algorithms based on these resolvents,…
Many recently proposed gradient projection algorithms with inertial extrapolation step for solving quasi-variational inequalities in Hilbert spaces are proven to be strongly convergent with no linear rate given when the cost operator is…
This paper presents an improved forward-backward splitting algorithm with two inertial parameters. It aims to find a point in the real Hilbert space at which the sum of a co-coercive operator and a maximal monotone operator vanishes. Under…
Mond and Pecaric introduced a method to simplify the determination of complementary inequalities for Jensen's inequality by converting it into a single-variable maximization or minimization problem of continuous functions. This principle…
We present a general technique for the analysis of first-order methods. The technique relies on the construction of a duality gap for an appropriate approximation of the objective function, where the function approximation improves as the…
We propose stochastic variance reduced algorithms for solving convex-concave saddle point problems, monotone variational inequalities, and monotone inclusions. Our framework applies to extragradient, forward-backward-forward, and…
This study develops a fixed-time convergent saddle point dynamical system for solving min-max problems under a relaxation of standard convexity-concavity assumption. In particular, it is shown that by leveraging the dynamical systems…