Linear Systems and Optimization: Convex Optimization II
Peer Review for material titled "Linear Systems and Optimization: Convex Optimization II"
User Rating for material titled "Linear Systems and Optimization: Convex Optimization II"
Member Comments for material titled "Linear Systems and Optimization: Convex Optimization II"
Personal Collections for material titled "Linear Systems and Optimization: Convex Optimization II"
Learning Exercises for material titled "Linear Systems and Optimization: Convex Optimization II"
Accessibility Info for material titled "Linear Systems and Optimization: Convex Optimization II"
Search all MERLOT
Click here to go to your profile
Select to go to your workspace
Click here to go to your Dashboard Report
Click here to go to your Content Builder
Click here to log out
Search Terms
Enter username
Enter password
Please give at least one keyword of at least three characters for the search to work with. The more keywords you give, the better the search will work for you.
select OK to launch help window
cancel help

MERLOT II




        

Search > Material Results >

Linear Systems and Optimization: Convex Optimization II

        

Linear Systems and Optimization: Convex Optimization II

Logo for Linear Systems and Optimization: Convex Optimization II
Convex Optimization II is one of the ten free courses being offered to the public through Stanford Engineering Everywhere. The course belongs to the Linear Systems and Optimization series and is taught by Professor Stephen Boyd of Stanford University's Electrical Engineering Department. The course covers subgradient, cutting-plane, and ellipsoid methods. Decentralized convex optimization via primal and dual decomposition. Alternating projections. Exploiting problem structure in... More
Material Type: Online Course
Technical Format: Video
Date Added to MERLOT: November 21, 2008
Date Modified in MERLOT: November 21, 2008
Author:
Send email to see-information@lists.stanford.edu
Keywords: Circuit Design, Ellipsoid Methods, Primal Decomposition, Stanford University, Cutting-plane, Stephen Boyd, Alternating Projections, Dual Decomposition, Robust Optimization, Electrical Engineering, Subgradient, Convex Optimization, Global Optimization, Stanford Engineering Everywhere, Signal Processing

Details

  • Reviewed by members of Editorial board for inclusion in MERLOT.
    Editor Review
    Very good quality; in queue to be peer reviewed
    avg: 5 rating
  • User Rating (not rated)
  • Comments (none)
  • Learning Exercises (none)
  • Personal Collections (none)
  • Accessibility Info (none)

About

Primary Audience: College Lower Division, College Upper Division, Graduate School, College General Ed, Professional
Mobile Compatibility: Not specified at this time
Technical Requirements: Lecture videos are offered via Silverlight, iTunes, YouTube, and downloadable .wmv and .mp4 torrents. Course materials in the form of .pdf files are also available for download.
Language: English
Material Version: First Release
Cost Involved: no
Source Code Available: no
Accessiblity Information Available: no
Creative Commons: Creative Commons License
This work is licensed under a Attribution-NonCommercial-ShareAlike 3.0 United States

Connections





QR Code for this Page

Browse in Categories

Discussion

Discussion for Linear Systems and Optimization: Convex Optimization II

Log in to participate in the discussions or Register if you are not already a MERLOT member.

Return to Top of Page