Corpus ID: 52826032

A Riemannian approach to low-rank algebraic Riccati equations

@article{Mishra2013ARA,
  title={A Riemannian approach to low-rank algebraic Riccati equations},
  author={Bamdev Mishra and B. Vandereycken},
  journal={arXiv: Optimization and Control},
  year={2013}
}
  • Bamdev Mishra, B. Vandereycken
  • Published 2013
  • Mathematics
  • arXiv: Optimization and Control
  • We propose a Riemannian optimization approach for computing low-rank solutions of the algebraic Riccati equation. The scheme alternates between fixed-rank optimization and rank-one updates. The fixed-rank optimization is on the set of fixed-rank symmetric positive definite matrices which is endowed with a particular Riemannian metric (and geometry) that is tuned to the structure of the objective function. We specifically discuss the implementation of a Riemannian trust-region algorithm that is… CONTINUE READING
    4 Citations

    Figures and Tables from this paper.

    Multilevel Riemannian optimization for low-rank problems
    Geometric Methods on Low-Rank Matrix and Tensor Manifolds
    • 3
    • PDF
    Riemannian Preconditioning
    • 40
    • PDF
    A Riemannian approach to large-scale constrained least-squares with symmetries
    • 8
    • PDF

    References

    SHOWING 1-10 OF 12 REFERENCES
    A Riemannian Optimization Approach for Computing Low-Rank Solutions of Lyapunov Equations
    • 82
    • PDF
    A Riemannian geometry for low-rank matrix completion
    • 44
    • PDF
    Regression on Fixed-Rank Positive Semidefinite Matrices: A Riemannian Approach
    • 69
    • PDF
    A new subspace iteration method for the algebraic Riccati equation
    • 37
    • PDF
    On two numerical methods for the solution of large-scale algebraic Riccati equations
    • 52
    • Highly Influential
    • PDF
    Manopt, a matlab toolbox for optimization on manifolds
    • 573
    • PDF
    The Geometry of Algorithms with Orthogonality Constraints
    • 2,203
    • PDF
    Scaled Gradients on Grassmann Manifolds for Matrix Completion
    • 86
    • PDF