Answers are grounded in this paper and cite their sources.
In this paper we propose a new local quasi-Newton method to solve the equality constrained nonlinear programming problem. The pivotal feature of the algorithm is that a projection of the Hessian of the Lagrangian is approximated by a sequence of symmetric positive definite matrices. The matrix approximation is updated at every iteration by a projected version of the DFP or BFGS formula: this involves two evaluations of the Lagrangian gradient per iteration. We establish that the method is locally convergent and the sequence of x-values converges to the solution at a 2-step Q-superlinear rate.
No takes yet. Share an insight, caveat, or question.
Coleman et al. (1984) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: