Pages that link to "Item:Q478994"

The following pages link to On lower complexity bounds for large-scale smooth convex optimization (Q478994):

Displaying 18 items.

• New results on subgradient methods for strongly convex optimization problems with a unified analysis (Q316174) (← links)
• The exact information-based complexity of smooth convex minimization (Q511109) (← links)
• Universal method for stochastic composite optimization problems (Q1746349) (← links)
• Some worst-case datasets of deterministic first-order methods for solving binary logistic regression (Q2028922) (← links)
• On the oracle complexity of smooth strongly convex minimization (Q2052164) (← links)
• Optimal complexity and certification of Bregman first-order methods (Q2149545) (← links)
• Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems (Q2220653) (← links)
• Fast gradient descent for convex minimization problems with an oracle producing a \(( \delta, L)\)-model of function at the requested point (Q2278192) (← links)
• Accelerated directional search with non-Euclidean prox-structure (Q2290400) (← links)
• An adaptive proximal method for variational inequalities (Q2332639) (← links)
• Affine-invariant contracting-point methods for convex optimization (Q2687041) (← links)
• Conditional Gradient Sliding for Convex Optimization (Q2816241) (← links)
• Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization (Q4575825) (← links)
• Lower Bounds for Parallel and Randomized Convex Optimization (Q4969036) (← links)
• (Q4998970) (← links)
• Projection-free accelerated method for convex optimization (Q5038178) (← links)
• Conditional Gradient Methods for Convex Optimization with General Affine and Nonlinear Constraints (Q5158760) (← links)
• Optimal Affine-Invariant Smooth Minimization Algorithms (Q5376450) (← links)