Online composite optimization with time-varying regularizers
From MaRDI portal
Publication:6559338
DOI10.1016/j.jfranklin.2024.106884zbMath1548.90372MaRDI QIDQ6559338
Xiuxian Li, Yang Shi, Ruijie Hou
Publication date: 21 June 2024
Published in: Journal of the Franklin Institute (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Exact worst-case convergence rates of the proximal gradient method for composite convex minimization
- Distributed constraint optimization on networked multi-agent systems
- A convex approach to trajectory optimization for boost back of vertical take-off/vertical landing reusable launch vehicles
- A modular analysis of adaptive (non-)convex optimization: optimism, composite objectives, variance reduction, and variational bounds
- First-order and stochastic optimization methods for machine learning
- An adaptive online learning algorithm for distributed convex optimization with coupled constraints over unbalanced directed graphs
- Energy management strategy for parallel hybrid electric vehicles based on approximate dynamic programming and velocity forecast
- An efficient primal dual prox method for non-smooth optimization
- Non-Stationary Stochastic Optimization
- Distributed Online Optimization in Dynamic Environments Using Mirror Descent
- An Online Convex Optimization Approach to Proactive Network Resource Allocation
- Online Learning With Inexact Proximal Online Gradient Descent Algorithms
- Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework
- Distributed Online Optimization for Multi-Agent Networks With Coupled Inequality Constraints
- A Low Complexity Algorithm with $O(\sqrt{T})$ Regret and $O(1)$ Constraint Violations for Online Convex Optimization with Long Term Constraints
- Decentralized Proximal Gradient Algorithms With Linear Convergence Rates
- Online Learning Over Dynamic Graphs via Distributed Proximal Gradient Algorithm
- A Second Order Primal-Dual Method for Nonsmooth Convex Composite Optimization
- Distributed Online Convex Optimization With Time-Varying Coupled Inequality Constraints
- Online Trajectory Optimization Using Inexact Gradient Feedback for Time-Varying Environments
- Dynamic Online Learning via Frank-Wolfe Algorithm
- Distributed Mirror Descent for Online Composite Optimization
- Adaptive Composite Online Optimization: Predictions in Static and Dynamic Environments
- Online distributed detection of sensor networks with delayed information
- Optimistic optimisation of composite objective with exponentiated update
- Distributed online convex optimization with multiple coupled constraints: a double accelerated push-pull algorithm
- The optimal dynamic regret for smoothed online convex optimization with squared \(l_2\) norm switching costs
- Privacy preserving distributed online projected residual feedback optimization over unbalanced directed graphs
This page was built for publication: Online composite optimization with time-varying regularizers