A limited-memory Riemannian symmetric rank-one trust-region method with an efficient algorithm for its subproblem (Journal Article) | NSF PAGES

skip to main content

Attention:

The NSF Public Access Repository (NSF-PAR) system and access will be unavailable from 10:00 PM ET on Friday, December 8 until 2:00 AM ET on Saturday, December 9 due to maintenance. We apologize for the inconvenience.

Citation Details

A limited-memory Riemannian symmetric rank-one trust-region method with an efficient algorithm for its subproblem

Award ID(s):: 1934182 1934157

NSF-PAR ID:: 10310284

Author(s) / Creator(s):: Huang, Wen; Gallivan, Kyle A.

Date Published:: 2021-01-01

Journal Name:: IFAC-PapersOnLine

Volume:: 54

Issue:: 9

ISSN:: 2405-8963

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
Accepted Manuscript1.0
Journal Article:
https://doi.org/10.1016/J.IFACOL.2021.06.118