Upload

Loading icon Loading...

This video is unavailable.

Lecture 1 | Convex Optimization I (Stanford)

Sign in to YouTube

Sign in with your Google Account (YouTube, Google+, Gmail, Orkut, Picasa, or Chrome) to like StanfordUniversity's video.

Sign in to YouTube

Sign in with your Google Account (YouTube, Google+, Gmail, Orkut, Picasa, or Chrome) to dislike StanfordUniversity's video.

Sign in to YouTube

Sign in with your Google Account (YouTube, Google+, Gmail, Orkut, Picasa, or Chrome) to add StanfordUniversity's video to your playlist.

Uploaded on Jul 8, 2008

Professor 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.

Complete Playlist for the Course:
http://www.youtube.com/view_play_list...

EE 364A Course Website:
http://www.stanford.edu/class/ee364

Stanford University:
http://www.stanford.edu/

Stanford University Channel on YouTube:
http://www.youtube.com/stanford/

Loading icon Loading...

Loading icon Loading...

Loading icon Loading...

The interactive transcript could not be loaded.

Loading icon Loading...

Loading icon Loading...

Ratings have been disabled for this video.
Rating is available when the video has been rented.
This feature is not available right now. Please try again later.

Loading icon Loading...

Suggestions

Loading...
Working...
Sign in to add this to Watch Later

Add to