Keywords
Subgradient methodMathematicsMathematical optimizationSequence (biology)Saddle pointMinimaxInterior point methodConvex optimizationVariational inequalityDual (grammatical number)Regular polygon
Affiliated Institutions
Related Publications
Atomic Decomposition by Basis Pursuit
The time-frequency and time-scale communities have recently developed a large number of overcomplete waveform dictionaries --- stationary wavelets, wavelet packets, cosine packe...
Regularization Paths for Generalized Linear Models via Coordinate Descent
We develop fast algorithms for estimation of generalized linear models with convex penalties. The models include linear regression, two-class logistic regression, and multi- nom...
Sparse reconstruction by convex relaxation: Fourier and Gaussian measurements
This paper proves best known guarantees for exact reconstruction of a sparse signal f from few non-adaptive universal linear measurements. We consider Fourier measurements (rand...
HOGWILD!: A Lock-Free Approach to Parallelizing Stochastic Gradient Descent
Stochastic Gradient Descent (SGD) is a popular algorithm that can achieve state-of-the-art performance on a variety of machine learning tasks. Several researchers have recently ...
Decoding by Linear Programming
This paper considers a natural error correcting problem with real valued input/output. We wish to recover an input vector f/spl isin/R/sup n/ from corrupted measurements y=Af+e....
Publication Info
- Year
- 2007
- Type
- article
- Volume
- 120
- Issue
- 1
- Pages
- 221-259
- Citations
- 849
- Access
- Closed
External Links
Social Impact
Altmetric
PlumX Metrics
Social media, news, blog, policy document mentions
Citation Metrics
849
OpenAlex
Cite This
Yurii Nesterov
(2007).
Primal-dual subgradient methods for convex problems.
Mathematical Programming
, 120
(1)
, 221-259.
https://doi.org/10.1007/s10107-007-0149-x
Identifiers
- DOI
- 10.1007/s10107-007-0149-x