Algorithmic Methods in Nonlinear Programming

Catalog description

Introduction to methods for obtaining approximate solutions to unconstrained and constrained minimization problems of moderate size. Emphasis on geometrical interpretation and actual coordinate descent, steepest descent, Newton and quasi-Newton methods, conjugate gradient search, gradient projection and penalty function methods for constrained problems. Specialized problems and algorithms treated as time permits.