The Student Services team will have office hours at Harmony House (561 Lomita Dr, Stanford, CA 94305) on Tuesday and Thursday from 10 a.m. to 4 p.m.
Convex Optimization I
Convex sets, functions, and optimization problems. The basics of convex analysis and theory of convex programming: optimality conditions, duality theory, theorems of alternative, and applications. Least-squares, linear and quadratic programs, semidefinite programming, and geometric programming. Numerical algorithms for smooth and equality constrained problems; interior-point methods for inequality constrained problems. Applications to signal processing, communications, control, analog and digital circuit design, computational geometry, statistics, machine learning, and mechanical engineering.
Details:
- Catalog Number
- EE 364A-01
- Class Number
- 23035
- Course Cost
- $4116.00
- Population
- Undergraduate, Graduate
- Units
- 3
- Interest Area
- Computer Science and Engineering
- Course Format & Length
- In-Person, 8 weeks
- Instructors
- Ogut, G.
- Dates
- -
- Prerequisites
-
Linear algebra such as EE263, basic probability.
- Schedule
- Tue, Thu 9:30 AM - 11:20 AM