The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Smoothing and First Order Methods: A Unified Framework
Abstract
We propose a unifying framework that combines smoothing approximation with fast first order algorithms for solving nonsmooth convex minimization problems. We prove that independently of the structure of the convex nonsmooth function involved, and of the given fast first order iterative scheme, it is always possible to improve the complexity rate and reach an $O(\varepsilon^{-1})$ efficiency estimate by solving an adequately smoothed approximation counterpart. Our approach relies on the combination of the notion of smoothable functions that we introduce with a natural extension of the Moreau-infimal convolution technique along with its connection to the smoothing mechanism via asymptotic functions. This allows for clarification and unification of several issues on the design, analysis, and potential applications of smoothing methods when combined with fast first order algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
Beck, A., & Teboulle, M. (2009) · SIAM Journal on Imaging Sciences · doi:10.1137/080716542 · Cited by 11,952
Self-citationSmooth minimization of non-smooth functions
Nesterov, Y. (2005) · Mathematical Programming · doi:10.1007/s10107-004-0552-5 · Cited by 2,455
Mirror descent and nonlinear projected subgradient methods for convex optimization
Beck, A., & Teboulle, M. (2003) · Operations Research Letters · doi:10.1016/s0167-6377(02)00231-6 · Cited by 1,060
Self-citationInterior Gradient and Proximal Methods for Convex and Conic Optimization
Auslender, A., & Teboulle, M. (2006) · SIAM Journal on Optimization · doi:10.1137/s1052623403427823 · Cited by 269
Self-citationEntropic Proximal Mappings with Applications to Nonlinear Programming
Teboulle, M. (1992) · Mathematics of Operations Research · doi:10.1287/moor.17.3.670 · Cited by 240
Self-citation
Cited by
Parikh, N., & Boyd, S. (2014) · Foundations and Trends® in Optimization · doi:10.1561/2400000003 · Cited by 4,102
Robust Aggregation for Federated Learning
Pillutla, K., Kakade, S. M., & Harchaoui, Z. (2022) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2022.3153135 · Cited by 801
Device Heterogeneity in Federated Learning: A Superquantile Approach
Laguel, Y., Pillutla, K., Malick, J., & Harchaoui, Z. (2020) · arXiv · doi:10.48550/arxiv.2002.11223 · Cited by 15
Metadata
- Authors
- Beck, A., & Teboulle, M.
- Venue
- SIAM Journal on Optimization
- Published
- 2012-01
- Volume
- 22
- Issue
- 2
- Pages
- 557-580
- ISSN
- 1052-6234 (ISSN-L)
- 1095-7189
- OpenAlex
- W1972010412
- Cited by
- 267
- References
- 5
- FWCI
- 10.86
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Smoothing and First Order Methods: A Unified Framework. https://app.cochat.ai/papers/10.1137/100818327
- The paper
- Beck, A., & Teboulle, M. (2012). Smoothing and First Order Methods: A Unified Framework. SIAM Journal on Optimization. https://doi.org/10.1137/100818327
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.