MA 57400, Fall 2024
Numerical Optimization
Credit Hours: 3.00. Convex optimization algorithms using modern large-scale algorithms for convex optimization, with a heavy emphasis on analysis including monotone operator, fixed point iteration and duality in splitting methods. The course will cover and focus on the following three parts: smooth optimization algorithms, nonsmooth convex optimization algorithms, and stochastic and randomized algorithms. Permission of department required. Prerequisites: MA 51100 and MA 50400.
Instructor Info
| Section |
Room |
Time |
Instructor |
Office |
| 001 |
SCHM 309 |
9:30AM |
MWF |
Xiangxiong Zhang
|
MATH 406 |
Course Materials
| Section |
Type |
Title |
Author |
| ALL |
TEXT |
Large-Scale Convex Optimization: Algorithms and Analyses via Monotone Operators |
Ernest K. Ryu and Wotao Yin |
Important Notes
- ADA policies: please see our ADA Information page for more details
- In the event of a missed exam, see your instructor/professor as soon as possible.
- See the online course evaluation page for more information on how we collect course feedback from students