Pages that link to "Item:Q2220663"

The following pages link to Lower bounds for finding stationary points II: first-order methods (Q2220663):

Displaying 9 items.

• On lower iteration complexity bounds for the convex concave saddle point problems (Q2149573) (← links)
• Tensor methods for finding approximate stationary points of convex functions (Q5038435) (← links)
• Lower bounds for non-convex stochastic optimization (Q6038643) (← links)
• An accelerated first-order method for non-convex optimization on manifolds (Q6048700) (← links)
• A nonlinear conjugate gradient method with complexity guarantees and its application to nonconvex regression (Q6114952) (← links)
• Complexity-optimal and parameter-free first-order methods for finding stationary points of composite optimization problems (Q6601206) (← links)
• Efficient first order method for saddle point problems with higher order smoothness (Q6622754) (← links)
• No dimension-free deterministic algorithm computes approximate stationarities of Lipschitzians (Q6634520) (← links)
• Hessian barrier algorithms for non-convex conic optimization (Q6665383) (← links)