A globally and quadratically convergent algorithm for general nonlinear programming problems

DOI10.1007/BF02241780zbMath0458.65053OpenAlexW1589869438MaRDI QIDQ1151728

J. Bräuninger, Michael J. Best, Klaus Ritter, Stephen M. Robinson

Publication date: 1981

Published in: Computing (Search for Journal in Brave)

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

zbMATH Keywords

global convergencequadratic convergencepenalty algorithmsRobinson's method

Mathematics Subject Classification ID

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

Related Items (9)

Dual techniques for constrained optimization ⋮ A hybrid method fur linearly constrained optimisation problems ⋮ Eine global and lokal überlineare knovergente regularisierung des wilson-vergahrens ⋮ Globally convergent version of Robinson's algorithm for general nonlinear programming problems without using derivatives ⋮ On the global and superlinear convergence of a discretized version of Wilson's method ⋮ Newton-type methods for nonlinearly constrained programming problems-algorithms and theory ⋮ A class on nonmonotone stabilization methods in unconstrained optimization ⋮ 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
• Unnamed Item
• Unnamed Item
• A Class of Accelerated Conjugate Direction Methods for Linearly Constrained Minimization Problems
• Penalty function versus non-penalty function methods for constrained nonlinear programming problems
• A superlinearly convergent method for minimization problems with linear inequality constraints
• A computational comparison of some non-linear programs
• A quadratically-convergent algorithm for general nonlinear programming problems

This page was built for publication: A globally and quadratically convergent algorithm for general nonlinear programming problems