Course Hive
Search

Welcome

Sign in or create your account

Continue with Google
or
ROB 501: Weierstrass Theorem
Play lesson

Robotics 501: Mathematics for Robotics - ROB 501: Weierstrass Theorem

5.0 (4)
27 learners

What you'll learn

This course includes

  • 33.5 hours of video
  • Certificate of completion
  • Access on mobile and TV

Summary

Keywords

Full Transcript

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

Course Hive

Continue this lesson in the app

Install CourseHive on Android or iOS to keep learning while you move.

Related Courses

FAQs

Course Hive
Download CourseHive
Keep learning anywhere