Unifying framework for accelerated randomized methods in convex optimization
From MaRDI portal
Abstract: In this paper, we consider smooth convex optimization problems with simple constraints and inexactness in the oracle information such as value, partial or directional derivatives of the objective function. We introduce a unifying framework, which allows to construct different types of accelerated randomized methods for such problems and to prove convergence rate theorems for them. We focus on accelerated random block-coordinate descent, accelerated random directional search, accelerated random derivative-free method and, using our framework, provide their versions for problems with inexact oracle information. Our contribution also includes accelerated random block-coordinate descent with inexact oracle and entropy proximal setup as well as derivative-free version of this method. Moreover, we present an extension of our framework for strongly convex optimization problems. We also discuss an extension for the case of inexact model of the objective function.
Cites work
- A stable alternative to Sinkhorn's algorithm for regularized optimal transport
- A theoretical and empirical comparison of gradient approximations in derivative-free optimization
- Accelerated and unaccelerated stochastic gradient descent in model generality
- Accelerated gradient-free optimization methods with a non-Euclidean proximal operator
- Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization
- Accelerated, parallel, and proximal coordinate descent
- An Optimal Algorithm for Bandit and Zero-Order Convex Optimization with Two-Point Feedback
- An accelerated directional derivative method for smooth stochastic convex optimization
- An accelerated method for derivative-free smooth stochastic convex optimization
- An optimal randomized incremental gradient method
- Derivative-free optimization methods
- Deterministic and stochastic primal-dual subgradient algorithms for uniformly convex minimization
- Efficiency of coordinate descent methods on huge-scale optimization problems
- Efficiency of the accelerated coordinate descent method on structured optimization problems
- Fast gradient descent for convex minimization problems with an oracle producing a ( , L)-model of function at the requested point
- First-order methods of smooth convex optimization with inexact oracle
- Global Convergence Rate Analysis of a Generic Line Search Algorithm with Noise
- Gradient methods for problems with inexact model of the objective
- Gradient-free proximal methods with inexact oracle for convex stochastic nonsmooth optimization problems on the simplex
- Inexact coordinate descent: complexity and preconditioning
- Inexact model: a framework for optimization and variational inequalities
- Introduction to Derivative-Free Optimization
- Katyusha: the first direct acceleration of stochastic gradient methods
- Lectures on convex optimization
- Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
- On solving large-scale polynomial convex problems by randomized first-order algorithms
- Optimal Rates for Zero-Order Convex Optimization: The Power of Two Function Evaluations
- Oracle complexity separation in convex optimization
- Random gradient-free minimization of convex functions
- Smooth Optimization with Approximate Gradient
- Stochastic First- and Zeroth-Order Methods for Nonconvex Stochastic Programming
- Stochastic block mirror descent methods for nonsmooth and stochastic optimization
- Stochastic intermediate gradient method for convex optimization problems
- Stochastic intermediate gradient method for convex problems with stochastic inexact oracle
- Stochastic online optimization. Single-point and multi-point non-linear multi-armed bandits. Convex and strongly-convex case
- Universal method for stochastic composite optimization problems
- Zeroth-order methods for noisy Hölder-gradient functions
This page was built for publication: Unifying framework for accelerated randomized methods in convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6200198)
