On the Rate of 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 each algorithm in this class converges globally and superlinearly. Various results on the rate of the superlinear convergence are obtained. (Author)

Open PDF

Document Details

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

Entities

People

  • Klaus Ritter

Organizations

  • University of Wisconsin–Madison

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Applied Mathematics
  • Continents
  • Contracts
  • Convergence
  • Evolutionary Algorithms
  • Geographic Regions
  • Heuristic Methods
  • Mathematical Programming
  • Mathematics
  • Military Research
  • North America
  • North Carolina
  • Operations Research
  • United States

Fields of Study

  • Mathematics

Readers

  • Operations Research