Numerical Algorithms for Nonlinearly Constrained Optimization.
Abstract
This dissertation is concerned with the development and numerical implementation of algorithms for solving finite dimensional optimization problems. Special emphasis is given to robustness, by which is meant the ability of an algorithm to cope with adverse circumstances, whether due to pathologies of a particular problem or to the shortcomings of finite precision computer arithmetic. A uniform framework is developed in which a common set of techniques may be applied to all of the standard problems of optimization. The algorithms are based on Newton-like methods implemented in a robust manner by means of hybrid, curved line searches and stable linear algebra techniques. Developed first in the context of systems of nonlinear equations, nonlinear least squares, and unconstrained minimization, the algorithms are combined and extended to include problems with equality or inequality constraints. Constrained problems are handled by means of separate line searches in the range and null spaces of the matrix of constraint normals. The classical Lagrangian is modified to allow the same Newton-like methods to be applied to inequality constraints. Test results are presented which show the validity and promise of the methods developed in this dissertation. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Apr 01, 1978
- Accession Number
- ADA057962
Entities
People
- Michael Thomas Heath
Organizations
- Stanford University