
Lecture 44 of 56 · Convex Optimization in Control
Ashish Ranjan Hota
Convex Optimization in Control · 56 lectures
56 lectures
Introduction
Optimal Solution and Optimality Conditions
Convex Sets
Convex Functions
Convex Functions (Contd.)
Lecture 6
Linear Programming
Linear Programming Duality
LP and Lagrangian Duality
Lagrangian Duality
Programming Demonstration
Programming Demonstration (Contd.)
Linear Matrix Inequalities
14: Linear Matrix Inequalities
15: Linear Matrix Inequalities
Dynamical Systems and Lyapunov Stability
Continuous-time LTI System
Lyapunov Stability and LMIs
D-Stability
Programming Demo
Controllability
Luenberger Observers
Analysis for Discrete-time Systems
25: Programming Demo
26: Programming Demo
Signal Norms
H 2 and H Inf Spaces
LMIs for H Inf Norm
31: Programming Demo
H 2 Norm and LMIs
H 2 and H Infinity Optimal Observer Design
35: Programming Demo
Optimal Control Framework
Well-Posedness and Stability
40: Programming Demo
H-Infinity Norm for Discrete-Time LTI Systems
H-2 Norm for Discrete-Time LTI Systems
Stability Notions for Uncertain Systems
45: Programming Demo
Dissipative Dynamical Systems
Dissipative LTI Systems and LMIs
Representing Uncertain Systems
Integral Quadratic Constraints
LMI for Robust L2 gain via IQC
IQCs for Discrete-Time Systems
Parametric Norm-Bounded Uncertainty
53: Programming Demo
Gradient -based Algorithms
Convergence of Gradient Descent
51: IQCs for Discrete-Time Systems
Convergence under Smoothness and Strong Convexity
Convergence under Smoothness and Strong Convexity (Contd.)
IQC and Programming Demo
59: IQC and Programming Demo
Concluding Remarks and Outlook
55: Convergence of Gradient Descent