Optimization Theory and Methods: Nonlinear Programming Documentation Lean source Chapters Chapter 01 — Introduction Chapter 02 — Line Search Chapter 03 — Newton’s Methods Chapter 04 — Conjugate Gradient Method Chapter 05 — Quasi-Newton Methods Chapter 06 — Trust-Region Methods and Conic Model Methods Chapter 07 — Solving Nonlinear Least-Squares Problems Chapter 08 — Theory of Constrained Optimization Chapter 09 — Quadratic Programming Chapter 10 — Penalty Function Methods Chapter 11 — Feasible Direction Methods Chapter 12 — Sequential Quadratic Programming Chapter 13 — Trust-Region Methods for Constrained Problems Chapter 14 — Nonsmooth Optimization Formalization contributors Chenyi Li, Wanli Ma, Zichen Wang Project-level credit · Source roster