Answers are grounded in this paper and cite their sources.
The convergence behaviour of a class of iterative methods for solving the constrained minimization problem is analysed. The methods are based on the sequential minimization of a simple ditterentiable penalty function. They are sufficiently general to ensure global convergence of the iterates to the solution of the problem at an asymptotic (two-step Q-) superlinear rate. Key words, constrained optimization, quadratic penalty function, augmented Lagrangian function, convergence analysis AMS(MOS) subject classification. 65K05 1. Introduction. We
No takes yet. Share an insight, caveat, or question.
Nicholas I. M. Gould (1989) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: