Convex sets and functions; operations preserving convexity; linear, quadratic, and conic optimization; duality theory; unconstrained smooth optimization; interior point methods. Required preparation must include advanced multivariate calculus, and a programming language. Recommended preparation: Knowledge in linear optimization and numerical linear algebra. Class Notes: Online delivery with at least one opportunity each week for students to interact synchronously with the instructor at the original time identified above. The Instructor will define the synchronous interaction.
Cooperative: Open to UI degree-seeking students.
Virtual class. Check course site for requirements.
VC Originating in Pullman