In this program
- Linear programming
- Nonlinear optimization
- Discrete and network optimization
Nonlinear optimization
Optimization & linear programming · STEM / applied
Unconstrained optimization
Objectives
- 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)
Study materials
- Study guideComing soon
- Exam StrategyComing soon
- Common MistakesComing soon
- WorksheetsComing soon
- Word problemsComing soon
- Mixed PracticeComing soon
- Multi-Unit ProblemsComing soon
- ReviewComing soon
- Practice testComing soon
- Answer keyComing soon
Interactive practice
Quizzes, typed answers, and flashcards for this unit — coming soon.
- Coming soon
Quiz
Multiple-choice questions with instant feedback
- Coming soon
Typed practice
Type answers and check them
- Coming soon
Flashcards
Vocabulary and key facts
- Coming soon
Mixed quiz
Harder mixed review for this standard