Cited in
(53)- Efficiency of minimizing compositions of convex functions and smooth maps
- Universal gradient methods for convex optimization problems
- On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients
- The approximate duality gap technique: a unified theory of first-order methods
- Optimal Affine-Invariant Smooth Minimization Algorithms
- Convex optimization with inexact gradients in Hilbert space and applications to elliptic inverse problems
- Efficiency of the accelerated coordinate descent method on structured optimization problems
- Generalized mirror prox algorithm for monotone variational inequalities: Universality and inexact oracle
- Unified acceleration of high-order algorithms under general Hölder continuity
- Decentralized and parallel primal and dual accelerated methods for stochastic convex programming problems
- Accelerated Bregman proximal gradient methods for relatively smooth convex optimization
- Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\)
- Fast gradient methods for uniformly convex and weakly smooth problems
- A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization
- Regularized nonlinear acceleration
- Universal intermediate gradient method for convex problems with inexact oracle
- Optimal subgradient methods: computational properties for large-scale linear inverse problems
- On the adaptivity of stochastic gradient-based optimization
- Adaptivity of stochastic gradient methods for nonconvex optimization
- Inexact model: a framework for optimization and variational inequalities
- An accelerated directional derivative method for smooth stochastic convex optimization
- Nearly optimal first-order methods for convex optimization under gradient norm measure: an adaptive regularization approach
- Generalized conditional gradient with augmented Lagrangian for composite minimization
- A universal modification of the linear coupling method
- Empirical risk minimization: probabilistic complexity and stepsize strategy
- Universal method of searching for equilibria and stochastic equilibria in transportation networks
- Sharpness, restart, and acceleration
- Regularized Newton methods for minimizing functions with Hölder continuous hessians
- Accelerated schemes for a class of variational inequalities
- OSGA
- On the quality of first-order approximation of functions with Hölder continuous gradient
- Accelerated first-order methods for hyperbolic programming
- An optimal subgradient algorithm with subspace search for costly convex optimization problems
- Stochastic model-based minimization of weakly convex functions
- Accelerated extra-gradient descent: a novel accelerated first-order method
- Algorithm 566
- ACDS
- A dual approach for optimal algorithms in distributed optimization over networks
- Optimal subgradient algorithms for large-scale convex optimization in simple domains
- Smoothness parameter of power of Euclidean norm
- Fast gradient descent for convex minimization problems with an oracle producing a \(( \delta, L)\)-model of function at the requested point
- An adaptive proximal method for variational inequalities
- On the properties of the method of minimization for convex functions with relaxation on the distance to extremum
- New results on subgradient methods for strongly convex optimization problems with a unified analysis
- Universal method for stochastic composite optimization problems
- Implementable tensor methods in unconstrained convex optimization
- Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity
- The method of codifferential descent for convex and global piecewise affine optimization
- Universal Regularization Methods: Varying the Power, the Smoothness and the Accuracy
- Primal-dual accelerated gradient methods with small-dimensional relaxation oracle
- Quasi-convex feasibility problems: subgradient methods and convergence rates
- Zeroth-order methods for noisy Hölder-gradient functions
- A subgradient method for free material design
This page was built for software: NESUN
