On the global and superlinear convergence of a discretized version of Wilson's method

DOI10.1007/BF02246757zbMath0489.65038OpenAlexW418314731MaRDI QIDQ1166896

S. Singh

Publication date: 1982

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02246757

zbMATH Keywords

global convergencesuperlinear convergencenonlinear equality constraintsminimization of a nonlinear objective functionpenalty-methodWilson's method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Related Items (6)

A hybrid method fur linearly constrained optimisation problems ⋮ A globally convergent version of a general recursive algorithm for nonlinear programming ⋮ Eine global and lokal überlineare knovergente regularisierung des wilson-vergahrens ⋮ Newton-type methods for nonlinearly constrained programming problems-algorithms and theory ⋮ On a class fo hybrid methods for smooth constrained optimization ⋮ On the globalization of Wilson-type optimization methods by means of generalized reduced gradient methods

Cites Work

• Unnamed Item
• A globally and quadratically convergent algorithm for general nonlinear programming problems
• Quasi-Newton-Verfahren vom Rang-Eins-Typ zur Lösung unrestringierter Minimierungsprobleme. I: Verfahren und grundlegende Eigenschaften
• Über Mehrschrittverfahren der nichtlinearen Optimierung
• Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
• Penalty function versus non-penalty function methods for constrained nonlinear programming problems
• Eine Übertragung der Regula Falsi auf Gleichungen in Banachräumen I

This page was built for publication: On the global and superlinear convergence of a discretized version of Wilson's method