Related papers: Computing a Fixed Point of Contraction Maps in Pol…
The design of fixed point algorithms is at the heart of monotone operator theory, convex analysis, and of many modern optimization problems arising in machine learning and control. This tutorial reviews recent advances in understanding the…
We develop fixed-point algorithms for the approximation of structured matrices with rank penalties. In particular we use these fixed-point algorithms for making approximations by sums of exponentials, or frequency estimation. For the basic…
In this paper, we study the existence of fixed points for mappings defined on complete, (sequentially compact) cone metric spaces, satisfying a general contractive inequality depending of two additional mappings.
We study the convergence analysis of a Picard-S iteration method for a particular class of weak-contraction mappings. Furthermore, we prove a data dependence result for fixed point of the class of weak-contraction mappings with the help of…
We study the problem of {\sl certification}: given queries to a function $f : \{0,1\}^n \to \{0,1\}$ with certificate complexity $\le k$ and an input $x^\star$, output a size-$k$ certificate for $f$'s value on $x^\star$. This abstractly…
In this article, we prove the existence of common fixed points for a pair of maps on a $q$-spherically complete $T_0$-ultra-quasi-metric space. The present article is a generalization, in the assymmetric setting of the paper of Rao et…
Fixed points for uniformly local asymptotic nonexpansive maps are discussed in this article. An approximate fixed point sequence for such a map over a uniformly convex Banach space is derived. At the end, we study the unique fixed point for…
We show that approximating the trace norm contraction coefficient of a quantum channel within a constant factor is NP-hard. Equivalently, this shows that determining the optimal success probability for encoding a bit in a quantum system…
It is well-known that given a bounded, smooth nonconvex function, standard gradient-based methods can find $\epsilon$-stationary points (where the gradient norm is less than $\epsilon$) in $\mathcal{O}(1/\epsilon^2)$ iterations. However,…
Given a closed, oriented surface, possibly with boundary, and a mapping class, we obtain sharp lower bounds on the number of fixed points of a surface symplectomorphism (i.e. area-preserving map) in the given mapping class, both with and…
With the inflation of the data, clustering analysis, as a branch of unsupervised learning, lacks unified understanding and application of its mathematical law. Based on the view of fixed point, this paper restates the model-based clustering…
Clustering with capacity constraints is a fundamental problem that attracted significant attention throughout the years. In this paper, we give the first FPT constant-factor approximation algorithm for the problem of clustering points in a…
As first-order optimization methods become the method of choice for solving large-scale optimization problems, optimization solvers based on first-order algorithms are being built. Such general-purpose solvers must robustly detect…
While first-order stationary points (FOSPs) are the traditional targets of non-convex optimization, they often correspond to undesirable strict saddle points. To circumvent this, attention has shifted towards second-order stationary points…
For a collection $\mathcal{F}$ of graphs, the $\mathcal{F}$-\textsc{Contraction} problem takes a graph $G$ and an integer $k$ as input and decides if $G$ can be modified to some graph in $\mathcal{F}$ using at most $k$ edge contractions.…
This paper introduce a new class of operators and contraction mapping for a cyclical map T on G-metric spaces and the approximately fixed point properties. Also,we prove two general lemmas regarding approximate fixed Point of cyclical…
In this paper we consider the problem of finding $\epsilon$-approximate stationary points of convex functions that are $p$-times differentiable with $\nu$-H\"{o}lder continuous $p$th derivatives. We present tensor methods with and without…
In this paper, we present some fixed point results for generalized $\theta -\phi -$contraction in the framework of $\left( \alpha ,\eta \right)-$compete rectangular $b-$metric spaces. Further, we establish some fixed point theorems for this…
The paper presents two edge grouping algorithms for finding a closed contour starting from a particular edge point and enclosing a fixation point. Both algorithms search a shortest simple cycle in \textit{an angularly ordered graph} derived…
We present a method for computing the topological entropy of one-dimensional maps. As an approximation scheme, the algorithm converges rapidly and provides both upper and lower bounds.