Skip to main content
Graph
Search
fr
|
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Linear Matrix Inequalities: Control Networks
Graph Chatbot
Related lectures (31)
Previous
Page 2 of 4
Next
Linear Optimization: Finding Initial BFS
Explains the process of finding an initial Basic Feasible Solution for linear optimization problems using the Simplex Algorithm.
Support Vector Machines: SVM Basics
Covers the basics of Support Vector Machines, focusing on hard-margin and soft-margin formulations.
Lagrangian Duality: Convex Optimization
Explores Lagrangian duality in convex optimization, transforming problems into min-max formulations and discussing the significance of dual solutions.
Solving Linear Programs: SIMPLEX Method
Explains the SIMPLEX method for solving linear programs and optimizing the solution through basis variable manipulation.
Network Coding: Opportunistic Routing and Coding
Explores network coding for efficient data delivery in wireless networks, optimizing packet transmissions through opportunistic routing and coding.
Introduction to Optimization and Operations Research
Covers fundamental concepts of optimization and operations research, exploring real-world examples and key topics over a semester.
Optimal Decision Making: Exercises and Applications
Covers exercises on optimal decision making, including minimizing costs and optimizing transportation networks.
Networked Control Systems: Stability and Dropout Analysis
Explores the stability of Networked Control Systems under deterministic packet drops and the estimation of the maximal drop rate.
Quantization in Networked Control Systems
Delves into the impact of quantization on networked control systems, exploring stability, performance, and design trade-offs.
Convex Optimization: Exercises
Covers exercises on convex optimization, focusing on formulating and solving optimization problems using YALMIP and solvers like GUROBI and MOSEK.
