Answers are grounded in this paper and cite their sources.
In order to achieve a robust implementation of methods for nonlinear programming problems, it is necessary to devise a procedure which can be used to test whether or not a prospective step would yield a “better” approximation to the solution than the current iterate. In this paper, we present a family of descent or merit functions which are shown to be compatible with local Q-superlinear convergence of Newton and quasi-Newton methods. A simple algorithm is used to verify that good descent and convergence properties are possible using this merit function.
No takes yet. Share an insight, caveat, or question.
Boggs et al. (1984) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: