Pages that link to "Item:Q2834440"
From MaRDI portal
The following pages link to On lower and upper bounds in smooth and strongly convex optimization (Q2834440):
Displaying 15 items.
- On lower complexity bounds for large-scale smooth convex optimization (Q478994) (← links)
- Upper bounding in inner regions for global optimization under inequality constraints (Q486384) (← links)
- An optimal randomized incremental gradient method (Q1785198) (← links)
- Lower bounds for maximal and convex layers problems (Q1825651) (← links)
- Bounds for the tracking error of first-order online optimization methods (Q2032000) (← links)
- On the oracle complexity of smooth strongly convex minimization (Q2052164) (← links)
- On strongly quasiconvex functions: existence results and proximal point algorithms (Q2116608) (← links)
- Lower bounds for finding stationary points I (Q2205972) (← links)
- Efficient first-order methods for convex minimization: a constructive approach (Q2205976) (← links)
- (Q2957481) (← links)
- Catalyst Acceleration for First-order Convex Optimization: from Theory to Practice (Q4558545) (← links)
- (Q4637046) (← links)
- Potential Function-Based Framework for Minimizing Gradients in Convex and Min-Max Optimization (Q5093649) (← links)
- (Q5148937) (← links)
- Relaxation quadratic approximation greedy pursuit method based on sparse learning (Q6651176) (← links)