L1-Norm Methods for Convex-Cardinality Problems 
L1-Norm Methods for Convex-Cardinality Problems
by Stanford / Stephen P. Boyd
Video Lecture 14 of 20
Not yet rated
Views: 2,598
Date Added: March 29, 2009

Lecture Description

Lecture by Professor Stephen Boyd for Convex Optimization II (EE 364B) in the Stanford Electrical Engineering department. Professor Boyd continues his lecture on the Truncated Newton Method then moves into L1-Norm Methods for Convex-Cardinality Problems.

Course Index

Course Description


Continuation of 364a. Subgradient, cutting-plane, and ellipsoid methods. Decentralized convex optimization via primal and dual decomposition. Alternating projections. Exploiting problem structure in implementation. Convex relaxations of hard problems, and global optimization via branch & bound. Robust optimization. Selected applications in areas such as control, circuit design, signal processing, and communications. Course requirements include a substantial project.



Tags: Math, Math Calculus

Comments

There are no comments. Be the first to post one.
  Post comment as a guest user.
Click to login or register:
Your name:
Your email:
(will not appear)
Your comment:
(max. 1000 characters)
Are you human? (Sorry)