Joint work with Nguyen Hoang (Univ. Concepción, Chile) Padova, Italy, May 2018

Similar documents
FINITE-DIFFERENCE APPROXIMATIONS AND OPTIMAL CONTROL OF THE SWEEPING PROCESS. BORIS MORDUKHOVICH Wayne State University, USA

BORIS MORDUKHOVICH Wayne State University Detroit, MI 48202, USA. Talk given at the SPCOM Adelaide, Australia, February 2015

PARTIAL SECOND-ORDER SUBDIFFERENTIALS IN VARIATIONAL ANALYSIS AND OPTIMIZATION BORIS S. MORDUKHOVICH 1, NGUYEN MAU NAM 2 and NGUYEN THI YEN NHI 3

DUALIZATION OF SUBGRADIENT CONDITIONS FOR OPTIMALITY

FULL STABILITY IN FINITE-DIMENSIONAL OPTIMIZATION

On Nonconvex Subdifferential Calculus in Banach Spaces 1

arxiv: v1 [math.oc] 5 Nov 2018

Duality and dynamics in Hamilton-Jacobi theory for fully convex problems of control

GEOMETRIC APPROACH TO CONVEX SUBDIFFERENTIAL CALCULUS October 10, Dedicated to Franco Giannessi and Diethard Pallaschke with great respect

Dedicated to Michel Théra in honor of his 70th birthday

Finite-Difference Approximations And Optimal Control Of Differential Inclusions

Necessary optimality conditions for optimal control problems with nonsmooth mixed state and control constraints

Hölder Metric Subregularity with Applications to Proximal Point Method

Generalized Differential Calculus and Applications to Optimization

Hölder Metric Subregularity with Applications to Proximal Point Method

Tonelli Full-Regularity in the Calculus of Variations and Optimal Control

Necessary Optimality Conditions for ε e Pareto Solutions in Vector Optimization with Empty Interior Ordering Cones

Local strong convexity and local Lipschitz continuity of the gradient of convex functions

APPLICATIONS OF DIFFERENTIABILITY IN R n.

An Integral-type Constraint Qualification for Optimal Control Problems with State Constraints

SUBOPTIMALITY CONDITIONS FOR MATHEMATICAL PROGRAMS WITH EQUILIBRIUM CONSTRAINTS

Recent Advances in State Constrained Optimal Control

minimize x subject to (x 2)(x 4) u,

LINEAR-CONVEX CONTROL AND DUALITY

5. Duality. Lagrangian

Shiqian Ma, MAT-258A: Numerical Optimization 1. Chapter 4. Subgradient

BOLZA PROBLEMS WITH GENERAL TIME CONSTRAINTS P. D. LOEWEN AND R. T. ROCKAFELLAR

Deterministic Dynamic Programming

Optimality, identifiability, and sensitivity

Convex Optimization M2

Introduction. 1 Minimize g(x(0), x(1)) +

Implications of the Constant Rank Constraint Qualification

NONSMOOTH ANALYSIS AND PARAMETRIC OPTIMIZATION. R. T. Rockafellar*

Subgradient. Acknowledgement: this slides is based on Prof. Lieven Vandenberghes lecture notes. definition. subgradient calculus

Mathematical Economics. Lecture Notes (in extracts)

On duality theory of conic linear problems

Maximum Principle and Sensitivity Relations in the Infinite Horizon Optimal Control

arxiv: v2 [math.oc] 23 Nov 2016

Optimality, identifiability, and sensitivity

On smoothness properties of optimal value functions at the boundary of their domain under complete convexity

Tame variational analysis

OPTIMIZATION OF BOUNDARY VALUE PROBLEMS FOR THIRD ORDER POLYHEDRAL DIFFERENTIAL INCLUSIONS

Convex Optimization Boyd & Vandenberghe. 5. Duality

Partial Differential Equations

Inexact alternating projections on nonconvex sets

ECSE.6440 MIDTERM EXAM Solution Optimal Control. Assigned: February 26, 2004 Due: 12:00 pm, March 4, 2004

Normality and Nondegeneracy for Optimal Control Problems with State Constraints

Preprint Stephan Dempe and Patrick Mehlitz Lipschitz continuity of the optimal value function in parametric optimization ISSN

Principles of Optimal Control Spring 2008

NONSMOOTH SEQUENTIAL ANALYSIS IN ASPLUND SPACES

Aubin Criterion for Metric Regularity

Value Function and Optimal Trajectories for some State Constrained Control Problems

c???? Society for Industrial and Applied Mathematics Vol. 1, No. 1, pp ,???? 000

The local equicontinuity of a maximal monotone operator

CONVEXITY IN HAMILTON-JACOBI THEORY 2: ENVELOPE REPRESENTATIONS

Iteration-complexity of first-order penalty methods for convex programming

Applied Analysis (APPM 5440): Final exam 1:30pm 4:00pm, Dec. 14, Closed books.

DECENTRALIZED CONVEX-TYPE EQUILIBRIUM IN NONCONVEX MODELS OF WELFARE ECONOMICS VIA NONLINEAR PRICES

Differential Games II. Marc Quincampoix Université de Bretagne Occidentale ( Brest-France) SADCO, London, September 2011

Problem List MATH 5173 Spring, 2014

Optimality Conditions for Constrained Optimization

Lecture: Duality.

CONVEXITY IN HAMILTON-JACOBI THEORY 1: DYNAMICS AND DUALITY

Reflected Brownian Motion

Chapter 4. Inverse Function Theorem. 4.1 The Inverse Function Theorem

Active sets, steepest descent, and smooth approximation of functions

3 (Due ). Let A X consist of points (x, y) such that either x or y is a rational number. Is A measurable? What is its Lebesgue measure?

Calculus of Variations. Final Examination

DUALITY, OPTIMALITY CONDITIONS AND PERTURBATION ANALYSIS

MATH 220: MIDTERM OCTOBER 29, 2015

Fourier Series. ,..., e ixn ). Conversely, each 2π-periodic function φ : R n C induces a unique φ : T n C for which φ(e ix 1

Optimal Transportation. Nonlinear Partial Differential Equations

arxiv: v1 [math.oc] 13 Mar 2019

On some nonlinear parabolic equation involving variable exponents

The semi-geostrophic equations - a model for large-scale atmospheric flows

t y n (s) ds. t y(s) ds, x(t) = x(0) +

Nonsmooth Analysis in Systems and Control Theory

Regularity and approximations of generalized equations; applications in optimal control

FRIEDRICH-ALEXANDER-UNIVERSITÄT ERLANGEN-NÜRNBERG INSTITUT FÜR ANGEWANDTE MATHEMATIK

Subgradients. subgradients and quasigradients. subgradient calculus. optimality conditions via subgradients. directional derivatives

Lagrange duality. The Lagrangian. We consider an optimization program of the form

Convex Optimization. Dani Yogatama. School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, USA. February 12, 2014

POD for Parametric PDEs and for Optimality Systems

Integral Jensen inequality

Implicit Functions, Curves and Surfaces

Recent Trends in Differential Inclusions

The limiting normal cone to pointwise defined sets in Lebesgue spaces

Parallel-in-time integrators for Hamiltonian systems

Optimal Control Theory

Calculus of Variations

Preprint ISSN

Key words. Calculus of variations, convex duality, Hamiltonian conditions, impulse control

Objective. 1 Specification/modeling of the controlled system. 2 Specification of a performance criterion

Analysis Comprehensive Exam Questions Fall 2008

Enhanced Fritz John Optimality Conditions and Sensitivity Analysis

On the regularity of solutions to a class of variational problems, including the p-laplace equation for 2 p < 4.

Generic Aubry sets on surfaces

Closed-Loop Impulse Control of Oscillating Systems

Strong and Weak Augmentability in Calculus of Variations

Constrained Optimization and Lagrangian Duality

Transcription:

EXTENDED EULER-LAGRANGE AND HAMILTONIAN CONDITIONS IN OPTIMAL CONTROL OF SWEEPING PROCESSES WITH CONTROLLED MOVING SETS BORIS MORDUKHOVICH Wayne State University Talk given at the conference Optimization, State Constraints and Geometric Control Tribute to Giovanni Colombo and Franco Rampazzo Joint work with Nguyen Hoang (Univ. Concepción, Chile) Padova, Italy, May 2018 Supported by NSF grants DMS-1512846 and DMS-1808978 and by Air Force grant 15RT0462

CONTROLLED SWEEPING PROCESS This talk addresses the following sweeping process ẋ(t) f ( t, x(t) ) N ( g(x(t)); C(t, u(t)) ) a.e. t [0, T ] with x(0) = x 0 C(0, u(0)), where C(t, u) := { x IR n ψ(t, x, u) Θ }, (t, u) [0, T ] IR m with f : [0, T ] IR n IR n, g : IR n IR n, ψ : [0, T ] IR n IR m IR s, and Θ IR s. The feasible pairs (u( ), x( )) are absolutely continuous. The normal cone is defined via the projector by N( x; Ω) := { v IR n xk x, α k 0, w k Π(x k ; Ω), α k (x k w k ) v } if x Ω and N( x; Ω) = otherwise The major assumption is that x ψ is surjective 1

OPTIMAL CONTROL Problem (P) T minimize J[x, u] := ϕ ( x(t ) ) + 0 l( t, x(t), u(t), ẋ(t), u(t) ) dt over the sweeping control dynamics subject to the intrinsic pointwise state-control constraints From now on ψ ( t, g(x(t)), u(t) ) Θ for all t [0, T ] F = F (t, x, u) := f(t, x) N ( g(x); C(t, u) ) 2

LOCAL MINIMIZERS DEFINITION Let the pair ( x( ), ū( )) be feasible to (P ) (i) We say that ( x( ), ū( )) be a local W 1,2 W 1,2 -minimizer if x( ) W 1,2 ([0, T ]; IR n ), ū( ) W 1,2 ([0, T ]; IR m ), and J[ x, ū] J[x, u] for all x( ) W 1,2 ([0, T ]; IR n ), u( ) W 1,2 ([0, T ]; IR m ) sufficiently close to ( x( ), ū( )) in the norm topology of the corresponding spaces (ii) Let the running cost l( ) in do not depend on u. We say that the pair ( x( ), ū( )) be a local W 1,2 C-minimizer if x( ) W 1,2 ([0, T ]; IR n ), ū( ) C([0, T ]; IR m ), and J[ x, ū] J[x, u] for all x( ) W 1,2 ([0, T ]; IR n ), u( ) C([0, T ]; IR m ) sufficiently close to ( x( ), ū( )) in the norm topology of the corresponding spaces 3

DISCRETE APPROXIMATIONS For local W 1,2 W 1,2 -minimizers ( x, ū). Problem (P 1 k ) minimize J k [z k ] := ϕ(x k k ) + h k k 1 j=0 ( l x k j, uk j, xk j+1 xk j, uk j+1 uk ) j h k h k k 1 +h k j=0 t k j+1 t k j ( x k j+1 xk j h k x(t) 2 + u k j+1 uk j h k ū(t) 2 ) dt over z k := (x k 0,..., xk k, uk 0,..., uk k ) s.t. (xk k, uk k ) ψ 1 (Θ) and x k j+1 xk j + h kf (x k j, uk j ), j = 0,..., k 1, ( x k 0, ) ( uk 0 = x0, ū(0) ) k 1 j=0 t k j+1 t k j ( x k j+1 xk j h k x(t) 2 + u k j+1 uk j h k ū(t) 2 ) dt ε 2 4

DISCRETE APPROXIMATIONS (cont.) For local W 1,2 C-minimizer-minimizers ( x, ū). Problem (P 2 k ) minimize J k [z k ] := ϕ(x k k ) + h k k 1 j=0 ( l x k j, uk j, xk j+1 xk ) j h k + k j=0 u k k 1 j ū(tk j ) 2 + j=0 t k j+1 t k j x k j+1 xk j h k x(t) 2 dt over z k = (x k 0,..., xk k, uk 0,..., uk k ) s.t. (xk k, uk k ) ψ 1 (Θ) and x k j+1 xk j + h kf (x k j, uk j ), j = 0,..., k 1, ( x k 0, ) ( uk 0 = x0, ū(0) ) k j=0 u k k 1 j ū(tk j ) 2 + j=0 t k j+1 t k j x k j+1 xk j h k x(t) 2 dt ε 2 5

STRONG CONVERGENCE OF DISCRETE APPROXIMATIONS THEOREM (i) If ( x( ), ū( )) is a local W 1,2 W 1,2 -minimizer for (P ), then any sequence of piecewise linear extensions on [0, T ] of the optimal solutions ( x k ( ), ū k ( )) to (Pk 1 ) converges to ( x( ), ū( )) in the norm topology of W 1,2 ([0, T ]; IR n ) W 1,2 ([0, T ]; IR m ) (ii) If ( x( ), ū( )) is a local W 1,2 C-minimizer for (P ), then any sequence of piecewise linear extensions on [0, T ] of the optimal solutions ( x k ( ), ū k ( )) to (Pk 2 ) converges to ( x( ), ū( )) in the norm topology of W 1,2 ([0, T ]; IR n ) C([0, T ]; IR m ) 6

GENERALIZED DIFFERENTIATION Subdifferential of an l.s.c. function ϕ: IR n (, ] at x ϕ( x) := { v (v, 1) N(( x, ϕ( x)); epi ϕ) Coderivative of a set-valued mapping F D F ( x, ȳ)(u) := Generalized Hessian of ϕ at x { v (v, u) N(( x, ȳ); gph F ) }, x dom ϕ }, ȳ F ( x) 2 ϕ( x) := D ( ϕ)( x, v), v ϕ( x) Enjoy FULL CALCULUS and PRECISELY COMPUTED in terms of the given data of (P ) 7

FURTHER STRATEGY For each k reduce problems (Pk 1) and to (P k 2 ) a problems of mathematical programming (M P ) with functional and increasingly many geometric constraints. The latter are generated by the graph of the mapping F (z) := f(x) N(x; C(u)), and so (M P ) is intrinsically nonsmooth and nonconvex even for smooth initial data Use variational analysis and generalized differentiation (firstand second-order) to derive necessary optimality conditions for (MP ) and then discrete control problems (P 1 k ) and (P 2 k ) Explicitly compute the coderivative of F (z) entirely in terms of the given data of (P ) By passing to the limit as k, to derive necessary optimality conditions for the sweeping control problem (P ) 8

EXTENDED EULER-LAGRANGE CONDITIONS THEOREM If ( x( ), ū( )) is a local W 1,2 W 1,2 -minimizer, then there exist a multiplier λ 0, an adjoint arc p( ) = (p x, p u ) W 1,2 ([0, T ]; IR n IR m ), a signed vector measure γ C ([0, T ]; IR s ), as well as pairs (w x ( ), w u ( )) L 2 ([0, T ]; IR n IR m ) and (v x ( ), v u ( )) L ([0, T ]; IR n IR m ) with ( w x (t), w u (t), v x (t), v u (t) ) co l ( x(t), ū(t), x(t), ū(t) ) satisfying the collection of necessary optimality conditions Primal-dual dynamic relationships ) ṗ(t) = λw(t) + 2 xx η(t), ψ ( x(t), ū(t) ) η(t), ψ ( x(t), ( λv x (t) + q x (t) ) ū(t) 2 xw q u (t) = λv u (t) a.e. t [0, T ] 9

where η( ) L 2 ([0, T ]; IR s ) is uniquely defined by x(t) = x ψ ( x(t), ū(t) ) η(t), η(t) N(ψ( x(t), ū(t)); Θ) where q : [0, T ] IR n IR m is of bounded variation with q(t) = p(t) ψ( x(τ), ū(τ) ) dγ(τ) [t,t ] Measured coderivative condition: Considering the t-dependent outer limit Lim sup B 0 γ(b) (t) := B { y IR s seq. B k [0, 1], t IB k, B k 0, γ(b k) B k y over Borel subsets B [0, 1], for a.e. t [0, T ] we have D N Θ ( ψ( x(t), ū(t)), η(t) )( x ψ( x(t), ū(t))(q x (t) λv x (t)) ) Lim sup B 0 γ(b) B (t) }

Transversality condition ( p x (T ), p u (T ) ) λ ( ϕ( x(t )), 0 ) + ψ ( x(t ), ū(t ) ) N Θ ( ( x(t ), ū(t ) ) Measure nonatomicity condition: Whenever t [0, T ) with ψ( x(t), ū(t)) int Θ there is a neighborhood V t of t in [0, T ] such that γ(v ) = 0 for any Borel subset V of V t Nontriviality condition λ + sup p(t) + γ = 0 with γ := t [0,T ] sup x(s)dγ x C([0,T ] =1 [0,T ] Enhanced nontriviality: If θ = 0 is the only vector satisfying θ D N Θ ( ψ( x(t ), ū(t )), η(t ) ) (0), ψ ( x(t ), ū(t ) ) θ ψ ( x(t ), ū(t ) ) N

then we have λ + mes { t [0, T ] q(t) 0 } + q(0) + q(t ) > 0 (ii) If ( x( ), ū( )) is a local W 1,2 C-minimizer, then all the above conditions hold with ( w x (t), w u (t), v x (t) ) co l ( x(t), ū(t), x(t) )

HAMILTONIAN FORMALISM Consider here for simplicity a particular case of the orthant Θ = IR s and put I(x, u) := { i {1,..., s} ψ i (x, u) = 0 } For each v N(x; C(u)) there is a unique {α i } i I(x,u) with α i 0 and v = i I(x,u) α i[ x ψ(x, u)] i. Define [ν, v] IR n by [ν, v] := i I(x,u) ν i α i [ x ψ(x, u) ] i, ν IRs and introduce the modified Hamiltonian H ν (x, u, p) := sup { [ν, v], p v N ( x; C(u) )} 10

MAXIMUM PRINCIPLE THEOREM In addition to the extended Euler-Lagrange conditions there is a measurable function ν : [0, T ] IR s such that ν(t) Lim sup B 0 γ(b) B (t) and the maximum condition holds [ ν(t), x(t) ], q x (t) λv x (t) = H ν(t) ( x(t), ū(t), q x (t) λv x (t) ) = 0 The conventional maximum principle with H(x, p) := sup { p, v v F (x) } fails! 11

REFERENCES N. D. Hoang and B. S. Mordukhovich, Extended Euler-Lagrange and Hamiltonian formalisms in optimal control of sweeping processes with controlled sweeping sets, preprint (2018); arxiv:1804.10635 12