A reduced Hessian method for constrained optimization

DOI10.1007/BF01299153zbMath0794.90065MaRDI QIDQ1312087

Aiping Liao

Publication date: 19 January 1994

Published in: Computational Optimization and Applications (Search for Journal in Brave)

zbMATH Keywords

global convergencebasis-independent algorithmreduced Hessian methods

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (1)

A cautious BFGS update for reduced Hessian SQP

Cites Work

• Test examples for nonlinear programming codes
• A globally convergent method for nonlinear programming
• The local convergence of the Byrd-Schnabel algorithm for constrained optimization
• An analysis of reduced Hessian methods for 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
• Reduced quasi-Newton methods with feasibility improvement for nonlinearly constrained optimization
• The watchdog technique for forcing convergence in algorithms for constrained optimization
• Sequential Quadratic Programming Methods Based on Approximating a Projected Hessian Matrix
• Unnamed Item

This page was built for publication: A reduced Hessian method for constrained optimization