Local and Superlinear Convergence of Structural Secant Methods from the Convex Class

Abstract

In this paper, the authors develop a unified theory for establishing the local and q-superlinear convergence of the secant methods from the convex class that takes advantage of the structure present in the Hessian in constructing approximate Hessians. As an application of this theory, they show the local and q-superlinear convergence of any structured secant method from the convex class for the constrained optimization problem and the nonlinear least-squares problem. Particular cases of these methods are the SQP augmented scale BFGS and DFP secant methods for constrained optimization problems introduced by Tapia. Another particular case, for which local and q-superlinear convergence is proved for the first time here, is the Al-Baali and Fletcher modification of the structured BFGS secant method considered by Dennis, Gay, and Welsch for the nonlinear least-squares problem and implemented in the current version of the NL2SOL code.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 1988
Accession Number
ADA455311

Entities

People

  • Hector J. Martinez

Organizations

  • Rice University

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Applied Mathematics
  • Availability
  • Classification
  • Colombia
  • Contracts
  • Convergence
  • Cooperation
  • Information Operations
  • Instructions
  • Mathematics
  • Monitoring
  • Operations Research
  • Optimization
  • Security

Readers

  • Operations Research