The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Approximation accuracy, gradient methods, and error bound for structured convex optimization
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
A New Alternating Minimization Algorithm for Total Variation Image Reconstruction
Wang, Y., Yang, J., Yin, W., & Zhang, Y. (2008) · SIAM Journal on Imaging Sciences · doi:10.1137/080724265 · Cited by 1,975
Model selection and estimation in the Gaussian graphical model
Yuan, M., & Lin, Y. (2007) · Biometrika · doi:10.1093/biomet/asm018 · Cited by 1,627
A New Approach to Collaborative Filtering: Operator Estimation with Spectral Regularization
Abernethy, J., Bach, F., Evgeniou, T., & Vert, J.-P. (2008) · arXiv · doi:10.48550/arxiv.0802.1430 · Cited by 210 · cited 1×
“This problem has applications to dimension reduction in multivariate linear regression [75] and multi-task learning [1, 3, 106].”
Method
Cited by
Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-Łojasiewicz Condition
Karimi, H., Nutini, J., & Schmidt, M. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-46128-1_50 · Cited by 824
On the linear convergence of the alternating direction method of multipliers
Hong, M., & Luo, Z.-Q. (2017) · Mathematical Programming · doi:10.1007/s10107-016-1034-2 · Cited by 690
Hankel Matrix Rank Minimization with Applications to System Identification and Realization
Fazel, M., Pong, T. K., Sun, D., & Tseng, P. (2013) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/110853996 · Cited by 487
Self-citationA Differential Equation for Modeling Nesterov's Accelerated Gradient Method: Theory and Insights
Su, W., Boyd, S., & Candès, E. J. (2015) · arXiv (Cornell University) · doi:10.48550/arxiv.1503.01243 · Cited by 481
Structured Variable Selection with Sparsity-Inducing Norms
Jenatton, R., Audibert, J.-Y., & Bach, F. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0904.3523 · Cited by 431
Metadata
- Authors
- Tseng, P.
- Venue
- Mathematical Programming
- Published
- 2010-08-17
- Volume
- 125
- Issue
- 2
- Pages
- 263-295
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2101868363
- Cited by
- 224
- References
- 4
- FWCI
- 9.07
- 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: Approximation accuracy, gradient methods, and error bound for structured convex optimization. https://app.cochat.ai/papers/10.1007/s10107-010-0394-2
- The paper
- Tseng, P. (2010). Approximation accuracy, gradient methods, and error bound for structured convex optimization. Mathematical Programming. https://doi.org/10.1007/s10107-010-0394-2
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.