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 Channel on YouTube:
my 61 year old son rates this shot very good :)
this icons has navigated right into my heart.
Thank you! Your comment is awaiting moderation.