39 views

Uploaded by Trần Mạnh Hùng

KKT

- Nuevo Documento de Texto
- plp_new
- GenFam Algo and Meeting Notes
- Power Flow
- Transportation Problem1
- Economic Dispatch Termal-1-Hand Out
- tmp14AC.tmp
- Gis Report
- hw12
- Simplex Method
- Sample Exam 12
- skala Kategorik
- Jocuri logice grele
- Rtr LagrangeMultipliers
- MCSE-0041
- The Mathematics Behind Big Data
- m511lectm5
- Ch4 Select Questions
- 2009-03-31 Function Transformation, Part 3.5
- a2 9 22 14 q1 review

You are on page 1of 5

nb

KKT Conditions

General Non-Linear Constrained Minimum: Min: f[x] Constrained by: h[x] = 0 (m equality constraints) g[x] 0 (k inequality constraints) Introduce slack variables si for the inequality contraints: gi [x] + si 2 == 0 and construct the monster Lagrangian: L[x,l,m] = f[x] + l h[x] + mi (gi [x] + si 2 ) Recall the geometry of the Lagrange multiplier conditions: The gradient of the objective function must be orthogonal to the tangent plane of the (active) constraints. That is the projection of the gradient of f onto the space of directions tangent to the constraint "surface" is zero. The KKT conditions are analogous conditions in the case of constraints. The KKT conditions are the following: 1) 2) 3) 4) 5) Gradient of the Lagrangian = 0 Constraints: h[x] = 0 (m equality constraints) & g[x] 0 (k inequality constraints) Complementary Slackness ( for the si variables) m.s == 0 Feasibility for the inequality constraints: si 2 0 Sign condition on the inequality multipliers: m 0

One final requirement for KKT to work is that the gradient of f at a feasible point must be a linear combination of the gradients for the equality constraints and the gradients of the active constraints: this is often called regularity of a feasible point. At a feasible point for the constraints, the active constraints are those components of g with gi [x] = 0 ( if the value of the constraining function is < 0, that constraint is said to be inactive). The solution of a set of KKT equations proceeds by cases according to which inequality constraints are Active & Inactive.

Consider a circuit with a 20V battery and two resistances in series: R and 10 ohm. We will investigate the maximization of the power in each of the resistors separately

KKT.nb

Maximize power absorbed by resistance R Equivalently: minimized: - Power absorbed by R= - i2 R = - 400 R H10 + RL ^ 2 subject to -R 0. The lagrangian is L[R,l] =

- 400 R L@R_, m_D := + m H- RL H10 + RL2 D@L@R, mD, RD D@L@R, mD, mD

KKT also gives us the complementary slackness: m.R = 0 and the sign condition for the inequality constraints: m 0. But, if m > 0, then R==0 which is gives no power absorbed by R. If the constraint is inactive we must solve

Solve@HD@L@R, mD, RD . 8m 0<L 0, RD 88R 10<<

Find the value of R such that maximal power is delivered to the 10 ohm resistor, i.e: Min: - \frac{4000}{(10+R)^2} subject to -R 0

- 4000 L@R_, m_D := + m H- RL H10 + RL2

Again, KKT gives us a complementary slackness condition: m.R = 0 and the sign condition for the inequality constraints: m 0. But, if m = 0, we must solve

Solve@HD@L@R, mD, RD . 8m 0<L 0, RD 8<

This first case has no solutions. However, R = 0 is possible in the case m > 0

KKT.nb

Lagrangian

Min: cT .x subject to the linear constraints: A.x == b, x 0, the associated Lagrangian is:

The KKT conditions yield: cT - Transpose[l].A + Transpose[m] == 0 A.x - b ==0 x 0, 2 Transpose[m].s == 0 m 0 Eliminating m, we obtain the following: yielding cT - Transpose[l].A 0, (cT - Transpose[l].A).x= - Transpose[m]).( s@2D ) = 0

A certain electrical networks is designed to supply power xi thru 3 channels.

p@x_, y_, z_D = z + Hx^ 2 + y ^ 2 + z ^ 2 10L 2;

Contraint: h[x,y,z]=x+y+z== 5, x,y,z 0 Note that this gives a "slanted" triangles with vertices on the axes 5 units from the origin.

h@x_, y_, z_D = x + y + z

The KKT conditions give: 1) f + l h + m g = {x,y,1+z/10} + l {1,1,1} + { m1 , m2 , m3 } =={0,0,0} 2) Constraint: h==5 3) m1 x = 0, m2 y = 0, m3 z = 0, Checking for active constraints will divide in the consideration of 8 cases for the three inequality constraints.

KKT.nb

Review: Quadratic Programs

The general quadratic program proposes to minimize an objective function of the form: the linear constraints: A.x == b, x 0 Min: x.Q.x/2 + p.x subject to

Note that we may assume that Q is a symmetric matrix (and that Q is the Hessian of the objective function.) This is a non-linear program problem, for the objective function is a quadratic function (if Q is non-zero.)

Wolfe's Reduction to LP

Given the Quadratic Program as above, the associated Linear Program is: A.x == b Q.x + Transpose[A].u - v == -p x 0, v 0, x.v == 0 Note that the vector u is not necessarily positive. The only additional feature is the exclusion rule: x.v == 0, this requirement states that the ith components of x and v can not both be positive simultaneously. Finally, note that the existence of a solution of the associated LP is only necessary for the existence of a solution to the QP and is sufficient in case Q is positive semi-definite. In practice we solve the LP program: A.x==b Q.x + Transpose[A].u -v + D.z == -p x 0l, u free, v 0, z 0 Min: {1, . . .,1}.z Initial Feasible Solution: x, u=0, v=0, z where x is a basic feasible solution of A.x ==b, x 0, D is a diagonal matrix with entries 1 to correct the signs of z and z is a chosen such that Q.x + D.z == - p, z 0.

Lagrangian

Given: x.Q.x/2 + p.x subject to the linear constraints: A.x == b, x 0, the associated Lagrangian is: L[x,l] = x.Q.x/2 + p.x + l (A.x - b) + m.x The KKT conditions yield: Q.x + p - Transpose[A].l + m == 0 Transpose[l].(A.x - b) ==0 Transpose[m].x == 0 A.x == b, x 0,

KKT.nb

The KKT conditions yield: Q.x + p - Transpose[A].l + m == 0 Transpose[l].(A.x - b) ==0 Transpose[m].x == 0 A.x == b, x 0,

Exercises

I. Write down the KKT conditions for the problem: Min f[x] = - x1 3 + x2 2 - 2 x1 x3 2 subject to the constraints: 2 x1 + x2 2 + x3 - 5 == 0 5 x1 2 - x2 2 - x3 2 xi 0 for i = 1,2,3. Verify that the KKT conditions are satisfied at (1,0,3). II. Write down the KKT conditions for the problem: Min f[x] = x1 2 + x2 2 + x3 2 subject to the constraints: -x1 +x2 - x3 -10 x1 +x2 +4 x3 20 Find all the solutions. III. Here's an exercise from Grieg p. 142): Minimize: f[x] = (x1 -1)^2 + (x2 -2)^2+ ( x3 -3)^2+ ( x4 -4)^2 subject to: - x1 - x2 - x3 - x4 + 5 0 - 3 x1 - 3 x2 - 2 x3 - x4 + 10 0 x0 Verify the KT conditions and then expand f to obtains a Quadratic Program and compare the KT conditions with Wolfe's. Solve the problem using Wolfe's method . Bonus: Solve the problem using a projected gradient methods (mimic affine scaling) and a projected Newton's method. Compare the results.

- Nuevo Documento de TextoUploaded byLuis Angel
- plp_newUploaded byJosé Moore Muñoz
- GenFam Algo and Meeting NotesUploaded byUmme Rabab Syed
- Power FlowUploaded bysayedmh
- Transportation Problem1Uploaded bySmriti Dhingra
- Economic Dispatch Termal-1-Hand OutUploaded byIvanWidhi
- tmp14AC.tmpUploaded byFrontiers
- Gis ReportUploaded byVignesh Selvaraj
- hw12Uploaded byapi-289303740
- Simplex MethodUploaded byYu Pin Fish
- Sample Exam 12Uploaded byddddddda
- skala KategorikUploaded byMuhammad Nur DelaphanEnam
- Jocuri logice greleUploaded byGafencu Ruben
- Rtr LagrangeMultipliersUploaded byQarsam Ilyas
- MCSE-0041Uploaded byRajat Manchanda
- The Mathematics Behind Big DataUploaded bysapabapjava2012
- m511lectm5Uploaded bySwetcha Rao Chakilam
- Ch4 Select QuestionsUploaded byizyicon
- 2009-03-31 Function Transformation, Part 3.5Uploaded bysamjshah
- a2 9 22 14 q1 reviewUploaded byapi-263462183
- HW5_SOLNUploaded byMohamedSalah
- Grade7-138473-1-2038Uploaded byKULDEEP_1997
- NCCR Summer School Workshop Sept 04Uploaded byiqbal kurniawan
- mid1key-s08.pdfUploaded byBradley Mitchell
- Quick Sort ExplanationUploaded byTrishool Narayanasetty
- Unit1_Paper2_May2010Uploaded byKingBee1123
- Signals and Networks Assignment 2Uploaded byAvikalp Srivastava
- MATH 1920 Final Study GuideUploaded byBrimwoodboy
- Print Page - Fiesta 17 _ Fall 2009Uploaded byteachopensource
- pedro_a-note_2003Uploaded byVibusan Pathmanathan

- Energy Detection abcUploaded byTrần Mạnh Hùng
- 50 Câu Tiếng Anh Giao Tiếp Thông DụngUploaded byNam Nguyen
- Bai Tap Lap Trinh Huong Doi Tuong c 2308Uploaded byRyan Nguyễn
- Enso Evolution Status Fcsts WebUploaded byTrần Mạnh Hùng
- SDR BASED OFDM FOR LOW RATE VIDEO TRANSMISSION SYSTEMUploaded byTrần Mạnh Hùng
- Đề Tài Tìm Hiểu Hoạt Động Nhập Khẩu Của Công Ty TNHH Việt Anh - Luận Văn, Đồ Án, Đề Tài Tốt NghiệpUploaded byTrần Mạnh Hùng
- Ly_thuyet_trai_pho_va_da_truy_nhap_vo_tuyenUploaded byNguyen Song Nghiem
- 03-07-01Uploaded byTrần Mạnh Hùng
- Lagrange.pdfUploaded byTrần Mạnh Hùng
- Lich Thi Hk1a Nam Hoc 2013-2014-UpdateUploaded bySiêu Nhân Cún
- msp430F1611.pdfUploaded byTrần Mạnh Hùng
- Lap Tring C can banUploaded byDestiny IIl
- Ba yếu tố làm nên bài báo quốc tếUploaded byacsimet0612
- PicUploaded byTrần Mạnh Hùng
- Interference Reduction in Cognitive Networks via SchedulingUploaded byTrần Mạnh Hùng
- Chuong_07Uploaded byhosithai

- Development_of_a_Structural_analysis_pro.pdfUploaded byKim Daryl Rasay
- GTnotes2.pdfUploaded bySuperheavy Rockshow Go't
- Basic Simulation LabUploaded bykamalahasanm
- Dynamics Equation of Motion - Curvilinear Motion ProblemsUploaded byDiana Vega
- TI-89 Calculator HandbookUploaded byAzianPowah
- Additional Math 0606 Nov 15_ms_12Uploaded byCorinSaputra
- Ch 5Uploaded byamged
- Geometric transformation 2.pptxUploaded byEdelmar Benosa
- Ma2161 Mathematics II Nov-Dec 2010Uploaded byBala Subramanian
- Type-II Fuzzy Logic Controller for TemperatureUploaded byRio Ananda Putra
- Tutorial on Vector SpaceUploaded byDharmendra Kumar
- D10 Question PaperUploaded bysearchingubaby
- Matla BodesUploaded byazharzeb
- Cavalieri's PrincipleUploaded byLucas Gallindo
- 4024_y04_sw_10Uploaded bymstudy123456
- MIT Electric Field Notes, Gauss's LawUploaded byNathan Thai
- Tensors Poor ManUploaded byAlan Turing
- psdtheoryUploaded byAof Kanin
- 2018 - Semester 1 - Book 1Uploaded byPeter Bolocelli
- Tutorial ImageSegmentationGraph Cut4 SharonUploaded byRahul Paul
- Differential EquationsUploaded bytabtga
- Runge -Kutta Methods for IVPsUploaded bysmartebu
- Portfolio HJB EquationUploaded byMakos_Antoniou
- 7.1 Equivalent Forms of Exponential EquationsUploaded byd-fbuser-51619135
- Chapter 5Uploaded byABHINANDAN YADAV
- Quartic EquationUploaded bykishan shukla
- Methodology Stress FactorsUploaded byvarshasdm1987
- hw1Uploaded byHasan Nawaz
- ADVANCE 3.1-Flow DiagramUploaded byJuanSebastiánGuzmánFeria
- Matrix Algebra 1.Uploaded bySnaya Sharma