The Unconstrained Minimization Problem.
Abstract
Considered within this paper is the problem of minimization of a function of unconstrained variables. A wide variety of solutions to this problem is presented and the possible advantages of each method are discussed. For the purpose of this paper these techniques are divided into four broad categories: general search directions; conjugate search direction; Cauchy's Steepest Descent and Newton's method; and variable metric methods. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Jun 01, 1971
- Accession Number
- AD0727690
Entities
People
- Gary Charles Meyer
Organizations
- Naval Postgraduate School