On parallel complexity of nonsmooth convex optimization
From MaRDI portal
Publication:1342517
DOI10.1006/jcom.1994.1025zbMath0820.68058OpenAlexW2007111443WikidataQ57392961 ScholiaQ57392961MaRDI QIDQ1342517
Publication date: 11 January 1995
Published in: Journal of Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcom.1994.1025
Related Items (17)
A proximal alternating direction method for \(\ell_{2,1}\)-norm least squares problem in multi-task feature learning ⋮ A secant-based Nesterov method for convex functions ⋮ Variable selection in general multinomial logit models ⋮ Lower Bounds for Parallel and Randomized Convex Optimization ⋮ Adaptive restart of the optimized gradient method for convex optimization ⋮ A Note on Application of Nesterov’s Method in Solving Lasso-Type Problems ⋮ Low-rank decomposition meets kernel learning: a generalized Nyström method ⋮ Lower bounds for non-convex stochastic optimization ⋮ Information complexity of mixed-integer convex optimization ⋮ First-Order Methods for Nonconvex Quadratic Minimization ⋮ On lower complexity bounds for large-scale smooth convex optimization ⋮ Accelerated proximal point method for maximally monotone operators ⋮ Robust inversion, dimensionality reduction, and randomized sampling ⋮ Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization ⋮ Multidimensional Binary Search for Contextual Decision-Making ⋮ Unnamed Item ⋮ Adaptive restart for accelerated gradient schemes
This page was built for publication: On parallel complexity of nonsmooth convex optimization
