Mathematical optimization is the process of finding the best element from a set of available alternatives, based on some criterion. It is divided into two subfields: discrete and continuous optimization. Optimization problems arise in many quantitative disciplines and have been studied for centuries. The goal is to maximize or minimize a real function by systematically choosing input values from an allowed set.
Stanford University
Spring 2022
CS 168 provides a comprehensive introduction to modern algorithm concepts, covering hashing, dimension reduction, programming, gradient descent, and regression. It emphasizes both theoretical understanding and practical application, with each topic complemented by a mini-project. It's suitable for those who have taken CS107 and CS161.
No concepts data
+ 57 more concepts