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.
Spring 21
Hybrid course 1/2 attendance
FALL 2020
Instructors
Classes Start:
August 10, 2020
Classes End:
November 17, 2020
Location:
00214 111 Lampe Drive
Class Days:
TH
Class Start Time:
11:45am
Class End Time:
1:00pm
Class Type:
Lecture
Credits:
3.00
Delivery Method:
In Person Hybrid
Restrictions:
None
