On the global and superlinear convergence of a discretized version of Wilson's method
type: Item
instance of: scholarly article
title: On the global and superlinear convergence of a discretized version of Wilson's method
zbMATH Open document ID: 0489.65038
DOI: 10.1007/BF02246757
author: S. Singh
published in: Computing
publication date: 1982-01-01T00:00:00Z
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
zbMATH DE Number: 3770867
zbMATH Keywords: superlinear convergence
zbMATH Keywords: minimization of a nonlinear objective function
zbMATH Keywords: nonlinear equality constraints
zbMATH Keywords: penalty-method
zbMATH Keywords: Wilson's method
zbMATH Keywords: global convergence
MaRDI profile type: Publication
cites work: A globally and quadratically convergent algorithm for general nonlinear programming problems
cites work: Quasi-Newton-Verfahren vom Rang-Eins-Typ zur Lösung unrestringierter Minimierungsprobleme. I: Verfahren und grundlegende Eigenschaften
cites work: Penalty function versus non-penalty function methods for constrained nonlinear programming problems
cites work: Über Mehrschrittverfahren der nichtlinearen Optimierung
cites work: Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
cites work: Eine Übertragung der Regula Falsi auf Gleichungen in Banachräumen I
cites work: Q4187244
full work available at URL: https://doi.org/10.1007/bf02246757
OpenAlex ID: W418314731
description: scientific article; zbMATH DE number 3770867