@Article{JCM-39-2,
author = {W., Siegel, Jonathan},
title = {Accelerated Optimization with Orthogonality Constraints},
journal = {Journal of Computational Mathematics},
year = {2021},
volume = {39},
number = {2},
pages = {207--226},
abstract = {<p style="text-align: justify;">We develop a generalization of Nesterov&#39;s accelerated gradient descent method which
is designed to deal with orthogonality constraints. To demonstrate the effectiveness of
our method, we perform numerical experiments which demonstrate that the number of
iterations scales with the square root of the condition number, and also compare with
existing state-of-the-art quasi-Newton methods on the Stiefel manifold. Our experiments
show that our method outperforms existing state-of-the-art quasi-Newton methods on some
large, ill-conditioned problems.</p>},
issn = {1991-7139},
doi = {https://doi.org/10.4208/jcm.1911-m2018-0242},
url = {https://global-sci.com/article/84226/accelerated-optimization-with-orthogonality-constraints}
}