Online composite optimization with time-varying regularizers
From MaRDI portal
Recommendations
- Bounds for the tracking error of first-order online optimization methods
- Online convex optimization using coordinate descent algorithms
- Regret analysis of an online majorized semi-proximal ADMM for online composite optimization
- Adaptive online distributed optimization in dynamic environments
- Nonstationary online convex optimization with multiple predictions
Cites work
- A convex approach to trajectory optimization for boost back of vertical take-off/vertical landing reusable launch vehicles
- A low complexity algorithm with \(O(\sqrt{T})\) regret and \(O(1)\) constraint violations for online convex optimization with long term constraints
- A modular analysis of adaptive (non-)convex optimization: optimism, composite objectives, variance reduction, and variational bounds
- A Second Order Primal-Dual Method for Nonsmooth Convex Composite Optimization
- Adaptive Composite Online Optimization: Predictions in Static and Dynamic Environments
- An adaptive online learning algorithm for distributed convex optimization with coupled constraints over unbalanced directed graphs
- An efficient primal dual prox method for non-smooth optimization
- An Online Convex Optimization Approach to Proactive Network Resource Allocation
- Decentralized Proximal Gradient Algorithms With Linear Convergence Rates
- Distributed constraint optimization on networked multi-agent systems
- Distributed Mirror Descent for Online Composite Optimization
- Distributed online convex optimization with multiple coupled constraints: a double accelerated push-pull algorithm
- Distributed Online Convex Optimization With Time-Varying Coupled Inequality Constraints
- Distributed Online Optimization for Multi-Agent Networks With Coupled Inequality Constraints
- Distributed Online Optimization in Dynamic Environments Using Mirror Descent
- Dynamic Online Learning via Frank-Wolfe Algorithm
- Efficient online and batch learning using forward backward splitting
- Energy management strategy for parallel hybrid electric vehicles based on approximate dynamic programming and velocity forecast
- Exact worst-case convergence rates of the proximal gradient method for composite convex minimization
- First-order and stochastic optimization methods for machine learning
- Non-stationary stochastic optimization
- Online distributed detection of sensor networks with delayed information
- Online Learning Over Dynamic Graphs via Distributed Proximal Gradient Algorithm
- Online Learning With Inexact Proximal Online Gradient Descent Algorithms
- Online Trajectory Optimization Using Inexact Gradient Feedback for Time-Varying Environments
- Optimal Stochastic Approximation Algorithms for Strongly Convex Stochastic Composite Optimization I: A Generic Algorithmic Framework
- Optimistic optimisation of composite objective with exponentiated update
- Privacy preserving distributed online projected residual feedback optimization over unbalanced directed graphs
- The optimal dynamic regret for smoothed online convex optimization with squared \(l_2\) norm switching costs
Cited in
(6)- Personalized optimization with user's feedback
- Nonstationary online convex optimization with multiple predictions
- Dynamic regret of adaptive gradient methods for strongly convex problems
- Online convex optimization using coordinate descent algorithms
- Regret analysis of an online majorized semi-proximal ADMM for online composite optimization
- Regret of general-norm online gradient descent for relatively smooth convex loss functions
This page was built for publication: Online composite optimization with time-varying regularizers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6559338)
