A comparison on some iterative algorithms for linear least squares problems with bound constraints
碩士 === 國立中正大學 === 應用數學研究所 === 85 === In this paper we apply the three algorithms which were developedby M. Bierlaire, Ph. L. Toint, and D. Tuyttens [1] to solve the linearleast squares problems with bound constraints. Then we analyze the th...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
1997
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/63391340607830936953 |