Related papers: Generalized Kantorovich-type theorem for the Fixed…
Kantorovich operators are non-linear extensions of Markov operators and are omnipresent in several branches of mathematical analysis. The asymptotic behaviour of their iterates plays an important role even in classical ergodic, potential…
In this paper we study Newton's method for solving generalized equations in Banach spaces. We show that under strong regularity of the generalized equation, the method is locally convergent to a solution with superlinear/quadratic rate. The…
This paper presents a regularized Newton method (RNM) with generalized regularization terms for unconstrained convex optimization problems. The generalized regularization includes quadratic, cubic, and elastic net regularizations as special…
The article begins with a quantitative version of the martingale central limit theorem, in terms of the Kantorovich distance. This result is then used in the study of the homogenization of discrete parabolic equations with random i.i.d.…
We show the following result: Let $A,B\in \mathbb{B}\left( \mathcal{H} \right)$ be two strictly positive operators such that $A\le B$ and $m{{\mathbf{1}}_{\mathcal{H}}}\le B\le M{{\mathbf{1}}_{\mathcal{H}}}$ for some scalars $0<m<M$. Then…
We extend the discrete majorization theory by working with non-normalized Lorenz curves. Then we prove two generalizations of the Muirhead theorem. These not only use elementary transfers but also local increases. Together these operations…
We will consider the damped Newton method for strongly monotone and Lipschitz continuous operator equations in a variational setting. We will provide a very accessible justification why the undamped Newton method performs better than its…
There are several extensions of the classical Banach Fixed Point Theorem in technical literature. A branch of generalizations replaces usual contractivity by weaker but still effective assumptions. Our note follows this stream, presenting…
In this paper we give necessary and sufficient conditions for a bounded linear operator $T$ to be generalized Drazin-Riesz invertible or generalized Drazin-meromorphic invertible. Also, we study generalized Browder's theorem and generalized…
In the present paper, we introduce Stancu-variant of generalized Baskakov operators and study the rate of convergence using modulus of continuity, order of approximation for the derivative of function f . Direct estimate is proved using…
We prove a generalization of Gowers' theorem for $\mathrm{FIN}_{k}$ where, instead of the single tetris operation $T:\mathrm{FIN}_{k}\rightarrow \mathrm{FIN}_{k-1}$, one considers all maps from $\mathrm{FIN}_{k}$ to $\mathrm{FIN}_{j}$ for…
The aim of the present paper is to extend Kantorovich's mass transport problem to the framework of upper/lower continuous capacities and to prove the cyclic monotonicity of the supports of optimal supermodular plans. As in the probabilistic…
In this article we present the Durrmeyer variant of generalized Bernstein operators that preserve the constant functions involving non-negative parameter ?. We derive the approximation behaviour of these operators including global…
In the paper, a Newton-type method for the solution of generalized equations (GEs) is derived, where the linearization concerns both the single-valued and the multi-valued part of the considered GE. The method is based on the new notion of…
We take a Hamiltonian-based perspective to generalize Nesterov's accelerated gradient descent and Polyak's heavy ball method to a broad class of momentum methods in the setting of (possibly) constrained minimization in Euclidean and…
Kantorovich potentials denote the dual solutions of the renowned optimal transportation problem. Uniqueness of these solutions is relevant from both a theoretical and an algorithmic point of view, and has recently emerged as a necessary…
We generalize Romanoff's theorem. Also, we obtain a result on sums related to Euler's totient function.
Majorization-minimization algorithms consist of successively minimizing a sequence of upper bounds of the objective function so that along the iterations the objective function decreases. Such a simple principle allows to solve a large…
We characterize generalized derivatives of the solution operator of the obstacle problem. This precise characterization requires the usage of the theory of so-called capacitary measures and the associated solution operators of relaxed…
The forcing method is a powerful tool to prove the consistency of set-theoretic assertions relative to the consistency of the axioms of set theory. Laver's theorem and Bukovsk\'y's theorem assert that set-generic extensions of a given…