0 views

Uploaded by salim

optimization

- 01707402.pdf
- Linear Programming Examples Assignment 1
- Chapter 2
- 13. Pre-midterm Assignment - Instruction and Questions
- a
- Aggregate Planning and MPS - Final 2009 (2)
- calc1 eportfolio
- 612_e1_2014_wsol (1)
- Final Algebra
- Optimum Design Principles
- A combination of genetic algorithm and particle swarm optimization for optimal DG location and sizing in distribution systems.pdf
- Chapter_13
- MA-MSCMT-10 J16
- 3 Sem 1 Seminar
- load C
- IJCE v13n1p102 En
- Aplicatiile Analizei Valorii-3-Optimizarea Volantului & Lagarului Concasorului-Autori: Florin Chichernea & Alexandru Chichernea
- j Me 751352061000
- Solver_Notes
- Sam146 Stress Fan Optimization

You are on page 1of 4

−1 ≤ u(t) ≤ 1 ∀t ≥ 0.

Now

H(x, u, λ) = 1 + λ1 x2 + λ2 u.

We notice that ∂H

∂u

= λ2 , i.e. ∂H

∂u

does not depend on u and thus the extremum

is to be reached at the boundaries, i.e. u∗ (t) = ±1, ∀t ≥ 0. Using

u u

we see that

u∗ (t) = −sign(λ2 (t)).

Figure 8.4 depicts the result of deploying this control. Note that the control

law is discontinuous. Further, we observe that the system now needs less

time to reach the origin than in the previous ”Minimal Energy” example.

Of course, this ”success” is obtained at the cost of deploying more actuator

energy.

The simplest suﬃcient condition for optimality is of course to establish

uniqueness of the solution that appears solving the ﬁrst order necessary con-

dition. In applications it is often the case that this is possible by using

application speciﬁc knowledge.

A more generic and well understood suﬃcient condition follows directly

from the standard constrained optimization result and is can be stated as

follows.

fulﬁll the conditions in Theorem 8.5. Then, the condition

∂ 2H ∗ ∗ ∗

(x , u , λ ) > 0

∂u2

is suﬃcient for the optimality of u∗ .

Nonlinear Systems and Control — Spring 2016

Figure 8.4: Trajectories for Minimal Time Case. Arrival time T ≈ 13.

not be a local optimizer) and using the expression

∂ 2H ∗ ∗ ∗

H(x∗ , u, λ∗ ) ≈ H(x∗ , u∗ , λ∗ ) + (u − u∗ ) (x , u , λ )(u − u∗ )

∂u2

≥ H(x∗ , u∗ , λ∗ )

following property: for any given x and x∗ we have

Nonlinear Systems and Control — Spring 2016

∗ ∂f

f (x) ≥ f (x ) + (x − x∗ ), ∀x, x∗ ∈ Rn .

∂x x=x∗

Before stating the ﬁrst result we also note the following fact for the Hamil-

tonian H = H(x, u, λ).

dH ∂H ∂H ∂u

= + .

dx ∂x ∂u ∂x

if u∗ is an optimal control policy candidate, then ∂H ∂u

= 0 and we establish

that

dH ∂H

(x, u∗ , λ) = (x, u∗ , λ).

dx ∂x

Theorem 8.14 (Suﬃciency Conditions II) Let u*(t), and the correspond-

ing x∗ (t) and λ∗ (t) satisfy the minimum principle necessary condition for all

t ∈ [0, T ]. Then, u∗ is an optimal control if H(x, u∗ , λ) is convex in x and

φ(x) is convex in x.

Proof: We want to prove that

J(x0 , u) − J(x0 , u∗ ) ≥ 0,

where x satisﬁes Equation (8.1). Now u∗ = arg min H and the convexity of

H give us

H(x, u, λ) ≥ H(x, u∗ , λ)

∗ ∗ ∂H

≥ H(x , u , λ) + (x − x∗ )

∂x x∗ ,u∗ ,λ

Or equivalently

Or

= −λ[(ẋ − ẋ∗ ) − λ̇(x − x∗ )

d

= [−λ(x − x∗ )]

dt

P. Al Hokayem & E. Gallestey 143 of 201

Nonlinear Systems and Control — Spring 2016

Integrating, and using both the transversality condition and the fact that all

trajectories have the same initial condition x = x0 , we observe that

T

[L(x, u) − L(x∗ , u∗ , λ)]dt = −λ(T )(x(T ) − x∗ (T )) + λ(0))(x∗ (0) − x(0))

0

∂φ

= − (x − x∗ )

∂x x∗

∂φ

φ(x) − φ(x∗ ) ≥ |x=x∗ (x − x∗ )

∂x

This implies

∂φ

− |x=x∗ (x − x∗ ) = −φ(x) + φ(x∗ ) + α, α ≥ 0.

∂x

We now recall that

T

J[x0 , u(·)] = φ(x(T )) + L(x(t), u(t))dt.

0

J(x0 , u) − J(x, u∗ ) = α ≥ 0,

- 01707402.pdfUploaded byBasil
- Linear Programming Examples Assignment 1Uploaded byHenry
- Chapter 2Uploaded byFickri Hafriz
- 13. Pre-midterm Assignment - Instruction and QuestionsUploaded byHarjas Bakshi
- aUploaded bygudun
- Aggregate Planning and MPS - Final 2009 (2)Uploaded bySavya Jaiswal
- calc1 eportfolioUploaded byapi-253694357
- 612_e1_2014_wsol (1)Uploaded byKushal Bn
- Final AlgebraUploaded byLaura Espinosa
- Optimum Design PrinciplesUploaded byJen Chavez
- A combination of genetic algorithm and particle swarm optimization for optimal DG location and sizing in distribution systems.pdfUploaded byyuni maheswari
- Chapter_13Uploaded byPrabir Acharya
- MA-MSCMT-10 J16Uploaded byDilip Bhati
- 3 Sem 1 SeminarUploaded byMunender Pal Singh
- load CUploaded byanamikamms
- IJCE v13n1p102 EnUploaded byAnonymous lKQDfeAHo
- Aplicatiile Analizei Valorii-3-Optimizarea Volantului & Lagarului Concasorului-Autori: Florin Chichernea & Alexandru ChicherneaUploaded byCH. FL
- j Me 751352061000Uploaded byluisparedes
- Solver_NotesUploaded bythewodros
- Sam146 Stress Fan OptimizationUploaded bySanthosh Lingappa
- Elevator 1Uploaded byassnad
- ESMOUploaded byTao Tao
- A Multi-Stage Supply Chain Network Optimization Using Genetic AlgorithmsUploaded byAlexander Decker
- Optimal Overcurrent Relay Coordination using GA, FFA, CSA Techniques and ComparisonUploaded byIRJET Journal
- Sensitivity 1Uploaded byNikita Awasthi
- 基于非支配排序遗传算法的多学科鲁棒协同优化方法Uploaded by麥當勞
- lesson-31-the-simplex-method-i-1197655204190297-5Uploaded byarnabmoitra11
- Estimation Error and Port OptimizationUploaded byconnythecon
- 11-21-4-302Uploaded byJohan
- AbstractUploaded byFrancesco Gilet

- t3Uploaded bysalim
- t 1Uploaded bysalim
- TP2_4Uploaded bysalim
- t 2Uploaded bysalim
- Tentalosning TMA947 070312 2Uploaded bysalim
- intro_optUploaded byУзахир УЗИ Армани
- intro_optUploaded byУзахир УЗИ Армани
- adap 1Uploaded bysalim
- sol2Uploaded bysalim
- tenta13A_2Uploaded bysalim
- 511 NotesUploaded bysalim
- MA30087/50087: Optimisation methods of operational researchUploaded byMarcelo Ziulkoski
- IOIPNotesOct2014Uploaded bysalim
- Ma 30087Uploaded bysalim
- 08520064Uploaded bysalim
- hu2008Uploaded bysalim
- Lewis 1996Uploaded bysalim
- m11_lec1Uploaded bysalim
- Course Outlines 012Uploaded bysalim
- SEEM3470_tuto_02Uploaded bysalim
- intro_optUploaded byУзахир УЗИ Армани
- intro_optUploaded byУзахир УЗИ Армани
- intro_optUploaded byУзахир УЗИ Армани
- Dβsgn(σ (t)) (1)Uploaded bysalim
- EEE482-FA09-ISSMUploaded bysalim
- 07 Homework6 SolUploaded bysalim
- tentoct11Uploaded bysalim
- cv-14-lecture-18_3Uploaded bysalim
- lecture_notes_series_optimisation_constrained.pdfUploaded bysalim

- Ibra AhmosUploaded byMohamed I. Eldesouki
- C Programming NotesUploaded bytheantariksha
- Word MacrosUploaded byShivakumar Patil
- Sir-Ivans-Documentation. (3).docxUploaded byVin Raymundo
- Chap2 Netw ModelsUploaded bychaidar_lakare
- 7 Principles of System EngineeringUploaded bylorindal
- CB. Chapter 20. HawkinsUploaded byBartholomew Szold
- Design and Planning of Wireless Microwave LinkUploaded byAli Nisar
- Classroom Management Troubleshooting GuideUploaded bychiton
- Frank HansenUploaded bysandia_docs
- Human to Human Interface PPT - Surya Pratap SinghUploaded byManvendra singh
- BTS 18000 GSM Indoor Outdoor Engineering RulesUploaded byGabriel Stefan Dumitru
- brochure - rnb470_brochureUploaded byrugged_mike
- SeaTools for DOS.enUploaded byjosa98
- outline for first 10 daysUploaded byapi-310130423
- 10 New PowerShell Commands of 2013Uploaded bySai Manasa
- Chapter 1 Standard FormUploaded byThiyaku Marutha
- Crowd Sourcing Systems on the World-Wide Web April 2011 Communications of the ACMUploaded byLuciana Moherdaui
- Ev Sx200 PDFUploaded byKevin
- Configuration.txtUploaded byFriedrich Kurniawan Moja
- my sql n asp.netUploaded byAshwini Sathyanathan
- COMSOL MultiphysicsUploaded byRAHMON RAUF OYEDOKUN
- EED2-TP-030_HEG_UsersGuide_2.14Uploaded byVera Sihombing
- Waiting line model in contruction site DocxUploaded byErick Bok Cang Yeong
- thinking toolsUploaded byapi-343890329
- Flyer-M20iB-35S-en.pdfUploaded bydavev2005
- UBD Lesson Plan Staff Development- TechnologyUploaded bymelbrock1309
- Fontana's 2015 California Public Records requestsUploaded byBeau Yarbrough
- Aspire 4332Uploaded byชัชวัล พัฒนะสันติ
- solartrackerUploaded byapi-422839082