Martingale optimal transport with Monge s cost function
|
|
- Annabelle Chase
- 6 years ago
- Views:
Transcription
1 Martingale optimal transport with Monge s cost function Martin Klimmek, joint work with David Hobson (Warwick) klimmek@maths.ox.ac.uk Crete July, 2013
2 ca c(x, y) = x y No splitting, transport along straight lines, some paths are forbidden
3 The Monge transport problem Monge s earthwork problem in one dimension: Transport earth from a given area to a target site in a way that minimises the cost of carriage. inf s:s µ=ν R x s(x) µ(dx). The s µ are push-forward maps of µ through s. s µ(u) = µ(s 1 (U)) for Borel sets U R.
4 The Kantorovich relaxation and duality Let C(µ, ν) = {(X, Y ) : X µ, Y ν}. The Kantorovich relaxation (primal problem): The dual problem: { sup Ψ,Φ Ψ(x)µ(dx) + R inf E[c(X, Y )]. (X,Y ) C(µ,ν) R } Φ(y)ν(dy) ; Ψ(x) + Φ(y) c(x, y).
5 Monge s bakeries tavernas Ψ(x) : Cost of calamari from fisherman x Φ(y) : Price of calamari sold at taverna y minimise costs: or maximise profits: { sup Ψ,Φ Ψ(x)µ(dx) + R Ψ(x) + Φ(y) c(x, y) x, y. inf E[c(X, Y )]. (X,Y ) C(µ,ν) R } Φ(y)ν(dy) ; Ψ(x) + Φ(y) c(x, y).
6 Monotone structure Define the c-convex dual of f to be f c (y) = sup x {c(x, y) f (x)}. f is c-convex if f = (f c ) c. Gangbo and McCann: If c(x, y) = f ( y x ) (f strictly convex), the optimal coupling is given by (X, Y ) = (X, s(x )) where s is the generalized subdifferential of a c-convex function Ψ satisfying. Ψ (x) = c x (x, s(x)).
7 Martingale coupling M(µ, ν) = {(X, Y ) : X µ, Y ν, E[Y X ] = X }. The primal problem: inf E[c(X, Y )]. (X,Y ) M(µ,ν)
8 Dual (Lagrangian) formulation { } min y x ρ(dx, dy) subject to ρ ρ(dx, dy) = ν(dy), ρ(dx, dy) = µ(dx), x y (y x)ρ(dx, dy) = 0. y Lagrangian objective function: L(x, y) = y x α(y) β(x) θ(x)(x y).
9 Economic motivation Let S be set of triples (α, β, γ) such that L(x, y) 0 where L(x, y) = y x α(y) β(x) θ(x)(x y). For such triples in S, E[ Y X ] β(x)µ(dx) + α(y)ν(dy) (F t ) T0 t T 1 forward price process (a martingale). Suppose marginal laws F T0 µ and F T1 ν are known. Purchase β(f T0 ) and α(f T1 ) Sell forward θ(f T0 ) of stock over [T 0, T 1 ] Payoff is α(f T1 ) + β(f T0 ) θ(f T0 )(F T1 F T0 ) F T1 F T0 The strategy is a sub-hedge.
10 Economic motivation Let S be set of triples (α, β, γ) such that L(x, y) 0 where L(x, y) = y x α(y) β(x) θ(x)(x y). For such triples in S, E[ Y X ] β(x)µ(dx) + α(y)ν(dy) (F t ) T0 t T 1 forward price process (a martingale). Suppose marginal laws F T0 µ and F T1 ν are known. Purchase β(f T0 ) and α(f T1 ) Sell forward θ(f T0 ) of stock over [T 0, T 1 ] Payoff is α(f T1 ) + β(f T0 ) θ(f T0 )(F T1 F T0 ) F T1 F T0 The strategy is a sub-hedge.
11 Guess and check L(x, y) = y x α(y) β(x) θ(x)(x y) L(x, x) = L(x, p(x)) = L(x, q(x)) = 0 L(x, y) = y x α(y) + α(x) θ(x)(x y)
12 Map η = (µ ν) + to γ = (ν µ) + z a z a f η (u)du = uf η (u)du = q(z) q(z) a f γ (u)du + uf γ (u)du + p(z) a p(z) f γ (u)du uf γ (u)du
13 Differential equations Map η = (µ ν) + to γ = (ν µ) + with constraints z a z a f η (u)du = uf η (u)du = q(z) q(z) a f γ (u)du + uf γ (u)du + p(z) a p(z) f γ (u)du, uf γ (u)du, where p : [a, b] (, a], q : [a, b] [b, ). Differentiate to obtain a pair of differential equations: p (x) = q (x) = q(x) x f µ (x) f ν (x) q(x) p(x) f µ (p(x)) f ν (p(x)), x p(x) f µ (x) f ν (x) q(x) p(x) f µ (q(x)) f ν (q(x)).
14 Deterministic transport Optimal martingale transport The optimal coupling The optimal sub-hedge picture R Better: A potential R Let D(x) = (y x)+ ν(dy ) (y x)+ µ(dy ) Manipulating the two equations a bit, find that (p, q) is given by D 0 (x) = D 0 (p(x)) + D 0 (q(x)) D(x) xd 0 (x) = D(q(x)) q(x)d 0 (q(x)) + D(p(x)) p(x)d 0 (p(x)) Example
15 Deterministic transport Optimal martingale transport The optimal coupling The optimal sub-hedge Example
16 The optimal coupling Theorem There exists a unique pair of decreasing functions (p, q) such that if If X µ and Y {p(x ), X, q(x )} with E[Y X ] = X then Y ν and (X, Y ) minimises E[ Y X ] over all martingale couplings. f η (x) q(x) x q(x) p(x) I {y=p(x)} y < x, ρ(x, y) = f µ (x) f η (x) y = x, f η (x) x p(x) q(x) p(x) I {y=q(x)} y > x.
17 The dual picture L(x, y) = y x α(y) + α(x) θ(x)(x y) L(x, x) = L(x, p(x)) = L y (x, p(x)) = L(x, q(x)) = L y (x, q(x)) = 0
18 Expanding, for x [a, b], x p(x) + α(x) α(p(x)) θ(x)(x p(x)) = 0 (1) 1 α (p(x)) + θ(x) = 0 (2) q(x) x + α(x) α(q(x)) θ(x)(x q(x)) = 0 (3) Differentiating (1) and using (2), 1 α (q(x)) + θ(x) = 0 (4) 1 + α (x) θ(x) θ (x)(x p(x)) = 0. (5) Similarly, 1 + α (x) θ(x) θ (x)(x q(x)) = 0 (6). Subtracting (6) from (5) gives Adding (5) and (6), θ (x) = 2 q(x) p(x). α (x) = θ(x) + θ (x) (2x p(x) q(x)). 2
19 Properties L(x, y) = y x + α(x) α(y) θ(x)(x y). q(x) is a local minimum in y for L(x,y), expect 0 L yy (x, q(x)) = α (q(x)). So α is concave at y = q(x). Also α (q(x)) = 1 + θ(x), so α (q(x))q (x) = θ (x) > 0. So q (x) < 0.
20 The optimal sub-hedge Fix x 0 [a, b], define θ = [a, b] R and α = [a, b] R via θ(x) = α(x) = x x 0 x x 0 2dz q(z) p(z), 2x q(z) p(z) dz = xθ(x) q(z) p(z) x x 0 q(z) + p(z) q(z) p(z) dz. Extend to R by defining δ : R R and ψ : [a, b] R via θ(p 1 (x)) x < a, δ(x) = θ(x) x [a, b], θ(q 1 (x)) x > b. α(p 1 (x)) + (p 1 (x) x)(1 θ(p 1 (x))) x < a, ψ(x) = α(x) x [a, b], α(q 1 (x)) + (q 1 (x) x)( 1 θ(q 1 (x))) x > b.
21 The optimal sub-hedge Theorem L(x, y) = y x + ψ(x) ψ(y) δ(x)(x y) 0 for all x, y R, with equality for y {p(x), x, q(x)}.
22 Uniform example Suppose µ U[ 1, 1] and ν U[ 2, 2]. D(x) = For 1 < x < 1 we have 1 8 x x x 1, x 2 1 < x < 1, 1 8 x x x 2. D (x) = D (p(x)) + D (q(x)) x = q(x) + p(x) D(x) xd (x) = D(q(x)) q(x)d (q(x)) + D(p(x)) p(x)d (p(x)) = D(q(x)) q(x)d (q(x)) + D( x q(x)) + (x + q(x))d ( x q(x)). After some simplification we find q(x) 2 + q(x)x + x 2 3 = 0, so q(x) = x+ 12 3x 2, and p(x) = x 12 3x
23 Uniform example: Dual Setting x 0 = 0, we have θ(x) = and x 0 α(x) = xθ(x) u 2 du = 1 3 x x 0 0 udu 12 3u 2 = 2x du 1 u 2 /4 = 2 ( sin 1 x 3 2 ( sin 1 x ) 3 2 ) x 2 3.
24 Uniform example: Differential equations µ U[ 1, 1] and ν U[ 2, 2]. p (x) = q (x) = q(x) x f µ(x) f ν(x) q(x) p(x) f µ(p(x)) f = x q(x) ν(p(x)) q(x) p(x) p(x) x q(x) p(x). Symmetry p(x) = q( x). Consider i.) j(x) = q(x) + p(x) and ii.) h(x) = q(x) p(x) i.) j (x) = q (x) + q ( x) = p(x) x h(x) + x q(x) h(x) = 1 symmetry j(0) = 0 j(x) = x. ii.) q (x)h(x) = p(x) x (h (x)+j (x))h(x) = j(x) h(x) 2x. So h (x)h(x) = j(x) 2x = 3x h(x) 2 = A 3x 2. Conclude: q(x) = (h(x) + j(x))/2 = q(0) x 2 x/2. Boundary condition q( 1) = 2 q(0) = 3 so q(x) = 12 3x 2 x 2. Then also a second boundary q(1) = 1 is satisfied. Further, p(x) = 12 3x 2 x 2.
25 Uniform example: Differential equations µ U[ 1, 1] and ν U[ 2, 2]. p (x) = q (x) = q(x) x f µ(x) f ν(x) q(x) p(x) f µ(p(x)) f = x q(x) ν(p(x)) q(x) p(x) p(x) x q(x) p(x). Symmetry p(x) = q( x). Consider i.) j(x) = q(x) + p(x) and ii.) h(x) = q(x) p(x) i.) j (x) = q (x) + q ( x) = p(x) x h(x) + x q(x) h(x) = 1 symmetry j(0) = 0 j(x) = x. ii.) q (x)h(x) = p(x) x (h (x)+j (x))h(x) = j(x) h(x) 2x. So h (x)h(x) = j(x) 2x = 3x h(x) 2 = A 3x 2. Conclude: q(x) = (h(x) + j(x))/2 = q(0) x 2 x/2. Boundary condition q( 1) = 2 q(0) = 3 so q(x) = 12 3x 2 x 2. Then also a second boundary q(1) = 1 is satisfied. Further, p(x) = 12 3x 2 x 2.
26 Uniform example: Differential equations µ U[ 1, 1] and ν U[ 2, 2]. p (x) = q (x) = q(x) x f µ(x) f ν(x) q(x) p(x) f µ(p(x)) f = x q(x) ν(p(x)) q(x) p(x) p(x) x q(x) p(x). Symmetry p(x) = q( x). Consider i.) j(x) = q(x) + p(x) and ii.) h(x) = q(x) p(x) i.) j (x) = q (x) + q ( x) = p(x) x h(x) + x q(x) h(x) = 1 symmetry j(0) = 0 j(x) = x. ii.) q (x)h(x) = p(x) x (h (x)+j (x))h(x) = j(x) h(x) 2x. So h (x)h(x) = j(x) 2x = 3x h(x) 2 = A 3x 2. Conclude: q(x) = (h(x) + j(x))/2 = q(0) x 2 x/2. Boundary condition q( 1) = 2 q(0) = 3 so q(x) = 12 3x 2 x 2. Then also a second boundary q(1) = 1 is satisfied. Further, p(x) = 12 3x 2 x 2.
27 Uniform example: Differential equations µ U[ 1, 1] and ν U[ 2, 2]. p (x) = q (x) = q(x) x f µ(x) f ν(x) q(x) p(x) f µ(p(x)) f = x q(x) ν(p(x)) q(x) p(x) p(x) x q(x) p(x). Symmetry p(x) = q( x). Consider i.) j(x) = q(x) + p(x) and ii.) h(x) = q(x) p(x) i.) j (x) = q (x) + q ( x) = p(x) x h(x) + x q(x) h(x) = 1 symmetry j(0) = 0 j(x) = x. ii.) q (x)h(x) = p(x) x (h (x)+j (x))h(x) = j(x) h(x) 2x. So h (x)h(x) = j(x) 2x = 3x h(x) 2 = A 3x 2. Conclude: q(x) = (h(x) + j(x))/2 = q(0) x 2 x/2. Boundary condition q( 1) = 2 q(0) = 3 so q(x) = 12 3x 2 x 2. Then also a second boundary q(1) = 1 is satisfied. Further, p(x) = 12 3x 2 x 2.
28 sas ɛυχαριστω para poli
arxiv: v1 [q-fin.pr] 8 Apr 2013
obust price bounds for the forward starting straddle David Hobson Martin Klimmek October 8, 018 arxiv:1304.141v1 [q-fin.p] 8 Apr 013 Abstract In this article we consider the problem of giving a robust,
More informationTwo Posts to Fill On School Board
Y Y 9 86 4 4 qz 86 x : ( ) z 7 854 Y x 4 z z x x 4 87 88 Y 5 x q x 8 Y 8 x x : 6 ; : 5 x ; 4 ( z ; ( ) ) x ; z 94 ; x 3 3 3 5 94 ; ; ; ; 3 x : 5 89 q ; ; x ; x ; ; x : ; ; ; ; ; ; 87 47% : () : / : 83
More informationIntroduction to optimal transport
Introduction to optimal transport Nicola Gigli May 20, 2011 Content Formulation of the transport problem The notions of c-convexity and c-cyclical monotonicity The dual problem Optimal maps: Brenier s
More informationOptimal Transport And WGAN
Optimal Transport And WGAN Yiping Lu 1 1 School of Mathmetical Science Peking University Data Science Seminar, PKU, 2017 Yiping Lu (pku) Geometry Of WGAN 1/34 Outline 1 Introduction To Optimal Transport.
More information. Then V l on K l, and so. e e 1.
Sanov s Theorem Let E be a Polish space, and define L n : E n M E to be the empirical measure given by L n x = n n m= δ x m for x = x,..., x n E n. Given a µ M E, denote by µ n the distribution of L n
More informationDynamic and Stochastic Brenier Transport via Hopf-Lax formulae on Was
Dynamic and Stochastic Brenier Transport via Hopf-Lax formulae on Wasserstein Space With many discussions with Yann Brenier and Wilfrid Gangbo Brenierfest, IHP, January 9-13, 2017 ain points of the
More informationOptimal Transportation. Nonlinear Partial Differential Equations
Optimal Transportation and Nonlinear Partial Differential Equations Neil S. Trudinger Centre of Mathematics and its Applications Australian National University 26th Brazilian Mathematical Colloquium 2007
More informationComputational Methods for Martingale Optimal Transport problems
Computational Methods for Martingale Optimal Transport problems Gaoyue Guo and Jan Obłój Mathematical Institute, University of Oxford AWB, ROQ, Oxford OX2 6GG, UK arxiv:1710.07911v1 [math.pr] 22 Oct 2017
More informationConvex Optimization & Lagrange Duality
Convex Optimization & Lagrange Duality Chee Wei Tan CS 8292 : Advanced Topics in Convex Optimization and its Applications Fall 2010 Outline Convex optimization Optimality condition Lagrange duality KKT
More informationCALCULUS. Berkant Ustaoğlu CRYPTOLOUNGE.NET
CALCULUS Berkant Ustaoğlu CRYPTOLOUNGE.NET Secant 1 Definition Let f be defined over an interval I containing u. If x u and x I then f (x) f (u) Q = x u is the difference quotient. Also if h 0, such that
More informationCanonical Supermartingale Couplings
Canonical Supermartingale Couplings Marcel Nutz Columbia University (with Mathias Beiglböck, Florian Stebegg and Nizar Touzi) June 2016 Marcel Nutz (Columbia) Canonical Supermartingale Couplings 1 / 34
More informationOptimal Transport for Data Analysis
Optimal Transport for Data Analysis Bernhard Schmitzer 2017-05-16 1 Introduction 1.1 Reminders on Measure Theory Reference: Ambrosio, Fusco, Pallara: Functions of Bounded Variation and Free Discontinuity
More informationLocal semiconvexity of Kantorovich potentials on non-compact manifolds
Local semiconvexity of Kantorovich potentials on non-compact manifolds Alessio Figalli, Nicola Gigli Abstract We prove that any Kantorovich potential for the cost function c = d / on a Riemannian manifold
More information14. Duality. ˆ Upper and lower bounds. ˆ General duality. ˆ Constraint qualifications. ˆ Counterexample. ˆ Complementary slackness.
CS/ECE/ISyE 524 Introduction to Optimization Spring 2016 17 14. Duality ˆ Upper and lower bounds ˆ General duality ˆ Constraint qualifications ˆ Counterexample ˆ Complementary slackness ˆ Examples ˆ Sensitivity
More informationOrder book resilience, price manipulation, and the positive portfolio problem
Order book resilience, price manipulation, and the positive portfolio problem Alexander Schied Mannheim University Workshop on New Directions in Financial Mathematics Institute for Pure and Applied Mathematics,
More informationA new approach for investment performance measurement. 3rd WCMF, Santa Barbara November 2009
A new approach for investment performance measurement 3rd WCMF, Santa Barbara November 2009 Thaleia Zariphopoulou University of Oxford, Oxford-Man Institute and The University of Texas at Austin 1 Performance
More informationx log x, which is strictly convex, and use Jensen s Inequality:
2. Information measures: mutual information 2.1 Divergence: main inequality Theorem 2.1 (Information Inequality). D(P Q) 0 ; D(P Q) = 0 iff P = Q Proof. Let ϕ(x) x log x, which is strictly convex, and
More informationOptimal Martingale Transport problem in higher dimensions
University of British Columbia Based on joint work with Young-Heon Kim & Tongseok Lim (UBC) September, 2015 Varese Main Points of the talk: Comparison between optimal transport problem and optimal martingale
More informationShort-time expansions for close-to-the-money options under a Lévy jump model with stochastic volatility
Short-time expansions for close-to-the-money options under a Lévy jump model with stochastic volatility José Enrique Figueroa-López 1 1 Department of Statistics Purdue University Statistics, Jump Processes,
More informationQueen s University. Department of Economics. Instructor: Kevin Andrew
Figure 1: 1b) GDP Queen s University Department of Economics Instructor: Kevin Andrew Econ 320: Math Assignment Solutions 1. (10 Marks) On the course website is provided an Excel file containing quarterly
More informationLagrangian Duality and Convex Optimization
Lagrangian Duality and Convex Optimization David Rosenberg New York University February 11, 2015 David Rosenberg (New York University) DS-GA 1003 February 11, 2015 1 / 24 Introduction Why Convex Optimization?
More informationThe semi-geostrophic equations - a model for large-scale atmospheric flows
The semi-geostrophic equations - a model for large-scale atmospheric flows Beatrice Pelloni, University of Reading with M. Cullen (Met Office), D. Gilbert, T. Kuna INI - MFE Dec 2013 Introduction - Motivation
More information1. Introduction. 2. Outlines
1. Introduction Graphs are beneficial because they summarize and display information in a manner that is easy for most people to comprehend. Graphs are used in many academic disciplines, including math,
More informationCVaR and Examples of Deviation Risk Measures
CVaR and Examples of Deviation Risk Measures Jakub Černý Department of Probability and Mathematical Statistics Stochastic Modelling in Economics and Finance November 10, 2014 1 / 25 Contents CVaR - Dual
More informationCS-E4830 Kernel Methods in Machine Learning
CS-E4830 Kernel Methods in Machine Learning Lecture 3: Convex optimization and duality Juho Rousu 27. September, 2017 Juho Rousu 27. September, 2017 1 / 45 Convex optimization Convex optimisation This
More information1. (a) (5 points) Find the unit tangent and unit normal vectors T and N to the curve. r (t) = 3 cos t, 0, 3 sin t, r ( 3π
1. a) 5 points) Find the unit tangent and unit normal vectors T and N to the curve at the point P 3, 3π, r t) 3 cos t, 4t, 3 sin t 3 ). b) 5 points) Find curvature of the curve at the point P. olution:
More informationDuality (Continued) min f ( x), X R R. Recall, the general primal problem is. The Lagrangian is a function. defined by
Duality (Continued) Recall, the general primal problem is min f ( x), xx g( x) 0 n m where X R, f : X R, g : XR ( X). he Lagrangian is a function L: XR R m defined by L( xλ, ) f ( x) λ g( x) Duality (Continued)
More informationOptimal Transport for Data Analysis
Optimal Transport for Data Analysis Bernhard Schmitzer 2017-05-30 1 Introduction 1.1 Reminders on Measure Theory Reference: Ambrosio, Fusco, Pallara: Functions of Bounded Variation and Free Discontinuity
More informationOn a Class of Multidimensional Optimal Transportation Problems
Journal of Convex Analysis Volume 10 (2003), No. 2, 517 529 On a Class of Multidimensional Optimal Transportation Problems G. Carlier Université Bordeaux 1, MAB, UMR CNRS 5466, France and Université Bordeaux
More informationLipschitz continuity for solutions of Hamilton-Jacobi equation with Ornstein-Uhlenbeck operator
Lipschitz continuity for solutions of Hamilton-Jacobi equation with Ornstein-Uhlenbeck operator Thi Tuyen Nguyen Ph.D student of University of Rennes 1 Joint work with: Prof. E. Chasseigne(University of
More informationThe Monge problem on non-compact manifolds
The Monge problem on non-compact manifolds Alessio Figalli Scuola Normale Superiore Pisa Abstract In this paper we prove the existence of an optimal transport map on non-compact manifolds for a large class
More informationLagrangian Duality Theory
Lagrangian Duality Theory Yinyu Ye Department of Management Science and Engineering Stanford University Stanford, CA 94305, U.S.A. http://www.stanford.edu/ yyye Chapter 14.1-4 1 Recall Primal and Dual
More informationGeodesic Density Tracking with Applications to Data Driven Modeling
Geodesic Density Tracking with Applications to Data Driven Modeling Abhishek Halder and Raktim Bhattacharya Department of Aerospace Engineering Texas A&M University College Station, TX 77843-3141 American
More informationFirst-Order ODE: Separable Equations, Exact Equations and Integrating Factor
First-Order ODE: Separable Equations, Exact Equations and Integrating Factor Department of Mathematics IIT Guwahati REMARK: In the last theorem of the previous lecture, you can change the open interval
More informationCOMPUTATION OF GENERALIZED NASH EQUILIBRIA WITH
COMPUTATION OF GENERALIZED NASH EQUILIBRIA WITH THE GNE PACKAGE C. Dutang 1,2 1 ISFA - Lyon, 2 AXA GRM - Paris, 1/19 12/08/2011 user! 2011 OUTLINE 1 GAP FUNCTION MINIZATION APPROACH 2 FIXED-POINT APPROACH
More informationLagrangian Duality. Richard Lusby. Department of Management Engineering Technical University of Denmark
Lagrangian Duality Richard Lusby Department of Management Engineering Technical University of Denmark Today s Topics (jg Lagrange Multipliers Lagrangian Relaxation Lagrangian Duality R Lusby (42111) Lagrangian
More informationAmbiguity Sets and their applications to SVM
Ambiguity Sets and their applications to SVM Ammon Washburn University of Arizona April 22, 2016 Ammon Washburn (University of Arizona) Ambiguity Sets April 22, 2016 1 / 25 Introduction Go over some (very
More information10 Numerical methods for constrained problems
10 Numerical methods for constrained problems min s.t. f(x) h(x) = 0 (l), g(x) 0 (m), x X The algorithms can be roughly divided the following way: ˆ primal methods: find descent direction keeping inside
More informationMonotone Martingale Transport Plans and Skorohod Embedding
Monotone Martingale Transport Plans and Skorohod Embedding Mathias Beiglböck Pierre Henry-Labordère Nizar Touzi arxiv:1701.06779v1 [math.pr] 24 Jan 2017 March 28, 2018 Abstract We show that the left-monotone
More informationSensitivity analysis of the expected utility maximization problem with respect to model perturbations
Sensitivity analysis of the expected utility maximization problem with respect to model perturbations Mihai Sîrbu, The University of Texas at Austin based on joint work with Oleksii Mostovyi University
More informationTwo viewpoints on measure valued processes
Two viewpoints on measure valued processes Olivier Hénard Université Paris-Est, Cermics Contents 1 The classical framework : from no particle to one particle 2 The lookdown framework : many particles.
More informationA : k n. Usually k > n otherwise easily the minimum is zero. Analytical solution:
1-5: Least-squares I A : k n. Usually k > n otherwise easily the minimum is zero. Analytical solution: f (x) =(Ax b) T (Ax b) =x T A T Ax 2b T Ax + b T b f (x) = 2A T Ax 2A T b = 0 Chih-Jen Lin (National
More informationA NONLOCAL VECTOR CALCULUS, NONLOCAL VOLUME-CONSTRAINED PROBLEMS, AND NONLOCAL BALANCE LAWS
Mathematical Models and Methods in Applied Sciences c World Scientific Publishing Company A NONLOCAL VECTOR CALCULUS, NONLOCAL VOLUME-CONSTRAINED PROBLEMS, AND NONLOCAL BALANCE LAWS QIANG DU Department
More informationLagrange Relaxation and Duality
Lagrange Relaxation and Duality As we have already known, constrained optimization problems are harder to solve than unconstrained problems. By relaxation we can solve a more difficult problem by a simpler
More informationThe Cameron-Martin-Girsanov (CMG) Theorem
The Cameron-Martin-Girsanov (CMG) Theorem There are many versions of the CMG Theorem. In some sense, there are many CMG Theorems. The first version appeared in ] in 944. Here we present a standard version,
More informationConstrained Optimization and Lagrangian Duality
CIS 520: Machine Learning Oct 02, 2017 Constrained Optimization and Lagrangian Duality Lecturer: Shivani Agarwal Disclaimer: These notes are designed to be a supplement to the lecture. They may or may
More informationMath 273a: Optimization Convex Conjugacy
Math 273a: Optimization Convex Conjugacy Instructor: Wotao Yin Department of Mathematics, UCLA Fall 2015 online discussions on piazza.com Convex conjugate (the Legendre transform) Let f be a closed proper
More informationHW4 : Bivariate Distributions (1) Solutions
STAT/MATH 395 A - PROBABILITY II UW Winter Quarter 7 Néhémy Lim HW4 : Bivariate Distributions () Solutions Problem. The joint probability mass function of X and Y is given by the following table : X Y
More informationApplications of Optimal Stopping and Stochastic Control
Applications of and Stochastic Control YRM Warwick 15 April, 2011 Applications of and Some problems Some technology Some problems The secretary problem Bayesian sequential hypothesis testing the multi-armed
More informationWelfare Maximization with Production Costs: A Primal Dual Approach
Welfare Maximization with Production Costs: A Primal Dual Approach Zhiyi Huang Anthony Kim The University of Hong Kong Stanford University January 4, 2015 Zhiyi Huang, Anthony Kim Welfare Maximization
More informationThe optimal partial transport problem
The optimal partial transport problem Alessio Figalli Abstract Given two densities f and g, we consider the problem of transporting a fraction m [0, min{ f L 1, g L 1}] of the mass of f onto g minimizing
More informationFULL CHARACTERIZATION OF OPTIMAL TRANSPORT PLANS FOR CONCAVE COSTS
FULL CHARACTERIZATION OF OPTIMAL TRANSPORT PLANS FOR CONCAVE COSTS PAUL PEGON, DAVIDE PIAZZOLI, FILIPPO SANTAMBROGIO Abstract. This paper slightly improves a classical result by Gangbo and McCann (1996)
More informationarxiv: v2 [math.pr] 26 Nov 2017
CANONICAL SUERMARTINGALE COULINGS arxiv:1609.02867v2 [math.r] 26 Nov 2017 MARCEL NUTZ AND FLORIAN STEBEGG Abstract. Two probability distributions µ and ν in second stochastic order can be coupled by a
More informationExtreme Abridgment of Boyd and Vandenberghe s Convex Optimization
Extreme Abridgment of Boyd and Vandenberghe s Convex Optimization Compiled by David Rosenberg Abstract Boyd and Vandenberghe s Convex Optimization book is very well-written and a pleasure to read. The
More informationOptimal transportation and optimal control in a finite horizon framework
Optimal transportation and optimal control in a finite horizon framework Guillaume Carlier and Aimé Lachapelle Université Paris-Dauphine, CEREMADE July 2008 1 MOTIVATIONS - A commitment problem (1) Micro
More informationLecture: Smoothing.
Lecture: Smoothing http://bicmr.pku.edu.cn/~wenzw/opt-2018-fall.html Acknowledgement: this slides is based on Prof. Lieven Vandenberghe s lecture notes Smoothing 2/26 introduction smoothing via conjugate
More informationDuality and dynamics in Hamilton-Jacobi theory for fully convex problems of control
Duality and dynamics in Hamilton-Jacobi theory for fully convex problems of control RTyrrell Rockafellar and Peter R Wolenski Abstract This paper describes some recent results in Hamilton- Jacobi theory
More informationLinear Programming Methods
Chapter 11 Linear Programming Methods 1 In this chapter we consider the linear programming approach to dynamic programming. First, Bellman s equation can be reformulated as a linear program whose solution
More informationWeek 10: Theory of the Firm (Jehle and Reny, Chapter 3)
Week 10: Theory of the Firm (Jehle and Reny, Chapter 3) Tsun-Feng Chiang* *School of Economics, Henan University, Kaifeng, China November 22, 2015 First Last (shortinst) Short title November 22, 2015 1
More information1 Basics of probability theory
Examples of Stochastic Optimization Problems In this chapter, we will give examples of three types of stochastic optimization problems, that is, optimal stopping, total expected (discounted) cost problem,
More informationA : k n. Usually k > n otherwise easily the minimum is zero. Analytical solution:
1-5: Least-squares I A : k n. Usually k > n otherwise easily the minimum is zero. Analytical solution: f (x) =(Ax b) T (Ax b) =x T A T Ax 2b T Ax + b T b f (x) = 2A T Ax 2A T b = 0 Chih-Jen Lin (National
More informationNonlinear Programming
Nonlinear Programming Kees Roos e-mail: C.Roos@ewi.tudelft.nl URL: http://www.isa.ewi.tudelft.nl/ roos LNMB Course De Uithof, Utrecht February 6 - May 8, A.D. 2006 Optimization Group 1 Outline for week
More informationIntroduction to Probability and Stocastic Processes - Part I
Introduction to Probability and Stocastic Processes - Part I Lecture 2 Henrik Vie Christensen vie@control.auc.dk Department of Control Engineering Institute of Electronic Systems Aalborg University Denmark
More informationA DARK GREY P O N T, with a Switch Tail, and a small Star on the Forehead. Any
Y Y Y X X «/ YY Y Y ««Y x ) & \ & & } # Y \#$& / Y Y X» \\ / X X X x & Y Y X «q «z \x» = q Y # % \ & [ & Z \ & { + % ) / / «q zy» / & / / / & x x X / % % ) Y x X Y $ Z % Y Y x x } / % «] «] # z» & Y X»
More informationMAXIMAL COUPLING OF EUCLIDEAN BROWNIAN MOTIONS
MAXIMAL COUPLING OF EUCLIDEAN BOWNIAN MOTIONS ELTON P. HSU AND KAL-THEODO STUM ABSTACT. We prove that the mirror coupling is the unique maximal Markovian coupling of two Euclidean Brownian motions starting
More informationGenerative Models and Optimal Transport
Generative Models and Optimal Transport Marco Cuturi Joint work / work in progress with G. Peyré, A. Genevay (ENS), F. Bach (INRIA), G. Montavon, K-R Müller (TU Berlin) Statistics 0.1 : Density Fitting
More informationConvex Optimization and SVM
Convex Optimization and SVM Problem 0. Cf lecture notes pages 12 to 18. Problem 1. (i) A slab is an intersection of two half spaces, hence convex. (ii) A wedge is an intersection of two half spaces, hence
More informationMathematical Preliminaries
Mathematical Preliminaries Economics 3307 - Intermediate Macroeconomics Aaron Hedlund Baylor University Fall 2013 Econ 3307 (Baylor University) Mathematical Preliminaries Fall 2013 1 / 25 Outline I: Sequences
More informationOptimal Transport: A Crash Course
Optimal Transport: A Crash Course Soheil Kolouri and Gustavo K. Rohde HRL Laboratories, University of Virginia Introduction What is Optimal Transport? The optimal transport problem seeks the most efficient
More informationConstrained Optimal Stopping Problems
University of Bath SAMBa EPSRC CDT Thesis Formulation Report For the Degree of MRes in Statistical Applied Mathematics Author: Benjamin A. Robinson Supervisor: Alexander M. G. Cox September 9, 016 Abstract
More information4 Differential Equations
Advanced Calculus Chapter 4 Differential Equations 65 4 Differential Equations 4.1 Terminology Let U R n, and let y : U R. A differential equation in y is an equation involving y and its (partial) derivatives.
More informationDistance-Divergence Inequalities
Distance-Divergence Inequalities Katalin Marton Alfréd Rényi Institute of Mathematics of the Hungarian Academy of Sciences Motivation To find a simple proof of the Blowing-up Lemma, proved by Ahlswede,
More informationLecture Notes on Risk Theory
Lecture Notes on Risk Theory February 2, 21 Contents 1 Introduction and basic definitions 1 2 Accumulated claims in a fixed time interval 3 3 Reinsurance 7 4 Risk processes in discrete time 1 5 The Adjustment
More informationFractals, fractal-based methods and applications. Dr. D. La Torre, Ph.D.
Fractals, fractal-based methods and applications Dr. D. La Torre, Ph.D. Associate Professor, University of Milan, Milan, Italy Adjunct Professor, University of Guelph, Guelph, Canada Adjunct Professor,
More informationOptimal Transport Methods in Operations Research and Statistics
Optimal Transport Methods in Operations Research and Statistics Jose Blanchet (based on work with F. He, Y. Kang, K. Murthy, F. Zhang). Stanford University (Management Science and Engineering), and Columbia
More information1/37. Convexity theory. Victor Kitov
1/37 Convexity theory Victor Kitov 2/37 Table of Contents 1 2 Strictly convex functions 3 Concave & strictly concave functions 4 Kullback-Leibler divergence 3/37 Convex sets Denition 1 Set X is convex
More informationGARP and Afriat s Theorem Production
GARP and Afriat s Theorem Production Econ 2100 Fall 2017 Lecture 8, September 21 Outline 1 Generalized Axiom of Revealed Preferences 2 Afriat s Theorem 3 Production Sets and Production Functions 4 Profits
More informationConvex Optimization and Modeling
Convex Optimization and Modeling Duality Theory and Optimality Conditions 5th lecture, 12.05.2010 Jun.-Prof. Matthias Hein Program of today/next lecture Lagrangian and duality: the Lagrangian the dual
More informationWritten Examination
Division of Scientific Computing Department of Information Technology Uppsala University Optimization Written Examination 202-2-20 Time: 4:00-9:00 Allowed Tools: Pocket Calculator, one A4 paper with notes
More informationLagrangian Duality. Evelien van der Hurk. DTU Management Engineering
Lagrangian Duality Evelien van der Hurk DTU Management Engineering Topics Lagrange Multipliers Lagrangian Relaxation Lagrangian Duality 2 DTU Management Engineering 42111: Static and Dynamic Optimization
More informationarxiv: v2 [math.ap] 23 Apr 2014
Multi-marginal Monge-Kantorovich transport problems: A characterization of solutions arxiv:1403.3389v2 [math.ap] 23 Apr 2014 Abbas Moameni Department of Mathematics and Computer Science, University of
More informationAliprantis, Border: Infinite-dimensional Analysis A Hitchhiker s Guide
aliprantis.tex May 10, 2011 Aliprantis, Border: Infinite-dimensional Analysis A Hitchhiker s Guide Notes from [AB2]. 1 Odds and Ends 2 Topology 2.1 Topological spaces Example. (2.2) A semimetric = triangle
More informationBivariate Transformations
Bivariate Transformations October 29, 29 Let X Y be jointly continuous rom variables with density function f X,Y let g be a one to one transformation. Write (U, V ) = g(x, Y ). The goal is to find the
More informationAdaGAN: Boosting Generative Models
AdaGAN: Boosting Generative Models Ilya Tolstikhin ilya@tuebingen.mpg.de joint work with Gelly 2, Bousquet 2, Simon-Gabriel 1, Schölkopf 1 1 MPI for Intelligent Systems 2 Google Brain Radford et al., 2015)
More informationOptimal exit strategies for investment projects. 7th AMaMeF and Swissquote Conference
Optimal exit strategies for investment projects Simone Scotti Université Paris Diderot Laboratoire de Probabilité et Modèles Aléatories Joint work with : Etienne Chevalier, Université d Evry Vathana Ly
More informationCenters of projective vector fields of spatial quasi-homogeneous systems with weight (m, m, n) and degree 2 on the sphere
Electronic Journal of Qualitative Theory of Differential Equations 2016 No. 103 1 26; doi: 10.14232/ejqtde.2016.1.103 http://www.math.u-szeged.hu/ejqtde/ Centers of projective vector fields of spatial
More informationInstructions: No books. No notes. Non-graphing calculators only. You are encouraged, although not required, to show your work.
Exam 3 Math 850-007 Fall 04 Odenthal Name: Instructions: No books. No notes. Non-graphing calculators only. You are encouraged, although not required, to show your work.. Evaluate the iterated integral
More informationSOLUTION FOR HOMEWORK 7, STAT p(x σ) = (1/[2πσ 2 ] 1/2 )e (x µ)2 /2σ 2.
SOLUTION FOR HOMEWORK 7, STAT 6332 1. We have (for a general case) Denote p (x) p(x σ)/ σ. Then p(x σ) (1/[2πσ 2 ] 1/2 )e (x µ)2 /2σ 2. p (x σ) p(x σ) 1 (x µ)2 +. σ σ 3 Then E{ p (x σ) p(x σ) } σ 2 2σ
More informationPart A: Short Answer Questions
Math 111 Practice Exam Your Grade: Fall 2015 Total Marks: 160 Instructor: Telyn Kusalik Time: 180 minutes Name: Part A: Short Answer Questions Answer each question in the blank provided. 1. If a city grows
More informationQuestion 1. The correct answers are: (a) (2) (b) (1) (c) (2) (d) (3) (e) (2) (f) (1) (g) (2) (h) (1)
Question 1 The correct answers are: a 2 b 1 c 2 d 3 e 2 f 1 g 2 h 1 Question 2 a Any probability measure Q equivalent to P on F 2 can be described by Q[{x 1, x 2 }] := q x1 q x1,x 2, 1 where q x1, q x1,x
More informationGeometry and Optimization of Relative Arbitrage
Geometry and Optimization of Relative Arbitrage Ting-Kam Leonard Wong joint work with Soumik Pal Department of Mathematics, University of Washington Financial/Actuarial Mathematic Seminar, University of
More informationPrimal-dual Subgradient Method for Convex Problems with Functional Constraints
Primal-dual Subgradient Method for Convex Problems with Functional Constraints Yurii Nesterov, CORE/INMA (UCL) Workshop on embedded optimization EMBOPT2014 September 9, 2014 (Lucca) Yu. Nesterov Primal-dual
More informationOptimality, Duality, Complementarity for Constrained Optimization
Optimality, Duality, Complementarity for Constrained Optimization Stephen Wright University of Wisconsin-Madison May 2014 Wright (UW-Madison) Optimality, Duality, Complementarity May 2014 1 / 41 Linear
More informationConvex Optimization Theory. Chapter 5 Exercises and Solutions: Extended Version
Convex Optimization Theory Chapter 5 Exercises and Solutions: Extended Version Dimitri P. Bertsekas Massachusetts Institute of Technology Athena Scientific, Belmont, Massachusetts http://www.athenasc.com
More informationOptimal Stopping and Maximal Inequalities for Poisson Processes
Optimal Stopping and Maximal Inequalities for Poisson Processes D.O. Kramkov 1 E. Mordecki 2 September 10, 2002 1 Steklov Mathematical Institute, Moscow, Russia 2 Universidad de la República, Montevideo,
More informationPCMI Introduction to Random Matrix Theory Handout # REVIEW OF PROBABILITY THEORY. Chapter 1 - Events and Their Probabilities
PCMI 207 - Introduction to Random Matrix Theory Handout #2 06.27.207 REVIEW OF PROBABILITY THEORY Chapter - Events and Their Probabilities.. Events as Sets Definition (σ-field). A collection F of subsets
More informationPart IB Optimisation
Part IB Optimisation Theorems Based on lectures by F. A. Fischer Notes taken by Dexter Chua Easter 2015 These notes are not endorsed by the lecturers, and I have modified them (often significantly) after
More informationMicroeconomics, Block I Part 1
Microeconomics, Block I Part 1 Piero Gottardi EUI Sept. 26, 2016 Piero Gottardi (EUI) Microeconomics, Block I Part 1 Sept. 26, 2016 1 / 53 Choice Theory Set of alternatives: X, with generic elements x,
More informationContinuous Random Variables
1 / 24 Continuous Random Variables Saravanan Vijayakumaran sarva@ee.iitb.ac.in Department of Electrical Engineering Indian Institute of Technology Bombay February 27, 2013 2 / 24 Continuous Random Variables
More informationMath 273a: Optimization Subgradients of convex functions
Math 273a: Optimization Subgradients of convex functions Made by: Damek Davis Edited by Wotao Yin Department of Mathematics, UCLA Fall 2015 online discussions on piazza.com 1 / 42 Subgradients Assumptions
More information