This chapter is concerned with presenting algorithms for finding the optimal points of a continuous function. As was pointed out in the previous chapter, there exists a body of knowledge called classical optimization which provides an underlying theory for the solution of such problems. We now use that theory to develop methods which are designed to solve the large nonlinear optimization problems which occur in real-world applications.
KeywordsNonlinear Programming Hessian Matrix Feasible Region Pattern Search Unconstrained Optimization
Unable to display preview. Download preview PDF.