Most numerical optimization methods calculate design changes by solving a subproblem obtained through the linear Taylor expansion of cost and constraint functions at every iteration. This idea of approximating or linearizing the subproblem is crucial in numerical optimization methods and needs to be understood. Every search method starts with an initial estimate of the design and iteratively imp..
