Geometric Optimization Methods for Adaptive Filtering
Abstract
The techniques and analysis presented in this thesis provide new methods to solve optimization problems posed on Riemannian manifolds. These methods are applied to the subspace tracking problem found in adaptive signal processing and adaptive control. A new point of view is offered for the constrained optimization problem. Some classical optimization techniques on Euclidean space are generalized to Riemannian manifolds. Several algorithms are presented and their convergence properties are analyzed employing the Riemannian structure of the manifold. Specifically, two new algorithms, which can be thought of as Newton's method and the conjugate gradient method on Riemannian manifolds, are presented and shown to possess quadratic and superlinear convergence, respectively. These methods are applied to several eigenvalue and singular value problems, which are posed as constrained optimization problems. ...
Cite
@article{arxiv.1305.1886,
title = {Geometric Optimization Methods for Adaptive Filtering},
author = {Steven Thomas Smith},
journal= {arXiv preprint arXiv:1305.1886},
year = {2013}
}
Comments
PhD Dissertation, Harvard University, 1993. A thesis presented by Steven Thomas Smith to The Division of Applied Sciences in partial fulfillment for the degree of Doctor of Philosophy in the subject of Applied Mathematics