Variants of the reduced Newton method for nonlinear equality constrained optimization problems

DOI10.1080/02331938608843194zbMath0625.90075OpenAlexW2040451743MaRDI QIDQ3028735

No author found.

Publication date: 1986

Published in: Optimization (Search for Journal in Brave)

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

zbMATH Keywords

sequential quadratic programmingequality constrained optimizationLocal convergenceNewton-type generalized reduced gradient algorithm

Mathematics Subject Classification ID

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

Related Items (3)

Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization ⋮ An efficient algorithm for a class of equality-constrained optimization problems ⋮ On the local and global convergence of a reduced Quasi-Newton method¹

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Consistent approximations in Newton-type decomposition methods
• On the R-order of coupled sequences
• Computing turning points of curves implicitly defined by nonlinear equations depending on a parameter
• Scaling nonlinear programs
• Diagonalized multiplier methods and quasi-Newton methods for constrained optimization
• Generalized reduced gradient method as an extension of feasible direction methods
• A stable approach to Newton's method for general mathematical programming problems in R\(^n\)
• GAUSS-newton-like methods for nonlinear least squares with equality constraints-local convergence and applications
• An efficient algorithm for a class of equality-constrained optimization problems
• Efficiently Converging Minimization Methods Based on the Reduced Gradient
• Some Efficient Algorithms for Solving Systems of Nonlinear Equations

This page was built for publication: Variants of the reduced Newton method for nonlinear equality constrained optimization problems