Newton-type methods for nonlinearly constrained programming problems-algorithms and theory

DOI10.1080/02331938808843355zbMath0654.90075OpenAlexW2041093330MaRDI QIDQ3801356

Helmut Kleinmichel, Klaus Schönefeld

Publication date: 1988

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

Newton-type methodstwice continuously differentiable functionssquared slack variablesKuhn- Tucker optimality conditionslocally superlinearly convergentsquared multipliers

Mathematics Subject Classification ID

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

Related Items (5)

Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments ⋮ A special newton-type optimization method ⋮ Optimality Conditions for Problems over Symmetric Cones and a Simple Augmented Lagrangian Method ⋮ Global convergence of QPFTH method for large-scale nonlinear sparse constrained optimization ⋮ On a class fo hybrid methods for smooth constrained optimization

Cites Work

• On the globalization of Wilson-type optimization methods by means of generalized reduced gradient methods
• On a Newton-like method for constrained nonlinear minimization via slack variables
• Enlarging the region of convergence of Newton's method for constrained optimization
• 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 quadratically-convergent algorithm for general nonlinear programming problems
• Unnamed Item
• Unnamed Item

This page was built for publication: Newton-type methods for nonlinearly constrained programming problems-algorithms and theory