Lecture Description
Professor Stephen Boyd, of the Stanford University Electrical Engineering department, continues his lecture on convex functions in electrical engineering for the course, Convex Optimization I (EE 364A).
Course Index
- Introduction
- Convex Sets
- Convex and Concave Functions
- Convex Functions in Electrical Engineering
- Convex Optimization Problems
- Convex Optimization Problems (cont.)
- Convex Optimization Problems (cont.)
- Duality in Electrical Engineering
- Duality in Electrical Engineering (cont.)
- Approximation and Fitting Within Convex Optimization
- Statistical Estimation
- Geometric Problems
- Geometric Problems (cont.)
- Numerical Linear Algebra
- Unconstrained Minimization in Electrical Engineering
- Equality Constrained Minimization in Electrical Engineering
- Equality Constrained Minimization in Electrical Engineering (cont.)
- Interior-Point Methods of Electrical Engineering
- Final Lecture
Course Description
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.
Tags: Math, Math Convex