Huang, Wen, and Gallivan, Kyle A. A limited-memory Riemannian symmetric rank-one trust-region method with an efficient algorithm for its subproblem. Retrieved from https://par.nsf.gov/biblio/10310284. IFAC-PapersOnLine 54.9 Web. doi:10.1016/J.IFACOL.2021.06.118.
Huang, Wen, & Gallivan, Kyle A. A limited-memory Riemannian symmetric rank-one trust-region method with an efficient algorithm for its subproblem. IFAC-PapersOnLine, 54 (9). Retrieved from https://par.nsf.gov/biblio/10310284. https://doi.org/10.1016/J.IFACOL.2021.06.118
@article{osti_10310284,
place = {Country unknown/Code not available},
title = {A limited-memory Riemannian symmetric rank-one trust-region method with an efficient algorithm for its subproblem},
url = {https://par.nsf.gov/biblio/10310284},
DOI = {10.1016/J.IFACOL.2021.06.118},
abstractNote = {},
journal = {IFAC-PapersOnLine},
volume = {54},
number = {9},
author = {Huang, Wen and Gallivan, Kyle A.},
}
Warning: Leaving National Science Foundation Website
You are now leaving the National Science Foundation website to go to a non-government website.
Website:
NSF takes no responsibility for and exercises no control over the views expressed or the accuracy of
the information contained on this site. Also be aware that NSF's privacy policy does not apply to this site.