Harry Oviedo. A worst-case complexity analysis for riemannian non-monotone line-search methods. // Optimization Letters. – 2025. – DOI: 10.1007/s11590-025-02229-x. – URL: https://doi.org/10.1007/s11590-025-02229-x
Harry Oviedo (2025). A worst-case complexity analysis for riemannian non-monotone line-search methods. Optimization Letters. https://doi.org/10.1007/s11590-025-02229-x
Harry Oviedo. “A worst-case complexity analysis for riemannian non-monotone line-search methods.” Optimization Letters, 2025. doi:10.1007/s11590-025-02229-x.
@article{Oviedo2025,
title = {A worst-case complexity analysis for riemannian non-monotone line-search methods},
author = {Oviedo, Harry},
journal = {Optimization Letters},
year = {2025},
doi = {10.1007/s11590-025-02229-x},
url = {https://doi.org/10.1007/s11590-025-02229-x}
}