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. 2306.02420
  4. Cited By
Complexity of Block Coordinate Descent with Proximal Regularization and
  Applications to Wasserstein CP-dictionary Learning

Complexity of Block Coordinate Descent with Proximal Regularization and Applications to Wasserstein CP-dictionary Learning

4 June 2023
Dohyun Kwon
Hanbaek Lyu
ArXivPDFHTML

Papers citing "Complexity of Block Coordinate Descent with Proximal Regularization and Applications to Wasserstein CP-dictionary Learning"

2 / 2 papers shown
Title
Convergence and Complexity Guarantee for Inexact First-order Riemannian
  Optimization Algorithms
Convergence and Complexity Guarantee for Inexact First-order Riemannian Optimization Algorithms
Yuchen Li
Laura Balzano
Deanna Needell
Hanbaek Lyu
25
1
0
05 May 2024
Stochastic optimization with arbitrary recurrent data sampling
Stochastic optimization with arbitrary recurrent data sampling
William G. Powell
Hanbaek Lyu
34
0
0
15 Jan 2024
1