Lecture 2 | Convex Optimization I (Stanford)

Convert to MP3 for your device with YouTube MP3jam
Guest Lecturer Jacob Mattingley covers convex sets and their applications in electrical engineering and beyond 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. Complete Playlist for the Course: EE 364A Course Website: Stanford University: Stanford University Channel on YouTube:

Post Comment
Thank you! Your comment is awaiting moderation.

More videos: