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. 1910.02018
  4. Cited By
Inexact Online Proximal-gradient Method for Time-varying Convex
  Optimization
v1v2v3v4 (latest)

Inexact Online Proximal-gradient Method for Time-varying Convex Optimization

4 October 2019
Amirhossein Ajalloeian
T. Huynh
Heng Luo
ArXiv (abs)PDFHTML

Papers citing "Inexact Online Proximal-gradient Method for Time-varying Convex Optimization"

5 / 5 papers shown
Title
Distributionally Time-Varying Online Stochastic Optimization under
  Polyak-Łojasiewicz Condition with Application in Conditional Value-at-Risk
  Statistical Learning
Distributionally Time-Varying Online Stochastic Optimization under Polyak-Łojasiewicz Condition with Application in Conditional Value-at-Risk Statistical Learning
Yuen-Man Pun
Farhad Farokhi
Iman Shames
22
2
0
18 Sep 2023
Dynamic Regret Analysis of Safe Distributed Online Optimization for
  Convex and Non-convex Problems
Dynamic Regret Analysis of Safe Distributed Online Optimization for Convex and Non-convex Problems
Ting-Jui Chang
Sapana Chaudhary
D. Kalathil
Shahin Shahrampour
97
6
0
23 Feb 2023
A closer look at temporal variability in dynamic online learning
A closer look at temporal variability in dynamic online learning
Nicolò Campolongo
Francesco Orabona
57
12
0
15 Feb 2021
Temporal Variability in Implicit Online Learning
Temporal Variability in Implicit Online Learning
Nicolò Campolongo
Francesco Orabona
86
27
0
12 Jun 2020
Online Stochastic Convex Optimization: Wasserstein Distance Variation
Online Stochastic Convex Optimization: Wasserstein Distance Variation
Iman Shames
F. Farokhi
11
9
0
02 Jun 2020
1