A convergent secant method for constrained optimization

DOI10.1007/BF03167225zbMath0809.65061MaRDI QIDQ1335568

Zhang, Jianzhong, De-Tong Zhu

Publication date: 16 October 1994

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

zbMATH Keywords

algorithm; convergence; constrained optimization; secant method; projective matrix; trust region methods

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C30: Nonlinear programming

Related Items

Nonmonotonic projected algorithm with both trust region and line search for constrained optimization, A two-piece update of projected Hessian algorithm with nonmonotonic trust region method 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