Unconstrained Minimization by Interpolation: Rates of Convergence.

Abstract

We analyze the rate of convergence of a class of algorithms based on n-dimensional interpolation. In particular, we present a class of algorithms which use first order information only, while maintaining quadratic convergence. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1981
Accession Number
ADA114115

Entities

People

  • J. Barzilai

Organizations

  • University of Texas at Austin

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Convergence
  • Difference Equations
  • Equations
  • Interpolation
  • Mathematical Analysis
  • Military Research
  • New York
  • Nonlinear Programming
  • Numerical Analysis
  • Polynomials
  • Sequences
  • Steepest Descent Method
  • United States
  • United States Government
  • Universities

Fields of Study

  • Computer science

Readers

  • Approximation Theory.