OR 506
Algorithmic Methods in Nonlinear Programming
Section: 001

Course Description

Introduction to methods for obtaining approximate solutions to unconstrained and constrained minimization problems of moderate size. Emphasis on geometrical interpretation and actual coordinate descent, steepest descent, Newton and quasi-Newton methods, conjugate gradient search, gradient projection and penalty function methods for constrained problems. Specialized problems and algorithms treated as time permits.

Fall 2024

Instructors

Meeting Patterns

Classes Start:
August 19, 2024
Classes End:
December 3, 2024
Location:
02121 Fitts-Woolard Hall
Class Days:
T H
Class Start Time:
11:45am
Class End Time:
1:00pm

Class Type:
Lecture
Credits:
3.00
Restrictions:
None

Tools