Lecture 13 | Convex Optimization I (Stanford)

Loading...

Sign in or sign up now!
Alert icon
Upgrade to the latest Flash Player for improved playback performance. Upgrade now or more info.
6,560
Loading...
Alert icon
Sign in or sign up now!
Alert icon

Uploaded by on Jul 8, 2008

Professor Stephen Boyd, of the Stanford University Electrical Engineering department, continues his lecture on geometric problems 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?p=3940DD956CDF0622

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/

Category:

Education

Tags:

Download this video

LICENSE: Creative Commons (Attribution-Noncommercial-No Derivative Works).

For more information about this license, please read: http://creativecommons.org/licenses/by-nc-nd/3.0/.

High-quality MP4 Learn more

  • likes, 0 dislikes

Link to this comment:

Share to:
see all

All Comments (4)

Sign In or Sign Up now to post a comment!
  • The big picutre the professor mentions at 39' is very intuitive for beginners ! clarisfies the whole ideas! good job Prof. Boyd !

  • @kakhakaladzemilan Also, I hadnt watched before replying, but he hadnt said that at all. He just said you will have to worry about a LOT of little details, and actually be able to code your own stuff IF you are on those fields, because the number of variables are so big, that the generic open source (or not) code and algorithms wont work.. this is actually a compliment! =) (actually i didnt finished watching this yet, but I suppose you are talking about 36:00)

  • @kakhakaladzemilan You have no sense of humor... he actually made fun of his field in other occasions too. (BTW, I dont know him, Im not even in the same country, I just watched the lectures, and I find him quite funny AND a very good professor)

  • allright2, I know Matlab calls LAPACK, he shouldn't have repeated it over and over again ! Also, his field is the best, other fields are either ridiculous or just plain stupid! Such arrogance !!!!

Loading...

Alert icon
0 / 00Unsaved Playlist Return to active list
    1. Your queue is empty. Add videos to your queue using this button:
      or sign in to load a different list.
    Loading...Loading...Saving...
    • Clear all videos from this list
    • Learn more