Pages that link to "Item:Q1342517"
From MaRDI portal
The following pages link to On parallel complexity of nonsmooth convex optimization (Q1342517):
Displayed 17 items.
- On lower complexity bounds for large-scale smooth convex optimization (Q478994) (← links)
- Robust inversion, dimensionality reduction, and randomized sampling (Q715245) (← links)
- Variable selection in general multinomial logit models (Q1623760) (← links)
- Adaptive restart of the optimized gradient method for convex optimization (Q1670019) (← links)
- Low-rank decomposition meets kernel learning: a generalized Nyström method (Q1680675) (← links)
- Accelerated proximal point method for maximally monotone operators (Q2235140) (← links)
- Adaptive restart for accelerated gradient schemes (Q2355332) (← links)
- A proximal alternating direction method for \(\ell_{2,1}\)-norm least squares problem in multi-task feature learning (Q2358899) (← links)
- A secant-based Nesterov method for convex functions (Q2361131) (← links)
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization (Q2515032) (← links)
- A Note on Application of Nesterov’s Method in Solving Lasso-Type Problems (Q2943784) (← links)
- Lower Bounds for Parallel and Randomized Convex Optimization (Q4969036) (← links)
- Multidimensional Binary Search for Contextual Decision-Making (Q4971566) (← links)
- First-Order Methods for Nonconvex Quadratic Minimization (Q5113167) (← links)
- (Q5149241) (← links)
- Lower bounds for non-convex stochastic optimization (Q6038643) (← links)
- Information complexity of mixed-integer convex optimization (Q6085983) (← links)