A subspace adaptation of the Coleman-Li trust region and interior method is proposed for solving large-scale bound-constrained minimization problems. This method can be implemented with either sparse Cholesky factorization or conjugate gradient computation. Under reasonable conditions the convergence properties of this subspace trust region method are as strong as those of its full-space version. Computational
No takes yet. Share an insight, caveat, or question.
Branch et al. (1999) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: