A correction is made to the paper entitled “Global convergence of a class of trust region algorithms for optimization with simple bounds” [Corm, Gould, and Toint, SIAM J. Numer. Anal., 25 (1988), pp. 433–460]. First, an error is pointed out in the proof of the fact that the correct set of active bounds is determined after a finite number of iterations. A new proof of the relevant theorem is given.
No takes yet. Share an insight, caveat, or question.
Conn et al. (1989) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: