Eine global and lokal überlineare knovergente regularisierung des wilson-vergahrens

DOI10.1080/02331938708843214zbMath0607.90070OpenAlexW2045183614MaRDI QIDQ3747244

Evelin Körner, Claus-Peter Richter

Publication date: 1987

Published in: Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02331938708843214

zbMATH Keywords

global convergencepenalty functionquadratic subproblemregularization of Wilson's method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Cites Work

• The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function. I. Convergence analysis
• Test examples for nonlinear programming codes
• A globally and quadratically convergent algorithm for general nonlinear programming problems
• On the global and superlinear convergence of a discretized version of Wilson's method
• A globally convergent method for nonlinear programming

This page was built for publication: Eine global and lokal überlineare knovergente regularisierung des wilson-vergahrens