Results 31 to 40 of about 331,959 (146)
A Simple Proof of Duality Theorem for Monge-Kantorovich Problem [PDF]
We give a simple proof of the duality theorem for the Monge-Kantorovich problem in the Euclidean setting.
Mikami, Toshio
core +1 more source
On Control of Probability Flows with Incomplete Information
The mean-field type control problems with incomplete information are considered. There are several points of view that can be adopted to study the dynamics in probability space.
D. V. Khlopin
doaj +1 more source
A general duality theorem for the Monge–Kantorovich transport problem [PDF]
The duality theory of the Monge--Kantorovich transport problem is analyzed in a general setting. The spaces $X, Y$ are assumed to be polish and equipped with Borel probability measures $μ$ and $ν$. The transport cost function $c:X\times Y \to [0,\infty]$ is assumed to be Borel.
Beiglböck, Mathias +2 more
openaire +3 more sources
Approximation of Discontinuous Functions by Positive Linear Operators. A Probabilistic Approach
ABSTRACT We obtain approximation results for general positive linear operators satisfying mild conditions, when acting on discontinuous functions and absolutely continuous functions having discontinuous derivatives. The upper bounds, given in terms of a local first modulus of continuity, are best possible, in the sense that we can construct particular ...
J.A. Adell +2 more
wiley +1 more source
Remarks on Afriat’s theorem and the Monge–Kantorovich problem
The famous Afriat’s theorem from the theory of revealed preferences establishes necessary and sufficient conditions for the existence of utility function for a given set of choices and prices. The result on the existence of a homogeneous utility function
Kolesnikov, Alexander V. +2 more
core +4 more sources
A parametric Kantorovich theorem with application to tolerance synthesis
International audienceWe propose a parametric Kantorovich theorem, which will achieve these two tasks. The idea is to compute worst case Kantorovich constants with respect to parameters q using a branch and bound algorithm dedicated to nonlinear ...
Goldsztejn, Alexandre +2 more
core +2 more sources
ABSTRACT The so‐called algorithmic bias is a hot topic in the decision‐making process based on Artificial Intelligence, especially when demographics, such as gender, age or ethnic origin, come into play. Frequently, the problem is not only in the algorithm itself, but also in the biased data that feed the algorithm, which is just the reflection of the ...
Elena M. De‐Diego +2 more
wiley +1 more source
Semilocal analysis of equations with smooth operators
Recent work on semilocal analysis of nonlinear operator equations is informally reviewed. A refined version of the Kantorovich theorem for Newton's method, with new error bounds, is presented. Related topics are briefly surveyed.
George J. Miel
doaj +1 more source
Kantorovich's Theorem on Newton's Method
In this work we present a simplifyed proof of Kantorovich's Theorem on Newton's Method. This analysis uses a technique which has already been used for obtaining new extensions of this theorem.
Ferreira, O. P., Svaiter, B. F.
openaire +2 more sources
Approximation theorems for q-Bernstein-Kantorovich operators
In the present paper we introduce a q-analogue of the Bernstein-Kantorovich operators and investigate their approximation properties. We study local and global approximation properties and Voronovskaja type theorem for the q-Bernstein-Kantorovich operators in case 0 < q < 1.
Mahmudov, N. I., Sabancigil, P.
openaire +2 more sources

