OR 331

Nonlinear Optimization
List of Topics: 
Review of Convex Analysis and Matrix algebra
Basics concepts of optimization and classification of optimization problems.
Optimality conditions for unconstrained optimization problems of one variable and many variables.
Constrained optimization problem: Graphical solution - Optimality conditions - Lagrangian technique – Kuhn Tucker conditions and their application to Quadratic program.
One dimensional and multi-dimensional search techniques for unconstrained optimization problems.
Gradient Projection, Feasible direction, and Penalty barrier function Methods: Algorithms and solution procedures with applications

Log in

to use Ginger

Limited mode

Basic concepts of optimization and classification of optimization problems
×

Course Materials