4.10.18 · D3 · HinglishAdvanced Topics (Elite Level)

Worked examplesFirst-order optimality conditions — gradient = 0

3,412 words16 min read↑ Read in English

4.10.18 · D3 · Maths › Advanced Topics (Elite Level) › First-order optimality conditions — gradient = 0

Prerequisites jo tumhe pehle se pata hone chahiye: Gradient and directional derivatives ( kya hota hai), Hessian matrix and second-order conditions (second derivatives ka matrix jo point classify karta hai), aur Saddle points. Baaki sab yahan build kiya gaya hai.


Scenario matrix

Cell Case class Stationary point par Signal Example
A Clean minimum (1-D) Ex 1
B Clean maximum (1-D) Ex 1 (same function)
C Degenerate 1-D () — inflection vs flat min , higher probe zaroori Ex 2
D 2-D minimum (positive-definite Hessian) dono eigenvalues Ex 3
E 2-D maximum (negative-definite Hessian) dono eigenvalues Ex 4
F 2-D saddle (indefinite Hessian) eigenvalues opposite sign Ex 5
G 2-D degenerate (singular Hessian) — poori valley line ek eigenvalue Ex 6
H Multiple stationary points, mixed types har ek ko alag classify karo Ex 7
I Boundary / constrained — gradient ka vanish karna zaroori nahi edge check karo, sirf interior nahi Ex 8
J Word problem (real quantity optimise karna hai) model banao phir FONC apply karo Ex 9

Chaar 2-D shapes (cells D–G)

Chaar 2-D outcomes exactly chaar surface shapes hain neeche. Figure ko grid ki tarah padho, aur har panel ko uske cell se map karo:

  • Top-left, blue bowl → cell D (minimum): dono eigenvalues , har slice upar curve karti hai; black dot lowest point par baitha hai.
  • Top-right, orange dome → cell E (maximum): dono eigenvalues , har slice neeche curve karti hai; dot summit par hai.
  • Bottom-left, red saddle → cell F (saddle): opposite sign ke eigenvalues; surface ek ridge ke along upar uthti hai aur perpendicular ridge ke along girती hai, dot par milti hain.
  • Bottom-right, green valley → cell G (degenerate): ek eigenvalue hai, isliye trough poori line ke along flat hai — dot infinitely many lowest points mein se sirf ek hai.

Har panel mein black dot wahan hai jahan hai; uske aas-paas ki shape wohi hai jo eigenvalue signs secretly describe kar rahe hain. Ex 3–6 karte waqt ye picture saamne rakhna.

Figure — First-order optimality conditions — gradient = 0

Cells A & B — sabse clean 1-D case


Cell C — degenerate 1-D trap ()


Cell D — 2-D bowl (positive-definite Hessian)


Cell E — 2-D dome (negative-definite Hessian)


Cell F — 2-D saddle (indefinite Hessian)


Cell G — degenerate 2-D valley (singular Hessian)


Cell H — multiple stationary points of mixed type


Cell I — boundary case (optimum par gradient vanish nahi karta)


Cell J — real-world word problem


Flashcards

Jab ho, tum kya karte ho?
Second-order test khamosh hai; pehla non-zero higher derivative probe karo (odd order ⇒ inflection, even & positive ⇒ min).
Hessian ka eigenvalue intuitively kya hota hai?
Surface ki pure curvature uske do principal directions mein se ek ke along; uska sign batata hai bends-up (+) ya bends-down (−).
2-D Hessian test jab aur ?
Positive definite ⇒ local minimum.
2-D Hessian test jab aur ?
Negative definite ⇒ local maximum.
2-D Hessian test jab ?
Indefinite ⇒ saddle (opposite sign ke eigenvalues, kyunki ).
2-D Hessian test jab ?
Inconclusive (singular) — flat direction; doosre means se classify karo.
Optimum kahan chhup sakta hai jab bhi wahan ho?
Closed domain ki boundary par — FONC sirf interior points govern karta hai.
Volume wale open-top box ki minimum surface dimensions?
cm, surface .

Recall Poori matrix ki one-line summary

Dhundo jahan ho (shayad zero, ek, kai, ya poori line of points), phir Hessian ke eigenvalue signs decide karein min/max/saddle — aur agar Hessian singular ho ya tum boundary par ho, toh haath se argue karo ya constraints use karo.


Connections

  • Parent: FONC — woh condition jo har example apply karta hai.
  • Hessian matrix and second-order conditions — cells C–J mein use kiya gaya classifier.
  • Saddle points — cell F concretely banaya gaya.
  • Convex functions — jab ek single stationary point (cell D) automatically global hota hai.
  • Lagrange multipliers — boundary cell I ka proper tool.
  • Gradient descent — ek algorithm jo minima mein settle ho jaata lekin saddles par stuck ho jaata.

Concept Map

one

several

a line

det gt 0, fxx gt 0

det gt 0, fxx lt 0

det lt 0

det = 0

closed domain

Solve grad f = 0

How many solutions

Single point

Classify each

Degenerate valley

Check Hessian

Minimum

Maximum

Saddle

Inconclusive probe by hand

Also test boundary

Compare interior vs edge