Rating is available when the video has been rented.
This feature is not available right now. Please try again later.
Published on Jul 8, 2008
Professor Stephen Boyd, of the Stanford University Electrical Engineering department, gives a background lecture of numerical linear algebra 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.