Related papers: Generalized Kantorovich-type theorem for the Fixed…
We study the smooth structure of convex functions by generalizing a powerful concept so-called self-concordance introduced by Nesterov and Nemirovskii in the early 1990s to a broader class of convex functions, which we call generalized…
We extend the generalised hodograph method to regular non- diagonalisable integrable systems of hydrodynamic type, in light of the relation between such systems and F-manifolds with compatible connection. The method allows the construction…
The generalized perturbative approach is an all purpose variant of Stein's method used to obtain rates of normal approximation. Originally developed for functions of independent random variables this method is here extended to functions of…
The purpose of this note is to extend the recent generalized version of the Grobman-Hartman theorem established by Bernardes Jr. and Messaoudi from an autonomous to the nonautonomous dynamics. More precisely, we prove that any sufficiently…
The problem of minimizing a continuously differentiable convex function over an intersection of closed convex sets is ubiquitous in applied mathematics. It is particularly interesting when it is easy to project onto each separate set, but…
Two years ago, Conlon and Gowers, and Schacht proved general theorems that allow one to transfer a large class of extremal combinatorial results from the deterministic to the probabilistic setting. Even though the two papers solve the same…
We analyze the performance of a variant of Newton method with quadratic regularization for solving composite convex minimization problems. At each step of our method, we choose regularization parameter proportional to a certain power of the…
Discrete state spaces represent a major computational challenge to statistical inference, since the computation of normalisation constants requires summation over large or possibly infinite sets, which can be impractical. This paper…
We prove a generalization of the classical connectivity theorem of Blakers-Massey, valid in an arbitrary higher topos and with respect to an arbitrary modality, that is, a factorization system (L,R) in which the left class is stable by base…
The Tikhonov-Phillips method is widely used for regularizing ill-posed inverse problems mainly due to the simplicity of its formulation as an optimization problem. The use of different penalizers in the functionals associated to the…
This paper considers the generalized continuation Newton method and thetrust-region updating strategy for the underdetermined system of nonlinear equations. Moreover, in order to improve its computational efficiency, the new method will not…
In this paper we introduce new various generalizations of the classical Kadomtsev-Petviashvili hierarchy in the case of operators in several variables. These generalizations are the candidates for systems that should play the role,…
The original Choi-Davis-Jensen's inequality, with its wide-ranging applications in diverse scientific and engineering fields, has motivated researchers to explore generalizations. In this study, we extend Davis-Choi-Jensen's inequality by…
Generalized Chebyshev acceleration is a semi-iterative technique applicable to a basic iterative method only when the eigenvalues of the iteration matrix satisfy a highly restrictive inclusion condition. In this work, we relax this…
In this paper, a general hybrid fixed point theorem for the contractive mappings in generalized Banach spaces is proved via measure of weak non-compactness and it is further applied to fractional integral equations for proving the existence…
We prove a general criterion for a von Neumann algebra $M$ in order to be in standard form. It is formulated in terms of an everywhere defined, invertible, antilinear, a priori not necessarily bounded operator, intertwining $M$ with its…
Supersymmetric quantum mechanics has many applications, and typically uses a raising and lowering operator formalism. For one dimensional problems, we show how such raising and lowering operators may be generalized to include an arbitrary…
The Euclidean algorithm makes possible a simple but powerful generalization of Taylor's theorem. Instead of expanding a function in a series around a single point, one spreads out the spectrum to include any number of points with given…
In this paper we study the problem of the convergence in variation for the generalized sampling series based upon averaged-type kernels in the multidimensional setting. As a crucial tool, we introduce a family of operators of…
We study a variant of Newton's algorithm applied to under-determined systems of non-smooth equations. The notion of regularity employed in our work is based on Newton differentiability, which generalizes semi-smoothness. The classic notion…