Pages that link to "Item:Q5506689"
From MaRDI portal
The following pages link to ``Efficient” Subgradient Methods for General Convex Optimization (Q5506689):
Displaying 15 items.
- New computational guarantees for solving convex optimization problems with first order methods, via a function growth condition measure (Q1659678) (← links)
- Accelerated first-order methods for hyperbolic programming (Q1717219) (← links)
- Amenable cones: error bounds without constraint qualifications (Q2227528) (← links)
- Faster subgradient methods for functions with Hölderian growth (Q2297653) (← links)
- A bound on the Carathéodory number (Q2401297) (← links)
- A simple nearly optimal restart scheme for speeding up first-order methods (Q2696573) (← links)
- RSG: Beating Subgradient Method without Smoothness and Strong Convexity (Q4558142) (← links)
- A Level-Set Method for Convex Optimization with a Feasible Solution Path (Q4562247) (← links)
- Radial Subgradient Method (Q4606654) (← links)
- Exact penalties for decomposable convex optimization problems (Q5058390) (← links)
- Certifying Polynomial Nonnegativity via Hyperbolic Optimization (Q5208888) (← links)
- Convergence Rates for Deterministic and Stochastic Subgradient Methods without Lipschitz Continuity (Q5231668) (← links)
- Radial duality. I: Foundations (Q6126644) (← links)
- Radial duality. II: Applications and algorithms (Q6126645) (← links)
- A two-metric variable scaled forward-backward algorithm for \(\ell_0\) optimization problem and its applications (Q6590598) (← links)
