A family of improved secant methods via nonmonotone curvilinear paths technique for equality constrained optimization

DOI10.1016/S0377-0427(00)00576-8zbMath0989.65064MaRDI QIDQ5948567

De-Tong Zhu

Publication date: 28 July 2002

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

zbMATH Keywords

numerical experimentsnonlinear equality constrained minimization problempreconditional modified gradient pathsecant algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)

Cites Work

• Unnamed Item
• More test examples for nonlinear programming codes
• Test examples for nonlinear programming codes
• A projective quasi-Newton method for nonlinear optimization
• Local Convergence of Secant Methods for Nonlinear Constrained Optimization
• The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
• On the Local Convergence of a Quasi-Newton Method for the Nonlinear Programming Problem
• Projected Hessian Updating Algorithms for Nonlinearly Constrained Optimization
• Continuity of the null space basis and constrained optimization
• A recursive quadratic programming algorithm that uses differentiable exact penalty functions
• A Nonmonotone Line Search Technique for Newton’s Method
• Curvilinear path and trust region in unconstrained optimization: A convergence analysis
• Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations

This page was built for publication: A family of improved secant methods via nonmonotone curvilinear paths technique for equality constrained optimization