A convergent secant method for constrained optimization

DOI10.1007/BF03167225zbMath0809.65061OpenAlexW1971756485MaRDI QIDQ1335568

De-Tong Zhu, Zhang, Jianzhong

Publication date: 16 October 1994

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

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

zbMATH Keywords

algorithmconvergenceconstrained optimizationsecant methodprojective matrixtrust region methods

Mathematics Subject Classification ID

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

Related Items

A two-piece update of projected Hessian algorithm with nonmonotonic trust region method for constrained optimization ⋮ Nonmonotonic projected algorithm with both trust region and line search for constrained optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Projected quasi-Newton algorithm with trust region for constrained optimization
• A trust region algorithm for equality constrained optimization
• Local Convergence of Secant Methods for Nonlinear Constrained 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 Trust Region Algorithm for Nonlinearly Constrained Optimization
• A Convergence Theory for a Class of Quasi-Newton Methods for Constrained Optimization
• On Secant Updates for Use in General Constrained Optimization