Related papers: Best Proximity Point Results for Perimetric Contra…
Succinct representations of a graph have been objects of central study in computer science for decades. In this paper, we study the operation called \emph{Distance Preserving Graph Contractions}, which was introduced by Bernstein et al.…
Given two disjoint convex polyhedra, we look for a best approximation pair relative to them, i.e., a pair of points, one in each polyhedron, attaining the minimum distance between the sets. Cheney and Goldstein showed that alternating…
Further extensions are given to the fixed point result (for implicit contractions) due to Altun and Simsek [Fixed Point Th. Appl., Volume 2010, Article ID 621469]. Some connections with related statements in the area due to Agarwal,…
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…
In this paper, we prove two lower bounds for the maximum matching size in an arbitrary undirected graph. Despite their simplicity, these results are not widely known. This article aims to bring pleasure to the reader by giving short…
We consider sequences $(B_k)_{k=0}^\infty$ of points obtained by projecting back and forth between two manifolds $\M_1$ and $\M_2$, and give conditions guaranteeing that the sequence converge to a limit $B_\infty\in\M_1\cap\M_2$. Our…
We introduce twisted permutation codes, which are frequency permutation arrays analogous to repetition permutation codes, namely, codes obtained from the repetition construction applied to a permutation code. In particular, we show that a…
In this paper, the notion of $\mathbb{C}$-simulation function is introduced and the existence and uniqueness of common fixed points of two self-mappings satisfying contractive conditions in the setting of complex valued metric spaces via…
We introduce and study a new type of mappings in metric spaces termed $n$-point Kannan-type mappings. A fixed-point theorem is proved for these mappings. In general case such mappings are discontinuous in the domain but necessarily…
This paper proposes new proximal Newton-type methods with a diagonal metric for solving composite optimization problems whose objective function is the sum of a twice continuously differentiable function and a proper closed directionally…
We consider a new type of mappings in metric spaces so-called mappings contracting total pairwise distance on $n$ points. It is shown that such mappings are continuous. A theorem on the existence of periodic points for such mappings is…
We provide a framework for computing the exact worst-case performance of any algorithm belonging to a broad class of oracle-based first-order methods for composite convex optimization, including those performing explicit, projected,…
We propose upper and lower bounds on the maximum success probability for discriminating given quantum states. The proposed upper bound is obtained from a suboptimal solution to the dual problem of the corresponding optimal state…
In this paper, we propose new proximal Newton-type methods for convex optimization problems in composite form. The applications include model predictive control (MPC) and embedded MPC. Our new methods are computationally attractive since…
In this paper we establish the existence of related fixed points theorems for two pairs of mappings with different contraction conditions in two fuzzy metric spaces.
We establish fixed point theorems for nonlinear contractions on a metric space (not essentially complete) endowed with an arbitrary binary relation. Our results extend, generalize, modify and unify several known results especially those…
This paper investigates asymptotic fixed point results for nonlinear contractions, with emphasis on Kirk-type theorems and their generalizations. A central difficulty in the literature has been the requirement that the mapping possesses a…
In this paper, we study the existence of fixed points for mappings defined on complete (compact) metric space (X, d) satisfying a general contractive (contraction) inequality depended on another function. These conditions are analogous to…
In this paper, we propose new accelerated methods for smooth convex optimization, called contracting proximal methods. At every step of these methods, we need to minimize a contracted version of the objective function augmented by a…
We establish a simple and powerful lemma that provides a criterion for sequences in metric spaces to be Cauchy. Using the lemma, it is then easily verified that the Picard iterates $\{T^nx\}$, where $T$ is a contraction or asymptotic…