Course Catalog - 2023-2024

     

CMOR 531 - CONVEX OPTIMIZATION

Long Title: CONVEX OPTIMIZATION
Department: Comp Appl Math Operations Rsch
Grade Mode: Standard Letter
Language of Instruction: Taught in English
Course Type: Lecture
Credit Hours: 3
Restrictions:
Must be enrolled in one of the following Level(s):
Graduate
Description: Convex optimization problems arise in communication, system theory, VLSI, CAD, finance, inventory, network optimization, computer vision, learning, statistics, etc., even though oftentimes convexity may be hidden and unrecognized. Recent advances in interior-point methodology have made it much easier to solve these problems and various solvers are now available. This course will introduce the basic theory and algorithms for convex optimization, as well as its many applications to computer science, engineering, management science and statistics. Biennial; Offered in Odd Years. Recommended Prerequisite(s): (CAAM 335 or CMOR 302 and MATH 321)