You are here: / Education / Online History Course / Convex Optimization I

Convex Optimization I

Lecture 1 | Convex Optimization I (Stanford)

hqdefaultProfessor Stephen Boyd, of the Stanford University Electrical Engineering department, gives the introductory lecture for the course, Convex Optimization I (EE 364A).

Convex Optimization I concentrates on recognizing and solving convex optimization problems that arise in engineering. Convex sets, functions, and optimization problems. Basics of convex analysis. Least-squares, linear and quadratic programs, semidefinite programming, minimax, extremal volume, and other problems. Optimality conditions, duality theory, theorems of alternative, and applications. Interior-point methods. Applications to signal processing, control, digital and analog circuit design, computational geometry, statistics, and mechanical engineering.

PureHistory
PureHistory.org ℗ is your source to learn about the broad and beautiful spectrum of our shared History.