GRADIENT TECHNIQUES FOR NONLINEAR PROGRAMMING

Abstract

The intent of this analysis is to supply the practitioner of optimization methods with the theorems and algorithms of the several recently developed gradient techniques used for finding a constrained maximum of a nonlinear function. Three techniques are considered: (1) the ArrowHurwicz method, (2) the gradient projection method, and (3) the response surface technique. Proofs of theorems are omitted except where they shed considerable light on the ideas involved.Appropriate references are cited in which proofs and further elaboration may be found. (Author)

Document Details

Document Type
Technical Report
Publication Date
Feb 27, 1962
Accession Number
AD0275941

Entities

People

  • Edward L. Pugh

Organizations

  • System Development Corporation

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Evolutionary Algorithms
  • Heuristic Methods
  • Mathematical Programming
  • Mathematics
  • Nonlinear Programming
  • Optimization

Fields of Study

  • Mathematics

Readers

  • Operations Research
  • Theoretical Analysis.