Related papers: On proximal contractions via implicit relations an…

The proximinality of certain subspaces of spaces of bounded affine functions is proved. The results presented here are some linear versions of an old result due to Mazur. For the proofs we use some sandwich theorems of Fenchel's duality…

In this paper, we introduce two new types of enriched contractions, viz., enriched $\mathcal{A}$-contraction and enriched $\mathcal{A}'$-contraction. Then we obtain fixed points of mappings satisfying such contractions using the fixed point…

In this paper, we introduce a new class of implicit function to prove common fixed point theorems in fuzzy metric space. Moreover we define a new altering distance in terms of integral and utilize the same to deduce integral type…

Klee introduced the proximate fixed point property for compacta which is stronger than fixed point property. We consider relations between proximate fixed point property of spaces being result of application of different operations to…

We investigate a family of approximate multi-step proximal point methods, framed as implicit linear discretizations of gradient flow. The resulting methods are multi-step proximal point methods, with similar computational cost in each…

We first introduce a notion of convex structure in generalized metric spaces, then we introduce tripartite contractions, tripartite semi-contractions, tripartite coincidence points, as well as tripartite best proximity points for a given…

This paper proposes an accelerated proximal point method for maximally monotone operators. The proof is computer-assisted via the performance estimation problem approach. The proximal point method includes various well-known convex…

A $1$-Lipschitz map $f$ from a convex compact set to itself has fixed points. This consequence of Brouwer's or Schauder's fixed point theorem has more elementary proofs by approximating $f$ by $\lambda$-contractions, $f_\lambda$. We study…

In this paper we present the proximal point method for a special class of nonconvex function on a Hadamard manifold. The well definedness of the sequence generated by the proximal point method is guaranteed. Moreover, it is proved that each…

We find a priori and a posteriori error estimates of the best proximity point for the Picard iteration associated to a cyclic contraction map, which is defined on a uniformly convex Banach space with modulus of convexity of power type. We…

This paper deals with the approximation of discrete real-valued functions by first-degree splines (broken lines) with free knots for arbitrary $L_p$-norms ($1 \leq p \leq \infty)$. We prove the existence of best approximations und derive…

This work proposes an implementable proximal-type method for a broad class of optimization problems involving nonsmooth and nonconvex objective and constraint functions. In contrast to existing methods that rely on an ad hoc model…

Local convergence analysis of the proximal point method for special class of nonconvex function on Hadamard manifold is presented in this paper. The well definedness of the sequence generated by the proximal point method is guaranteed.…

Let $\f: X \ra Z$ be a proper surjective map from a smooth complex manifold $X$ onto a normal variety $Z$. If $\f$ has connected fibers and $-K_X$ is $\f$-ample then $\f$ is called a good contraction. In the present paper we study good…

Most of the implicit contractions introduced by Wardowski [Fixed Point Th. Appl., 2012, 2012:94] are Matkowski type contractions.

An order relation for contractions on a Hilbert space can be introduced by stating that $A\preccurlyeq B$ if and only $A$ is unitarily equivalent to the restriction of $B$ to an invariant subspace. We discuss the equivalence classes…

Employing the ideas of non-linear preconditioning and testing of the classical proximal point method, we formalise common arguments in convergence rate and convergence proofs of optimisation methods to the verification of a simple…

We revise our "Physical Traces" paper in the light of the results in "A Categorical Semantics of Quantum Protocols". The key fact is that the notion of a strongly compact closed category allows abstract notions of adjoint, bipartite…

Structured convex optimization problems typically involve a mix of smooth and nonsmooth functions. The common practice is to activate the smooth functions via their gradient and the nonsmooth ones via their proximity operator. We show that,…

The Peaceman-Rachford splitting method is efficient for minimizing a convex optimization problem with a separable objective function and linear constraints. However, its convergence was not guaranteed without extra requirements. He {\it et…