Convergence Theory for Unconstrained Minimization,

Abstract

Convergence theory for unconstrained minimization centers on proving which characteristics hold at point of accumulation of minimizing sequences generated by unconstrained minimization algorithms. To a great extent, convergence proofs for particular algorithms have common elements. In this paper some results have been synthesized and put in a general context. Some applications of the theory are included. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 30, 1980
Accession Number
ADA092254

Entities

People

  • Garth Philip McCormick

Organizations

  • George Washington University

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Boundaries
  • Computations
  • Contracts
  • Convergence
  • Curvature
  • Eigenvalues
  • Eigenvectors
  • Engineering
  • Inequalities
  • Iterations
  • Linear Algebra
  • Military Research
  • Nonlinear Programming
  • Sequences
  • Stationary

Readers

  • Adaptive Control and Estimation with Uncertainty in Dynamic Systems.
  • Graph Algorithms and Convex Optimization.
  • Theoretical Analysis.