Operations Research
Types of Nonlinearities
Challenges in Nonlinear Programming
Local vs. Global Optimization
First-Order Necessary Conditions
Second-Order Sufficient Conditions
Steepest Descent Method
Newton's Method
Quasi-Newton Methods
Equality Constraints
Inequality Constraints
Convex Sets and Functions
Properties of Convex Problems
Global Optimality in Convex Problems
Duality in Convex Programming
Interior Point Methods
Previous
6. Integer Programming
Go to top
Next
8. Dynamic Programming