Material Detail

Lecture 18: Announcements

This video was recorded at Stanford Engineering Everywhere EE364B - Convex Optimization II. But you're not gonna give up globalness – globality? You're gonna give up neither globalness nor globality but you are gonna give up speed. So what's gonna happen is these are gonna be methods that are slow but they don't lie. They will produce a – at any point you can stop them and exactly like a convex optimization method they will have a lower bound and they will have an upper bound. ... See the whole transcript at Convex Optimization II - Lecture 18

Keywords:: videolectures, ocwc, oec

Disciplines:

Mathematics and Statistics / Mathematics

Go to Material

Bookmark / Add to Course ePortfolio

Create a Learning Exercise

Add Accessibility Information

Rate

Add a Comment

Quality

User Rating
Comments
Learning Exercises
Bookmark Collections
Course ePortfolios
Accessibility Info

Report Broken Link
Report as Inappropriate

More about this material

Material Type:: Presentation
Date Added to MERLOT:: February 10, 2015
Date Modified in MERLOT:: February 10, 2015
Author:: Stephen P. Boyd, Department of Electrical Engineering, Stanford University
Submitter:: The Open Education Consortium
Primary Audience:: College General Ed, College Lower Division, College Upper Division
Technical Format:: Video

Mobile Compatibility:: Not specified at this time
Language:: English
Cost Involved:: No
Source Code Available:: No
Accessibility Information Available:: Unknown
Creative Commons:: This work is licensed under a Attribution-NonCommercial-NoDerivs 3.0 United States