Strategies for the Minimization of an Unconstrained Nonconvex Function.

Abstract

Several strategies are discussed which modify the classical form of Newton's method for minimizing an unconstrained function of several variables when at some point the Hessian matrix is not positive definite. A simple example is solved to explain the different methods. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Nov 01, 1976
Accession Number
ADA037820

Entities

People

  • Garth Philip McCormick

Organizations

  • George Washington University

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Computations
  • Convergence
  • Curvature
  • Differential Equations
  • Eigenvalues
  • Engineering
  • Equations
  • Evolutionary Algorithms
  • Mathematics
  • New York
  • Nonconvex Programming
  • Nonlinear Programming
  • Operations Research
  • Optimization
  • Security

Fields of Study

  • Mathematics

Readers

  • Operations Research