Pages that link to "Item:Q2515032"
From MaRDI portal
The following pages link to Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization (Q2515032):
Displayed 38 items.
- OSGA: a fast subgradient algorithm with optimal complexity (Q304218) (← links)
- A proximal method for composite minimization (Q304260) (← links)
- On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients (Q315517) (← links)
- Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization (Q1664251) (← links)
- Optimal subgradient algorithms for large-scale convex optimization in simple domains (Q1689457) (← links)
- Accelerated first-order methods for hyperbolic programming (Q1717219) (← links)
- Conditional gradient type methods for composite nonlinear and stochastic optimization (Q1717236) (← links)
- Target radius methods for nonsmooth convex optimization (Q1728379) (← links)
- Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\) (Q1752352) (← links)
- Dynamic stochastic approximation for multi-stage stochastic optimization (Q2020613) (← links)
- Acceleration techniques for level bundle methods in weakly smooth convex constrained optimization (Q2023658) (← links)
- A new restricted memory level bundle method for constrained convex nonsmooth optimization (Q2080833) (← links)
- On stochastic accelerated gradient with convergence rate (Q2111814) (← links)
- Accelerated gradient sliding for structured convex optimization (Q2141354) (← links)
- A multi-step doubly stabilized bundle method for nonsmooth convex optimization (Q2177698) (← links)
- Fast gradient descent for convex minimization problems with an oracle producing a \(( \delta, L)\)-model of function at the requested point (Q2278192) (← links)
- A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems (Q2307749) (← links)
- Accelerated first-order methods for large-scale convex optimization: nearly optimal complexity under strong convexity (Q2311123) (← links)
- Optimal subgradient methods: computational properties for large-scale linear inverse problems (Q2315075) (← links)
- Generalized uniformly optimal methods for nonlinear programming (Q2316202) (← links)
- Rate of convergence of the bundle method (Q2412838) (← links)
- An optimal subgradient algorithm with subspace search for costly convex optimization problems (Q2415906) (← links)
- Fast bundle-level methods for unconstrained and ball-constrained convex optimization (Q2419544) (← links)
- General Hölder smooth convergence rates follow from specialized rates assuming growth bounds (Q2696991) (← links)
- Stochastic Block Mirror Descent Methods for Nonsmooth and Stochastic Optimization (Q2954396) (← links)
- A Level-Set Method for Convex Optimization with a Feasible Solution Path (Q4562247) (← links)
- Efficient Algorithms for Distributionally Robust Stochastic Optimization with Discrete Scenario Support (Q5003210) (← links)
- A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes (Q5013585) (← links)
- (Q5096506) (← links)
- Inexact proximal stochastic second-order methods for nonconvex composite optimization (Q5135256) (← links)
- An Accelerated Linearized Alternating Direction Method of Multipliers (Q5250009) (← links)
- Inexact model: a framework for optimization and variational inequalities (Q5865338) (← links)
- A Trust-region Method for Nonsmooth Nonconvex Optimization (Q5881403) (← links)
- Universal Conditional Gradient Sliding for Convex Optimization (Q6071883) (← links)
- Optimal Methods for Convex Risk-Averse Distributed Optimization (Q6116242) (← links)
- Optimal Convergence Rates for the Proximal Bundle Method (Q6155876) (← links)
- Block mirror stochastic gradient method for stochastic optimization (Q6158991) (← links)
- On optimal universal first-order methods for minimizing heterogeneous sums (Q6191975) (← links)