Solving large-scale constrained least-squares problems
暂无分享,去创建一个
[1] Jorge J. Moré,et al. Computing a Trust Region Step , 1983 .
[2] Thomas F. Coleman,et al. Computing a Trust Region Step for a Penalty Function , 1990, SIAM J. Sci. Comput..
[3] Å. Björck. Least squares methods , 1990 .
[4] Danny C. Sorensen,et al. Implicit Application of Polynomial Filters in a k-Step Arnoldi Method , 1992, SIAM J. Matrix Anal. Appl..
[5] Åke Björck,et al. An implicit shift bidiagonalization algorithm for ill-posed systems , 1994 .
[6] R. Plato,et al. On pseudo-optimal parameter choices and stopping rules for regularization methods in Banach spaces , 1996 .
[7] D. Sorensen. Newton's method with a model trust region modification , 1982 .
[8] G. Golub,et al. Quadratically constrained least squares and quadratic problems , 1991 .
[9] M. R. Abdel-Aziz. Safeguarded use of the implicit restarted lanczos technique for solving non‐linear structural eigensystems , 1994 .
[10] John E. Dennis,et al. A Global Convergence Theory for General Trust-Region-Based Algorithms for Equality Constrained Optimization , 1997, SIAM J. Optim..
[11] W. Gander. Least squares with a quadratic constraint , 1980 .