This is Robotics 501: Mathematics for Robotics from the University of Michigan.
In this video:
Weierstrass Theorem (If C is compact, and f:C -- R is continuous, then f achieves its extreme values. In other words, max and min both exist). Convex sets and convex functions, and relation to any local minimum is also a global minimum. What is a QP. Linear Programs and how to use them for minimizing the L1 and L-infinity norms of vectors in R^n.
All Fall 2018 course materials are free and accessible here and on the Github project.
More on:
ROB 501 Github: https://github.com/michiganrobotics/rob501
University of Michigan Robotics: https://robotics.umich.edu
Continue this lesson in the app
Install CourseHive on Android or iOS to keep learning while you move.