Solving Weighted Orthogonal Procrustes Problems via a Projected Gradient Method
This paper proposes a family of line--search methods to deal with weighted orthogonal procrustes problems. In particular, the proposed family uses a search direction based on a convex combination between the Euclidean gradient and the Riemannian gradient of the cost function. The non--monotone line-...
Saved in:
| Main Authors: | H. F. Oviedo Leon, S. Guerrero |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Sociedade Brasileira de Matemática Aplicada e Computacional
2024-11-01
|
| Series: | Trends in Computational and Applied Mathematics |
| Subjects: | |
| Online Access: | https://tema.sbmac.org.br/tema/article/view/1786 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Estimation of smooth vector fields on manifolds by optimization on Stiefel group
by: E.N. Abramov, et al.
Published: (2018-06-01) -
Using Generalized Procrustes Analysis for Evaluation of Sensory Characteristic Data of Lamb Meat
by: Gazel Ser
Published: (2019-06-01) -
New A hybrid Hestenes-Stiefel and Dai-Yuan conjugate gradient algorithms for unconstrained optimization
by: Khalil K. Abbo, et al.
Published: (2023-02-01) -
SGRiT: Non-Negative Matrix Factorization via Subspace Graph Regularization and Riemannian-Based Trust Region Algorithm
by: Mohsen Nokhodchian, et al.
Published: (2025-03-01) -
Hestenes–Stiefel-Type Conjugate Direction Algorithm for Interval-Valued Multiobjective Optimization Problems
by: Rupesh Krishna Pandey, et al.
Published: (2025-06-01)