← Standard syllabus

Get started Book tutoring

In this program

Unconstrained optimization
Convexity
Gradient descent
Newton's method for multivariable functions
Constrained optimization: Lagrange multipliers
Karush–Kuhn–Tucker (KKT) conditions (introduction)
Convex sets and convex functions (definitions and examples)

Nonlinear optimization

Newton's method for multivariable functions

Optimization & linear programming · Standard syllabus

Topic

Newton's method for multivariable functions

Practice by unit: Nonlinear optimization

Undergraduate Optimization & Linear Programming — scope drawn from open optimization / LP materials (e.g. Boyd convex-optimization companion undergrad tracks) and typical US syllabi.

Get started Book tutoring All topics