Pages that link to "Item:Q2297653"
From MaRDI portal
The following pages link to Faster subgradient methods for functions with Hölderian growth (Q2297653):
Displaying 16 items.
- On the global convergence rate of the gradient descent method for functions with Hölder continuous gradients (Q315517) (← links)
- Convergence rates of subgradient methods for quasi-convex optimization problems (Q782917) (← links)
- Subgradient methods for sharp weakly convex functions (Q1626538) (← links)
- Convergence results of a new monotone inertial forward-backward splitting algorithm under the local Hölder error bound condition (Q2128612) (← links)
- Faster subgradient methods for functions with Hölderian growth (Q2297653) (← links)
- A simple nearly optimal restart scheme for speeding up first-order methods (Q2696573) (← links)
- General Hölder smooth convergence rates follow from specialized rates assuming growth bounds (Q2696991) (← links)
- On Convergence Properties of a Subgradient Method (Q4810572) (← links)
- Exact penalties for decomposable convex optimization problems (Q5058390) (← links)
- On the Simplicity and Conditioning of Low Rank Semidefinite Programs (Q5162653) (← links)
- An Optimal-Storage Approach to Semidefinite Programming Using Approximate Complementarity (Q5162656) (← links)
- Radial duality. II: Applications and algorithms (Q6126645) (← links)
- A strict complementarity approach to error bound and sensitivity of solution of conic programs (Q6164955) (← links)
- Variable sample-size optimistic mirror descent algorithm for stochastic mixed variational inequalities (Q6497046) (← links)
- A subgradient method with constant step-size for \(\ell_1\)-composite optimization (Q6564822) (← links)
- Stochastic algorithms with geometric step decay converge linearly on sharp functions (Q6608032) (← links)
