A continuous-time approach to online optimization
From MaRDI portal
Publication:520967
DOI10.3934/jdg.2017008zbMath1359.90095arXiv1401.6956WikidataQ60142047 ScholiaQ60142047MaRDI QIDQ520967
Publication date: 6 April 2017
Published in: Journal of Dynamics and Games (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1401.6956
convex optimization; continuous time; gradient descent; online optimization; regret minimization; mirror descent
90C25: Convex programming