Linear Systems and Optimization: Convex Optimization I
Peer Review for material titled "Linear Systems and Optimization: Convex Optimization I"
User Rating for material titled "Linear Systems and Optimization: Convex Optimization I"
Member Comments for material titled "Linear Systems and Optimization: Convex Optimization I"
Bookmark Collections for material titled "Linear Systems and Optimization: Convex Optimization I"
Course ePortfolios for material titled "Linear Systems and Optimization: Convex Optimization I"
Learning Exercises for material titled "Linear Systems and Optimization: Convex Optimization I"
Accessibility Info for material titled "Linear Systems and Optimization: Convex Optimization I"
Please enter a Bookmark title
Please limit Bookmark title to 65 characters
Please enter a description
Please limit Bookmark title to 4000 characters
A Bookmark with this title already existed.
Please limit a note about this material to 2048 characters
Search all MERLOT
Select to go to your profile
Select to go to your workspace
Select to go to your Dashboard Report
Select to go to your Content Builder
Select 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 I

        

Linear Systems and Optimization: Convex Optimization I

Logo for Linear Systems and Optimization: Convex Optimization I
Convex Optimization I 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 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... 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: Linear Programs, Convex Analysis, Quadratic Programs, Theorems of Alternative, Semidefinite Programming, Digital Circuit Design, Stanford University, Computational Geometry, Stephen Boyd, Analog Circuit Design, Convex Optimization, Duality Theory, Stanford Engineering Everywhere, Optimality Conditions, Least Squares, Signal Processing

Quality

  • 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)
  • Bookmark Collections (none)
  • Course ePortfolios (none)
  • Accessibility Info (none)

  • Rate this material
  • Create a learning exercise
  • Add accessibility information
  • Pick a Bookmark Collection or Course ePortfolio to put this material in or scroll to the bottom to create a new Bookmark Collection
    Name the Bookmark Collection to represent the materials you will add
    Describe the Bookmark Collection so other MERLOT users will know what it contains and if it has value for their work or teaching. Other users can copy your Bookmark Collection to their own profile and modify it to save time
    Edit the information about the material in this {0}
    Submitting Bookmarks...

About

Primary Audience: College General Ed, College Lower Division, College Upper Division, Graduate School, 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

Discussion

Discussion for Linear Systems and Optimization: Convex Optimization I

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

Return to Top of Page