Perturbed Kuhn-Tucker Points and Rates of Convergence for a Class of Nonlinear-Programming Algorithms.

Abstract

The paper establishes quantitative bounds for the variation of an isolated local minimizer for a general nonlinear program under perturbations in the objective function and constraints. These bounds are then applied to establish rates of convergence for a class of recursive nonlinear-programming algorithms. (Author)

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1973
Accession Number
AD0756343

Entities

People

  • Stephen M. Robinson

Organizations

  • University of Wisconsin–Madison

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Convergence
  • Evolutionary Algorithms
  • Heuristic Methods
  • Mathematics
  • Nonlinear Programming
  • Perturbations

Fields of Study

  • Mathematics

Readers

  • Operations Research