Talk:Kantorovich Problem: Difference between revisions

From Optimal Transport Wiki
Jump to navigation Jump to search
No edit summary
No edit summary
 
(2 intermediate revisions by the same user not shown)
Line 1: Line 1:
==Beginning==
==Introduction==
* Instead of ``The Kantorovich's ot problem``, just ``Kantorovich's ot problem``
* Great picture!
* ``Leonid Kantorovich, the founder of modern optimization, who was awarded a Nobel...'
* Instead of ``The Kantorovich problem allows a non-empty minimization set, a convex constraint set,`` consider ``in the Kantorovich problem, the constraint set is convex and nonempty``.
* Change the phrase ``Leonid Kantorovich`` to a link to his wikipedia page
* Consider referencing the more specific page for ``dual``: https://en.wikipedia.org/wiki/Dual_linear_program
* Add a link to Nobel prize: [[https://www.nobelprize.org/prizes/economic-sciences/1975/press-release/]]
* More specifically ``it is a linear minimization problem with LINEAR constraints``
* Consider removing this discussion of the shipping problem and referring instead to the OT wiki article on the Kantorovich Dual Problem


==Introduction==
* ``beside THE Monge Problem``
* change the phrase ``Monge Problem`` to a link to the OT wiki page.
* While everything you say in the introduction is correct, it seems a little early to get into this level of technicality. Why not you move this section to the bottom and rename it ``Comparison to Monge Problem``?
* Instead, your introduction can give an heuristic interpretation of the problem, in terms of ``moving around piles of dirt``, which would be understandable to a non-mathematician. You can end the introduction with  statement of Kantorovich's OT problem, rather than having this in its own separate section.
* What are <math> X, Y, \mathcal{P}(X), \mathcal{P}(Y)</math>
* You will need to define what you mean by <math> \Pi(\mu,\nu) </math>
* You will need to define what you mean by <math> c(x,y) </math>


==Kantorovich Optimal Transport Problem==
* The problem isn't stated correctly -- it is a minimization problem, right?
* Remove the last phrase ``or equivalently Linfty dmu Linfty d nu`` since this is already implied by saying it holds for \phi and \psi in L1
* The Remarks section is a direct paraphrase of Villani. Unfortunately, it doesn't make sense as written and could be considered copyright infringement. Please remove it.


==Shipping
==Kantorovich Duality==
* Please remove this section and instead refer to the OT wiki article on the Kantorovich Dual


==References==
==References==
* There is an error in the references
* Villani (1-3, 6-9), Santambrogio (xv-xvii,1-9)

Latest revision as of 17:09, 27 May 2020

Introduction

  • Great picture!
  • Instead of ``The Kantorovich problem allows a non-empty minimization set, a convex constraint set,`` consider ``in the Kantorovich problem, the constraint set is convex and nonempty``.
  • Consider referencing the more specific page for ``dual``: https://en.wikipedia.org/wiki/Dual_linear_program
  • More specifically ``it is a linear minimization problem with LINEAR constraints``
  • Consider removing this discussion of the shipping problem and referring instead to the OT wiki article on the Kantorovich Dual Problem


Kantorovich Optimal Transport Problem

  • The problem isn't stated correctly -- it is a minimization problem, right?
  • Remove the last phrase ``or equivalently Linfty dmu Linfty d nu`` since this is already implied by saying it holds for \phi and \psi in L1
  • The Remarks section is a direct paraphrase of Villani. Unfortunately, it doesn't make sense as written and could be considered copyright infringement. Please remove it.

Kantorovich Duality

  • Please remove this section and instead refer to the OT wiki article on the Kantorovich Dual

References

  • Villani (1-3, 6-9), Santambrogio (xv-xvii,1-9)
Retrieved from "http://www.otwiki.xyz/index.php?title=Talk:Kantorovich_Problem&oldid=559"