Related papers: Feasibility problems via paramonotone operators in…
We study uniform $\epsilon-$BPB approximations of bounded linear operators between Banach spaces from a geometric perspective. We show that for sufficiently small positive values of $\epsilon,$ many geometric properties like smoothness,…
We study the fixed point problem for a system of multivariate operators that are coordinate-wise monotone (i.e., nondecreasing or nonincreasing in each of the variables, independently), in the setting of quasi-ordered sets. We show that…
In this paper we focus on different -- global, semi-local and local -- versions of Hoffman type inequalities expressed in a variational form. In a first stage our analysis is developed for generic multifunctions between metric spaces and we…
In this paper we study variational inequalities in a real Hilbert space, which are governed by a strongly monotone and Lipschitz continuous operator $F$ over a closed and convex set $C$. We assume that the set $C$ can be outerly…
The aim of this paper is to establish strong convergence theorems for a strongly relatively nonexpansive sequence in a smooth and uniformly convex Banach space. Then we employ our results to approximate solutions of the zero point problem…
Fitzpatrick's variational representation of maximal monotone operators is here extended to a class of pseudo-monotone operators in Banach spaces. On this basis, the initial-value problem associated with the first-order flow of such an…
In this paper, we report on new results related to the existence of an adjoint for operators on separable Banach spaces and discuss a few interesting applications. (Some results are new even for Hilbert spaces.) Our first two applications…
We introduce a framework based on Rockafellar's perturbation theory to analyze and solve general nonsmooth convex minimization and monotone inclusion problems involving nonlinearly composed functions as well as linear compositions. Such…
We investigate linear parabolic, second-order boundary value problems with mixed boundary conditions on rough domains. Assuming only boundedness and ellipticity on the coefficient function and very mild conditions on the geometry of the…
We study the computational difficulty of the problem of finding fixed points of nonexpansive mappings in uniformly convex Banach spaces. We show that the fixed point sets of computable nonexpansive self-maps of a nonempty, computably weakly…
Convergence of a projected stochastic gradient algorithm is demonstrated for convex objective functionals with convex constraint sets in Hilbert spaces. In the convex case, the sequence of iterates ${u_n}$ converges weakly to a point in the…
We consider the problem of minimizing convex combinations of the first two eigenvalues of the Dirichlet-Laplacian among open sets of $R^N$ of fixed measure. We show that, by purely elementary arguments, based on the minimality condition, it…
In this paper convex optimization techniques are employed for convex optimization problems in infinite dimensional Hilbert spaces. A first order optimality condition is given. Let $f : \mathbb{R}^{n}\rightarrow \mathbb{R}$ and let $x\in…
Maximal monotone operators on a Banach space into its dual can be represented by convex functions bounded below by the duality product. It is natural to ask under which conditions a convex function represents a maximal monotone operator. A…
We introduce and study a new class of nonlinear monotone operators acting in normal cones of real Banach spaces and possessing the property of strong concavity. We establish new constructive principles for the existence of nonzero fixed…
The standard algorithms for solving large-scale convex-concave saddle point problems, or, more generally, variational inequalities with monotone operators, are proximal type algorithms which at every iteration need to compute a…
This paper studies simple bilevel problems, where a convex upper-level function is minimized over the optimal solutions of a convex lower-level problem. We first show the fundamental difficulty of simple bilevel problems, that the…
For those acquainted with CVX (aka disciplined convex programming) of M. Grant and S. Boyd, the motivation of this work is the desire to extend the scope of CVX beyond convex minimization -- to convex-concave saddle point problems and…
The geometry conjecture, which was posed nearly a quarter of a century ago, states that the fixed point set of the composition of projectors onto nonempty closed convex sets in Hilbert space is actually equal to the intersection of certain…
We investigate the convergence properties of exact and inexact forward-backward algorithms to minimise the sum of two weakly convex functions defined on a Hilbert space, where one has a Lipschitz-continuous gradient. We show that the exact…