Online Learning With Inexact Proximal Online Gradient Descent Algorithms
From MaRDI portal
Publication:4628290
DOI10.1109/TSP.2018.2890368zbMath1414.90282arXiv1806.00202WikidataQ128647316 ScholiaQ128647316MaRDI QIDQ4628290
Ketan Rajawat, Amrit Singh Bedi, Rishabh Dixit, Ruchi Tripathi
Publication date: 6 March 2019
Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1806.00202
Related Items (5)
Tracking and Regret Bounds for Online Zeroth-Order Euclidean and Riemannian Optimization ⋮ Personalized optimization with user's feedback ⋮ Running Primal-Dual Gradient Method for Time-Varying Nonconvex Problems ⋮ Principled analyses and design of first-order methods with inexact proximal operators ⋮ Bounds for the tracking error of first-order online optimization methods
This page was built for publication: Online Learning With Inexact Proximal Online Gradient Descent Algorithms
