# Riemannian optimization using three different metrics for Hermitian PSD fixed-rank constraints: an extended version

@article{Zheng2022RiemannianOU, title={Riemannian optimization using three different metrics for Hermitian PSD fixed-rank constraints: an extended version}, author={Shixin Zheng and Wen Huang and Bart Vandereycken and Xiangxiong Zhang}, journal={ArXiv}, year={2022}, volume={abs/2204.07830} }

We consider smooth optimization problems with a Hermitian positive semi-deﬁnite ﬁxed-rank constraint, where a quotient geometry with three Riemannian metrics g i ( · , · ) ( i = 1 , 2 , 3) is used to represent this constraint. By taking the nonlinear conjugate gradient method (CG) as an example, we show that CG on the quotient geometry with metric g 1 is equivalent to CG on the factor-based optimization framework, which is often called the Burer–Monteiro approach. We also show that CG on the…

## One Citation

### Tensor Completion via Tensor Train Based Low-Rank Quotient Geometry under a Preconditioned Metric

- Computer Science
- 2022

The proposed algorithms for the low-rank tensor completion problem are competitive with other existing algorithms in terms of recovery ability, convergence performance, and reconstruction quality.

## References

SHOWING 1-10 OF 33 REFERENCES

### Low-rank matrix completion by Riemannian optimization---extended version

- Computer Science
- 2012

This work proposes a new algorithm for matrix completion that minimizes the least-square distance on the sampling set over the Riemannian manifold of fixed-rank matrices, an adaptation of classical non-linear conjugate gradients developed within the framework of retraction-based optimization on manifolds.

### A Riemannian geometry with complete geodesics for the set of positive semidefinite matrices of fixed rank

- Mathematics
- 2012

We present a homogeneous space geometry for the manifold of symmetric positive semidefinite matrices of fixed rank. The total space is the general linear group endowed with its natural rightinvariant…

### Low-Rank Matrix Completion by Riemannian Optimization

- Computer Science, MathematicsSIAM J. Optim.
- 2013

This work proposes a new algorithm for matrix completion that minimizes the least-square distance on the sampling set over the Riemannian manifold of fixed-rank matrices and proves convergence of a regularized version of the algorithm under the assumption that the restricted isometry property holds for incoherent matrices throughout the iterations.

### Riemannian Metric and Geometric Mean for Positive Semidefinite Matrices of Fixed Rank

- MathematicsSIAM J. Matrix Anal. Appl.
- 2009

A new metric and mean on the set of positive semidefinite matrices of fixed-rank is introduced, derived from a well-chosen Riemannian quotient geometry that generalizes the reductive geometry of the positive cone and the associated natural metric.

### Optimization algorithms on Riemannian manifolds with applications

- Mathematics
- 2013

This dissertation generalizes three well-known unconstrained optimization approaches for Rn to solve optimization problems with constraints that can be viewed as a d-dimensional Riemannian manifold…

### Low-Rank Optimization on the Cone of Positive Semidefinite Matrices

- Mathematics, Computer ScienceSIAM J. Optim.
- 2010

The geometry of that manifold is discussed and a second-order optimization method with guaranteed quadratic convergence is derived, which provides some conditions on the rank of the factorization to ensure equivalence with the original problem.

### A Riemannian Optimization Approach for Computing Low-Rank Solutions of Lyapunov Equations

- Computer Science, MathematicsSIAM J. Matrix Anal. Appl.
- 2010

We propose a new framework based on optimization on manifolds to approximate the solution of a Lyapunov matrix equation by a low-rank matrix. The method minimizes the error on the Riemannian manifold…

### Intrinsic representation of tangent vectors and vector transports on matrix manifolds

- MathematicsNumerische Mathematik
- 2017

This work proposes a computationally tractable isometric vector transport on the Stiefel manifold of orthonormal p-frames in $$\mathbb {R}^n$$Rn, and proposes a convenient way to represent tangent vectors to these manifolds as elements of d, where d is the dimension of the manifold.

### Adaptive filtering for estimation of a low-rank positive semidefinite matrix

- Mathematics, Computer Science
- 2010

Two gradient descent flows associated to two distinct Riemannian quotient geometries that underlie this set of matrices are considered and the resulting algorithms are non-linear and can be viewed as a generalization of Least Mean Squares that instrically constrain the parameter within the manifold search space.

### Solving PhaseLift by Low-Rank Riemannian Optimization Methods for Complex Semidefinite Constraints

- Computer ScienceSIAM J. Sci. Comput.
- 2017

This paper considers an approach based on an alternative cost function defined on a union of appropriate manifolds in a manner that preserves the ability to find a global minimizer and is significantly more efficient computationally.