Stephen Boyd
Samsung Professor in the School of Engineering & Professor… · Stanford University · Distinguished · author of Convex Optimization
Samsung Professor of Engineering at Stanford whose textbook and EE364a lectures established convex optimization as a core language across control, signal processing, and ML.
- lectures
- 58
- series
- 2
- hours
- 71
Start here
- Mathematical Optimization & Why Convexity Is the Watershedfrom Boyd & Vandenberghe, Convex Optimization

- QR Factorization & Least-Squares Approximation of Overdetermined Systemsfrom Boyd & Vandenberghe, Convex Optimization

- Lagrange Duality, Dual Decomposition & Generalized Inequalitiesfrom Boyd & Vandenberghe, Convex Optimization

Series and courses
Stanford EE263: Introduction to Linear Dynamical Systems
Open the course
- 1Course Overview: Applied Linear Algebra & Linear Dynamical Systems
- 2Linear Functions, Superposition & Matrix Representations
- 3Linear Algebra Review: Range, Nullspace & Matrix Factorizations
- 4Orthonormal Sets of Vectors, Gram-Schmidt & QR Factorization
Show 16 moreShow fewer
- 5QR Factorization & Least-Squares Approximation of Overdetermined Systems
- 6Applications of Least-Squares Estimation: System Identification & Filtering
- 7Regularized Least Squares, Multi-Objective Optimization & Gauss-Newton
- 8Least-Norm Solutions of Underdetermined Equations
- 9Autonomous Linear Dynamical Systems
- 10Autonomous Linear Dynamical Systems in Electrical Engineering
- 11Solutions via Laplace Transform and Matrix Exponentials
- 12Matrix Exponentials, Eigenvectors, and Diagonalization in LDS
- 13Generalized Eigenvectors, Diagonalization, and Jordan Canonical Form
- 14Applications of Jordan Canonical Form in LDS and Electrical Engineering
- 15Inputs, Outputs, and Symmetric Matrices in Linear Dynamical Systems
- 16Symmetric Matrices, Quadratic Forms, Matrix Norm, and SVDs in LDS
- 17Applications of Singular Value Decomposition in LDS and Electrical Engineering
- 18Applications of SVD, Controllability, and State Transfer in Electrical Engineering
- 19Controllability and State Transfer in Modern Electrical Engineering
- 20Observability and State Estimation
Stanford EE364a: Convex Optimization I
Open the course
- 1Mathematical Optimization & Why Convexity Is the Watershed
- 2Affine Sets, Convex Sets, Cones & Hyperplanes
- 3Convex Functions — First/Second-Order Conditions & Epigraphs
- 4Convex Optimization Problems — LP, QP, SOCP & SDP
Show 33 moreShow fewer
- 5The Lagrangian, Dual Function & Slater's Condition
- 6Saddle-Point Interpretation, KKT Conditions & Perturbation
- 7Geometric Interpretation of Duality, Sensitivity & Theorems of Alternatives
- 8Lagrange Duality, Dual Decomposition & Generalized Inequalities
- 9Duality Theory
- 10Approximation and Fitting
- 11Statistical Estimation
- 12Geometric Problems
- 13Geometric Problems Continued
- 14Numerical Linear Algebra Background
- 15Unconstrained Minimization
- 16Equality Constrained Minimization
- 17Equality Constrained Minimization Continued
- 18Interior-Point Methods
- 19Advanced Topics and Applications
- 20Subgradients: Subdifferential Calculus & Optimality Conditions
- 21Subgradients II: Directional Derivatives, Cutting Planes & Quasiconvexity
- 22Subgradient Methods: Step-Size Rules, Convergence & Polyak Steps
- 23Subgradient Methods for Constrained Problems
- 24Convex Optimization II: Stochastic Programming and Cutting-Plane Methods
- 25Convex Optimization II: Localization and Cutting-Plane Methods
- 26Convex Optimization II: Analytic Center Cutting-Plane and Ellipsoid Methods
- 27Convex Optimization II: Primal and Dual Decomposition Methods
- 28Convex Optimization II: Primal and Dual Decomposition Methods
- 29Convex Optimization II: Decomposition Applications
- 30Sequential Convex Programming
- 31Convex Optimization II: Sequential Convex Programming and Conjugate Gradient Methods
- 32Convex Optimization II: Conjugate Gradient and Truncated Newton Methods
- 33Convex Optimization II: Truncated Newton Method and L1-Norm Methods
- 34Convex Optimization II: L1 Methods for Convex-Cardinality Problems
- 35Convex Optimization II: Model Predictive Control
- 36Convex Optimization II: Stochastic Model Predictive Control and Branch-and-Bound Methods
- 37Convex Optimization II: Branch-and-Bound Methods
In these lectures
- Most general optimization problems are NP-hard and cannot be solved globally in polynomial time.Mathematical Optimization & Why Convexity Is the Watershed
- An orthogonal matrix preserves lengths, distances, inner products, and angles between vectors.QR Factorization & Least-Squares Approximation of Overdetermined Systems
- The Lagrangian incorporates inequality and equality constraints into the objective function via multipliers.Lagrange Duality, Dual Decomposition & Generalized Inequalities
Draws on
People cited in the lectures, at the moment of the citation.
- George DantzigAssociated with the modern era of linear programming at Stanford.
- von NeumannKnew about linear programming.
- Yurii NesterovPolynomial-time interior-point methods for nonlinear convex optimization, 1994
- Arkadi NemirovskiPolynomial-time interior-point methods for nonlinear convex optimization, 1994
- Magnus HestenesProposed the conjugate gradient method in 1952
- Eduard StiefelProposed the conjugate gradient method in 1952
Playlists
2About
Samsung Professor of Engineering at Stanford whose textbook and EE364a lectures established convex optimization as a core language across control, signal processing, and ML.
Same subject, Engineering & Robotics
Connections
68Their places, courses, books and lectures.
Scholar1
Institutions3
Courses2
Book1
Lectures58
- Mathematical Optimization & Why Convexity Is the Watershed
- QR Factorization & Least-Squares Approximation of Overdetermined Systems
- Lagrange Duality, Dual Decomposition & Generalized Inequalities
- Regularized Least Squares, Multi-Objective Optimization & Gauss-Newton
- Applications of Least-Squares Estimation: System Identification & Filtering
- Geometric Problems Continued
Show 52 moreShow fewer
- Convex Optimization with Abstract Linear Operators
- Symmetric Matrices, Quadratic Forms, Matrix Norm, and SVDs in LDS
- Course Overview: Applied Linear Algebra & Linear Dynamical Systems
- Statistical Estimation
- Solutions via Laplace Transform and Matrix Exponentials
- Unconstrained Minimization
- Geometric Interpretation of Duality, Sensitivity & Theorems of Alternatives
- Linear Functions, Superposition & Matrix Representations
- Subgradients: Subdifferential Calculus & Optimality Conditions
- Applications of Singular Value Decomposition in LDS and Electrical Engineering
- Equality Constrained Minimization
- Orthonormal Sets of Vectors, Gram-Schmidt & QR Factorization
- Applications of SVD, Controllability, and State Transfer in Electrical Engineering
- Geometric Problems
- Linear Algebra Review: Range, Nullspace & Matrix Factorizations
- Advanced Topics and Applications
- Generalized Eigenvectors, Diagonalization, and Jordan Canonical Form
- Subgradient Methods: Step-Size Rules, Convergence & Polyak Steps
- Interior-Point Methods
- Observability and State Estimation
- Convex Optimization Problems — LP, QP, SOCP & SDP
- Convex Optimization II: Stochastic Programming and Cutting-Plane Methods
- Duality Theory
- Approximation and Fitting
- Autonomous Linear Dynamical Systems in Electrical Engineering
- Least-Norm Solutions of Underdetermined Equations
- Autonomous Linear Dynamical Systems
- Convex Optimization II: Truncated Newton Method and L1-Norm Methods
- Equality Constrained Minimization Continued
- Controllability and State Transfer in Modern Electrical Engineering
- Subgradients II: Directional Derivatives, Cutting Planes & Quasiconvexity
- Inputs, Outputs, and Symmetric Matrices in Linear Dynamical Systems
- Matrix Exponentials, Eigenvectors, and Diagonalization in LDS
- Applications of Jordan Canonical Form in LDS and Electrical Engineering
- Convex Optimization II: Primal and Dual Decomposition Methods
- Sequential Convex Programming
- Numerical Linear Algebra Background
- Convex Functions — First/Second-Order Conditions & Epigraphs
- Convex Optimization II: Model Predictive Control
- Convex Optimization II: Stochastic Model Predictive Control and Branch-and-Bound Methods
- Convex Optimization II: Primal and Dual Decomposition Methods
- The Lagrangian, Dual Function & Slater's Condition
- Saddle-Point Interpretation, KKT Conditions & Perturbation
- Subgradient Methods for Constrained Problems
- Convex Optimization II: Sequential Convex Programming and Conjugate Gradient Methods
- Convex Optimization II: Branch-and-Bound Methods
- Convex Optimization II: L1 Methods for Convex-Cardinality Problems
- Convex Optimization II: Decomposition Applications
- Convex Optimization II: Conjugate Gradient and Truncated Newton Methods
- Convex Optimization II: Localization and Cutting-Plane Methods
- Affine Sets, Convex Sets, Cones & Hyperplanes
- Convex Optimization II: Analytic Center Cutting-Plane and Ellipsoid Methods







