MATH.5720 Optimization (Formerly 92.572)
Id: 008446
Credits: 3-3
Description
Optimization without calculus; geometric programming; convex sets and convex functions; review of linear algebra; linear programming and the simplex method; convex programming; iterative barrier-function methods; iterative penalty-function methods; iterative least-squares algorithms; iterative methods with positivity constraints; calculus of variations; applications to signal processing, medical imaging, game theory.
Prerequisites
MATH.2310 Calculus III, and MATH.2210 Linear Algebra I.
View Current Offerings
Course prerequisites/corequisites are determined by the faculty and approved by the curriculum committees. Students are required to fulfill these requirements prior to enrollment. For courses offered through online or GPS delivery, students are responsible for confirming with the instructor or department that all enrollment requirements have been satisfied before registering.