EdusalsaDiscover Your Stanford

EE 364A

Convex Optimization I (CME 364A)

  • Not Offered

3 units

Letter or Credit/No Credit

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. Prerequisite: linear algebra such as EE263, basic probability.

Course Prequisites

EE 364A is useful for

Sign Up

To save EE 364A to your course bucketlist

Already Have An Account? Log In