Related papers: Optimal approximate fixed point results in locally…
In this paper, we prove the following theorem: Let {T(t) : t >= 0} be a one-parameter continuous semigroup of mappings on a subset C of a Banach space E. The set of fixed points of T(t) is denoted by F(T(t)) for each t >= 0. Then cap_{t >=…
Our contribution in this paper is two folded. We consider first the case of linear programming with real coefficients and give a method which allows the computation of a new upper bound on the distance from the origin to a feasible point.…
We consider vector lattices endowed with locally solid convergence structures, which are not necessarily topological. We show that such a convergence is defined by the convergence to $0$ on the positive cone. Some results on unbounded…
A planar point set is in convex position precisely when it has a convex polygonization, that is, a polygonization with maximum interior angle measure at most \pi. We can thus talk about the convexity of a set of points in terms of the…
For an extended locally convex space $(X,\tau)$, in [8], the authors studied the finest locally convex topology (flc topology) $\tau_F$ on $X$ coarser than $\tau$. One can often prove facts about $(X, \tau)$ by applying classical locally…
In this paper, we present a local convergence analysis of the self-consistent field (SCF) iteration using the density matrix as the state of a fixed-point iteration. Sufficient and almost necessary conditions for local convergence are…
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…
Matrix completion is a basic machine learning problem that has wide applications, especially in collaborative filtering and recommender systems. Simple non-convex optimization algorithms are popular and effective in practice. Despite recent…
In many cases the convexity of the image of a linear map with range is $R^n$ is automatic because of the facial structure of the domain of the map. We develop a four step procedure for proving this kind of ``automatic convexity''. To make…
We prove a boundary version of the open mapping theorem for holomorphic maps between strongly pseudoconvex domains. That is, we prove that the local image of a holomorphic map $f:D\to D'$ close to a boundary regular contact point $p\in \de…
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 study the localization of sets with constant nonlocal mean curvature and prescribed small volume in a bounded open set with smooth boundary, proving that they are {\em sufficiently close} to critical points of a suitable non-local…
We study the existence of fixed points for continuous maps $f$ from an $n$-ball $X$ in $\mathbb R^n$ to $\mathbb R^n$ with $n\geq 1$. We show that $f$ has a fixed point if, for some absolute retract $Y\subset\partial X$, $f(Y)\subset X$ and…
This paper presents smoothing schemes for obtaining approximate stationary points of unconstrained or linearly-constrained composite nonconvex-concave min-max (and hence nonsmooth) problems by applying well-known algorithms to composite…
In this article we introduce a new type of cyclic contraction mapping on a pair of subsets of a metric space with a graph and prove best proximity points results for the same. Also, we demonstrate that the number of such points is same with…
A parametric version of Brouwer's Fixed Point Theorem, which is proven using the fixed-point index, states that for every continuous mapping $f : (X \times Y) \to Y$, where $X$ is nonempty, compact, and connected subset of a Hausdorff…
Gromov showed that for fixed, arbitrarily large C, any uniformly C-Lipschitz affine action of a random group in his graph model on a Hilbert space has a fixed point. We announce a theorem stating that more general affine actions of the same…
There are several notions of a smooth map from a convex set to a cartesian space. Some of these notions coincide, but not all of them do. We construct a real-valued function on a convex subset of the plane that does not extend to a smooth…
We prove that every continuous mapping from a separable infinite-dimensional Hilbert space $X$ into $\mathbb{R}^{m}$ can be uniformly approximated by $C^\infty$ smooth mappings {\em with no critical points}. This kind of result can be…
A new exact projective penalty method is proposed for the equivalent reduction of constrained optimization problems to nonsmooth unconstrained ones. In the method, the original objective function is extended to infeasible points by summing…