相关论文: Convergence of Two Simple Methods for Solving Mono…
We consider the convergence behavior using the relaxed Peaceman-Rachford splitting method to solve the monotone inclusion problem $0 \in (A + B)(u)$, where $A, B: \Re^n \rightrightarrows \Re^n$ are maximal $\beta$-strongly monotone…
Learning methods in Banach spaces are often formulated as regularization problems which minimize the sum of a data fidelity term in a Banach norm and a regularization term in another Banach norm. Due to the infinite dimensional nature of…
We characterize the solution of a broad class of convex optimization problems that address the reconstruction of a function from a finite number of linear measurements. The underlying hypothesis is that the solution is decomposable as a…
We present a novel notion of $\lambda$-monotonicity for an $n$-species system of partial differential equations governed by mass-preserving flow dynamics, extending monotonicity in Banach spaces to the Wasserstein-2 metric space. We show…
In this paper, we introduce a novel two-point gradient method for solving the ill-posed problems in Banach spaces and study its convergence analysis. The method is based on the well known iteratively regularized Landweber iteration method…
In this work, we develop a variant of a bundle method in order to find a zero of a maximal monotone operator. This algorithm relies on two polyhedral approximations of the epsilon-enlargement of the considered operator, via a systematic use…
This paper is concerned with some new projection methods for solving variational inequality problems with monotone and Lipschitz-continuous mapping in Hilbert space. First, we propose the projected reflected gradient algorithm with a…
The method of compatible sequences is introduced in order to produce non-trivial (closed) invariant subspaces of (bounded linear) operators. Also a topological tool is used which is new in the search of invariant subspaces: the extraction…
In this survey paper we present known results about reflexive subspace lattices. We show that every nest and every atomic Boolean subspace lattice in a complex Banach space is reflexive, even strongly reflexive. Our main tool is Ringrose's…
Finding a zero of the sum of two monotone operators is one of the most important problems in monotone operator theory, and the forward-backward algorithm is the most prominent approach for solving this type of problem. The aim of this paper…
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…
In this paper we provide a splitting method for finding a zero of the sum of a maximally monotone operator, a lipschitzian monotone operator, and a normal cone to a closed vectorial subspace of a real Hilbert space. The problem is…
In this article, we study the convergence of algorithms for solving monotone inclusions in the presence of adjoint mismatch. The adjoint mismatch arises when the adjoint of a linear operator is replaced by an approximation, due to…
In this paper we propose a resolvent splitting with minimal lifting for finding a zero of the sum of $n\ge 2$ maximally monotone operators involving the composition with a linear bounded operator. The resolvent of each monotone operator,…
In this paper, we prove the equivalence of reflexive Banach spaces and those Banach spaces which satisfy the following form of Bernstein's Lethargy Theorem. Let $X$ be an arbitrary infinite-dimensional Banach space, and let the real-valued…
Given a Banach space. We show that its three times dual space can be written as a direct sum. Then being one of the sumands null is a necessary and sufficient condition for the dual space to be reflexive. We end with an application of this…
We introduce a generalized forward-backward splitting method with penalty term for solving monotone inclusion problems involving the sum of a finite number of maximally monotone operators and the normal cone to the nonempty set of zeros of…
In this paper we present an inexact zeroth-order method suitable for the solution nonsmooth and nonconvex stochastic composite optimization problems, in which the objective is split into a real-valued Lipschitz continuous stochastic…
This article analyses the simple projection method proposed by Izuchukwu et al. [8, Algorithm 3.2] for solving variational inequality problems by incorporating momentum terms. A new step size strategy is also introduced, in which the step…
This article introduces an innovative mathematical framework designed to tackle non-linear convex variational problems in reflexive Banach spaces. Our approach employs a versatile technique that can handle a broad range of variational…