ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2405.03073
  4. Cited By
Convergence and Complexity Guarantee for Inexact First-order Riemannian
  Optimization Algorithms

Convergence and Complexity Guarantee for Inexact First-order Riemannian Optimization Algorithms

5 May 2024
Yuchen Li
Laura Balzano
Deanna Needell
Hanbaek Lyu
ArXivPDFHTML

Papers citing "Convergence and Complexity Guarantee for Inexact First-order Riemannian Optimization Algorithms"

2 / 2 papers shown
Title
A Block Coordinate Descent Method for Nonsmooth Composite Optimization
  under Orthogonality Constraints
A Block Coordinate Descent Method for Nonsmooth Composite Optimization under Orthogonality Constraints
Ganzhao Yuan
19
4
0
07 Apr 2023
Fast and accurate optimization on the orthogonal manifold without
  retraction
Fast and accurate optimization on the orthogonal manifold without retraction
Pierre Ablin
Gabriel Peyré
64
27
0
15 Feb 2021
1