Optimization Find the “best” feasible solution under constraints
Optimization algorithms are search methods
Examples: 00 - Deep Learning Table of Contents Generalized Iterative Closest Point (GICP) Newton’s Method Gauss-Newton Method
A search problem is a superset, for a problem X, we need to find a solution that satisfies X.
A search problem is shaped by:
Objective - refers to Goal and Problem Formulation Representation -