Global and Superlinear Convergence of a Class of Variable Metric Methods.

Abstract

This paper considers a class of variable metric methods for unconstrained minimization. Without requiring exact line searches it is shown that, under appropriate assumptions on the function to be minimized, each algorithm in this class converges globally and superlinearly. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1979
Accession Number
ADA070204

Entities

People

  • Klaus Ritter

Organizations

  • University of Wisconsin–Madison

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Capillary Electrophoresis
  • Computations
  • Contracts
  • Convergence
  • Heuristic Methods
  • Mathematical Programming
  • Mathematics
  • Military Research
  • Numbers
  • Numerical Analysis
  • Operations Research
  • Sequences
  • Square Roots
  • Stereolithography
  • Terrorism
  • Theorems

Fields of Study

  • Mathematics

Readers

  • Operations Research