On parallel complexity of nonsmooth convex optimization
From MaRDI portal
Publication:1342517
DOI10.1006/jcom.1994.1025zbMath0820.68058WikidataQ57392961 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
68Q30: Algorithmic information theory (Kolmogorov complexity, etc.)
Related Items
Multidimensional Binary Search for Contextual Decision-Making, Unnamed Item, Lower Bounds for Parallel and Randomized Convex Optimization, First-Order Methods for Nonconvex Quadratic Minimization, Lower bounds for non-convex stochastic optimization, Information complexity of mixed-integer convex optimization, On lower complexity bounds for large-scale smooth convex optimization, Robust inversion, dimensionality reduction, and randomized sampling, Variable selection in general multinomial logit models, Adaptive restart of the optimized gradient method for convex optimization, Low-rank decomposition meets kernel learning: a generalized Nyström method, Accelerated proximal point method for maximally monotone operators, Adaptive restart for accelerated gradient schemes, 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, Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization, A Note on Application of Nesterov’s Method in Solving Lasso-Type Problems
