Related papers: Characterizing arbitrarily slow convergence in the…
In this paper we study the convergence of an iterative algorithm for finding zeros with constraints for not necessarily monotone set-valued operators in a reflexive Banach space. This algorithm, which we call the proximal-projection method…
In the special theory of relativity, Lorentz invariance is extended in Minkowski spacetime from ideal inertial observers to actual observers by means of the hypothesis of locality, which postulates that accelerated observers are always…
Shape-constrained inference has wide applicability in bioassay, medicine, economics, risk assessment, and many other fields. Although there has been a large amount of work on monotone-constrained univariate curve estimation, multivariate…
A finite dimensional abstract approximation and convergence theory is developed for estimation of the distribution of random parameters in infinite dimensional discrete time linear systems with dynamics described by regularly dissipative…
In the topological dynamical system $(X,T)$, a point $x$ simultaneously approximates a point $y$ if there exists a sequence $n_1$, $n_2$, ... of natural numbers for which $T^{n_i} x$, $T^{2n_i}x$, ..., $T^{k n_i} x$ all tend to $y$. In…
The higher-order orthogonal iteration (HOOI) and the alternating subspace iteration (ASI) are two popular numerical methods for computing the Tucker decomposition of a multiple-mode tensor. Xu [Linear and Multilinear Algebra,…
We consider (stochastic) subgradient methods for strongly convex but potentially nonsmooth non-Lipschitz optimization. We provide new equivalent dual descriptions (in the style of dual averaging) for the classic subgradient method, the…
In 1971 I announced what I described as a nice proof of Tychonoff's Theorem, an immediate corollary of a result concerning closed projections combined with Mrowka's characterization of compactness: a space X is compact if and only if for…
The alternating least squares algorithm for CP and Tucker decomposition is dominated in cost by the tensor contractions necessary to set up the quadratic optimization subproblems. We introduce a novel family of algorithms that uses…
We study the usage of regularity properties of collections of sets in convergence analysis of alternating projection methods for solving feasibility problems. Several equivalent characterizations of these properties are provided. Two…
In the framework of abstract linear inverse problems in infinitedimensional Hilbert space we discuss generic convergence behaviours of approximate solutions determined by means of general projection methods, namely outside the standard…
We demonstrate three properties conjectured to hold for a certain function by Levin (2025) in a study of the blimpy graphical shape of the number of bit strings with a given score under an interesting scoring system. The properties include…
We consider a stochastic version of the proximal point algorithm for optimization problems posed on a Hilbert space. A typical application of this is supervised learning. While the method is not new, it has not been extensively analyzed in…
We give a simple, short and self-contained presentation of Bourgain's discretised projection theorem from 2010, which is a fundamental tool in many recent breakthroughs in geometric measure theory, harmonic analysis, and homogeneous…
Recently there were proposed some innovative convex optimization concepts, namely, relative smoothness [1] and relative strong convexity [2,3]. These approaches have significantly expanded the class of applicability of gradient-type methods…
Many problems in science and engineering involve, as part of their solution process, the consideration of a separable function which is the sum of two convex functions, one of them possibly non-smooth. Recently a few works have discussed…
We provide an abstract multivariate central limit theorem with the Lindeberg-type error bounded in terms of Lipschitz functions (Wasserstein 1-distance) or functions with bounded second or third derivatives. The result is proved by means of…
The Abstract Boundary singularity theorem was first proven by Ashley and Scott. It links the existence of incomplete causal geodesics in strongly causal, maximally extended spacetimes to the existence of Abstract Boundary essential…
Arzel\`a's bounded convergence theorem (1885) states that if a sequence of Riemann integrable functions on a closed interval is uniformly bounded and has an integrable pointwise limit, then the sequence of their integrals tends to the…
Motivated by the normal form of a fast-slow ordinary differential equation exhibiting a pitchfork singularity we consider the discrete-time dynamical system that is obtained by an application of the explicit Euler method. Tracking…