Newton's method for singular constrained optimization problems

DOI10.1007/BF01442181zbMath0563.65042MaRDI QIDQ1057627

Ekkehard W. Sachs

Publication date: 1984

Published in: Applied Mathematics and Optimization (Search for Journal in Brave)

zbMATH Keywords

rate of convergenceconstrained optimizationBanach spacesuperlinear convergencesingular problems

Mathematics Subject Classification ID

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

Related Items

A projected Newton method for minimization problems with nonlinear inequality constraints, Convergence of algorithms for perturbed optimization problems, Rates of convergence for adaptive Newton methods

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The effect of perturbations on the convergence rates of optimization algorithms
• Positive control for quasimonotone systems of differential equations
• Notwendige Optimalitätsbedingungen und ihre Anwendung
• Newton-Goldstein convergence rates for convex constrained minimization problems with singular solutions
• On Newton's method
• Extension of Newton's method to nonlinear functions with values in a cone
• Newton’s Method and the Goldstein Step-Length Rule for Constrained Minimization Problems
• Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
• Quadratische Approximationsmethoden zur konvexen Optimierung
• Convergence of methods of feasible directions in extremal problems
• Minimization methods based on approximation of the initial functional by a convex functional