| dc.contributor | 應數系 | |
| dc.creator (作者) | 郭岳承 | |
| dc.creator (作者) | Kuo, Yueh-Cheng;Liu, Ching-Sung | |
| dc.date (日期) | 2023-05 | |
| dc.date.accessioned | 24-May-2024 11:34:35 (UTC+8) | - |
| dc.date.available | 24-May-2024 11:34:35 (UTC+8) | - |
| dc.date.issued (上傳時間) | 24-May-2024 11:34:35 (UTC+8) | - |
| dc.identifier.uri (URI) | https://nccur.lib.nccu.edu.tw/handle/140.119/151285 | - |
| dc.description.abstract (摘要) | We propose an index search method (ISM) for solving nonnegative least squares problems (NNLS). This method uses inner and outer schemes to find the index set corresponding to the nonzero component of the optimal solution. The outer iteration updates the approximate index set such that the objective value of the sequence generated by ISM is monotonically decreasing. Hence, the index set generated by ISM does not repeat, and the optimal solution can be achieved with finite iteration steps. Some normal equations need to be solved in the inner iteration, which is the dominant computational complexity in ISM. Numerical experiments are provided to support the theoretical results. | |
| dc.format.extent | 105 bytes | - |
| dc.format.mimetype | text/html | - |
| dc.relation (關聯) | Journal of Computational and Applied Mathematics, Vol.424, 114954 | |
| dc.subject (關鍵詞) | Index search method; Nonnegative least squares problems; KKT conditions; Optimization problem | |
| dc.title (題名) | An index search method based inner-outer iterative algorithm for solving nonnegative least squares problems | |
| dc.type (資料類型) | article | |
| dc.identifier.doi (DOI) | 10.1016/j.cam.2022.114954 | |
| dc.doi.uri (DOI) | https://doi.org/10.1016/j.cam.2022.114954 | |
