M esd Iterative Optimization Procedures ESD. 71 Most optimization algorithms are iterative x?=x9-1+as Where g=iteration number S=vector search direction ascalar distance and the initial solution x is given The algorithm determines the search direction S according to some criteria Gradient-based algorithms use gradient information to decide where to move o Massachusetts Institute of Technology -Prof de Weck and Prof Willcox Engineering Systems Division and Dept of Aeronautics and Astronautics10 © Massachusetts Institute of Technology - Prof. de Weck and Prof. Willcox Engineering Systems Division and Dept. of Aeronautics and Astronautics Iterative Optimization Procedures Iterative Optimization Procedures Most optimization algorithms are iterative: where q=iteration number S=vector search direction D=scalar distance and the initial solution x0 is given The algorithm determines the search direction S according to some criteria. Gradient-based algorithms use gradient information to decide where to move. q q qq 1 D  xx S