Related papers: On proximal contractions via implicit relations an…
Cyclic contractions generalize the usual contractivities in metric spaces and $b$-MSs. In this paper, we enhance several fixed point theorems related to cyclic (i) Banach self-maps, (ii) Chatterjea contractivities, (iii) Kannan…
For two nonempty, closed, bounded and convex subsets $A$ and $B$ of a uniformly convex Banach space $X$ consider a mapping $T:(A \times B) \cup (B \times A) \rightarrow A \cup B$ satisfying $T(A,B) \subset B$ and $T(B, A) \subset A$. In…
Optimization methods have been broadly applied to two classes of objects viz. (i) modeling and description of data and (ii) the determination of the stationary points of functions. Here, a theoretical basis is developed that optimizes an…
In this paper we present a method for constructing the continuous best fractal approximation in the space of bounded functions. We construct the finite-dimensional subspace of the space of bounded functions whose base consists of the…
In a recent paper we have proposed the possibility that the lightest massive string states could be identified with open strings living at intersections of D-branes forming small angles. In this note, we reconsider the relevant twist-field…
We present a new approach to approximate nearest-neighbor queries in fixed dimension under a variety of non-Euclidean distances. We are given a set $S$ of $n$ points in $\mathbb{R}^d$, an approximation parameter $\varepsilon > 0$, and a…
By studying $\mathbb{A}^1$-curves on varieties, we propose a geometric approach to strong approximation problem over function fields of complex curves. We prove that strong approximation holds for smooth, low degree affine complete…
Convex nonsmooth optimization problems, whose solutions live in very high dimensional spaces, have become ubiquitous. To solve them, the class of first-order algorithms known as proximal splitting algorithms is particularly adequate: they…
In this short note we develop a constitutive relation that is linear in both the Cauchy stress and the linearized strain, by linearizing implicit constitutive relations between the stress and the deformation gradient that have been put into…
We consider the problem of optimizing the sum of a smooth convex function and a non-smooth convex function using proximal-gradient methods, where an error is present in the calculation of the gradient of the smooth term or in the proximity…
We derive strong variance-based uncertainty relations for arbitrary two and more unitary operators by re-examining the mathematical foundation of the uncertainty relation. This is achieved by strengthening the celebrated Cauchy-Schwarz…
In this paper we propose an adaptively extrapolated proximal gradient method, which is based on the accelerated proximal gradient method (also known as FISTA), however we locally optimize the extrapolation parameter by carrying out an exact…
Proximal point algorithm has found many applications, and it has been playing fundamental roles in the understanding, design, and analysis of many first-order methods. In this paper, we derive the tight convergence rate in subgradient norm…
We study the effect of edge contractions on simplicial homology because these contractions have turned to be useful in various applications involving topology. It was observed previously that contracting edges that satisfy the so called…
We study weak approximation on rationally connected varieties under an assumption of strong approximation for a "simple" variety or under Schinzel's hypothesis. We also get some unconditional results.
Using twisted Fock spaces, we formulate and study two twisted versions of the n-point correlation functions of Bloch-Okounkov, and then identify them with q-expectation values of certain functions on the set of (odd) strict partitions. We…
We analyze worst-case convergence guarantees of first-order optimization methods over a function class extending that of smooth and convex functions. This class contains convex functions that admit a simple quadratic upper bound. Its study…
We consider convex trace functions $\Phi_{p,q,s} = Trace[ (A^{q/2}B^p A^{q/2})^s]$ where $A$ and $B$ are positive $n\times n$ matrices and ask when these functions are convex or concave. We also consider operator convexity/concavity of…
In this paper we indicate a way to generalize a series of fixed point results in the framework of b-metric spaces and we exemplify it by extending Nadler's contraction principle for set-valued functions (see Multi-valued contraction…
We develop two generalizations of contraction theory, namely, semi-contraction and weak-contraction theory. First, using the notion of semi-norm, we propose a geometric framework for semi-contraction theory. We introduce matrix…