DC formulations and algorithms for sparse optimization problems
The DOI matches its Crossref record; 61 of the 61 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“This issue was addressed by a difference-of-convex-functions (DC) programme [31], [52], [99] by representing the rank function via an equivalent DC function.”
From Edge artificial intelligence for 6g: vision, enabling technologies, and applications (2022) · cites this paper as [99]
Citations
Cites
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
Donoho, D. L. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.871582 · Cited by 23,994
Donoho, D. L. (2004) · Cited by 16,703
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
UCI Repository of machine learning databases
Blake, C. L. (1998) · Medical Entomology and Zoology · Cited by 10,582
De-noising by soft-thresholding
Donoho, D. L. (1995) · IEEE Transactions on Information Theory · doi:10.1109/18.382009 · Cited by 9,619
Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Fan, J., & Li, R. (2001) · Journal of the American Statistical Association · doi:10.1198/016214501753382273 · Cited by 8,900
Decoding by Linear Programming
Candes, E. J., & Tao, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2005.858979 · Cited by 7,121
A Singular Value Thresholding Algorithm for Matrix Completion
Cai, J.-F., Candès, E. J., & Shen, Z. (2010) · SIAM Journal on Optimization · doi:10.1137/080738970 · Cited by 5,809
Exact Matrix Completion via Convex Optimization
Candès, E. J., & Recht, B. (2009) · Foundations of Computational Mathematics · doi:10.1007/s10208-009-9045-5 · Cited by 4,877
Research works printed but not linked: 3
- Le Thi, H.A., Pham Dinh, T., Muu, L.D.: Exact penalty in D.C. programming. Vietnam J. Math. 27(2), 169–178 (1999)
- Nocedal, Jorge, Wright, Stephen J.: Numerical Optimization 2nd. Springer, Berlin (2006)
- Pham Dinh, T., Le Thi, H.A.: Recent advances in DC programming and DCA. Trans. Comput. Collect. Intell. 8342, 1–37 (2014)
Cited by
Federated Learning via Over-the-Air Computation
Yang, K., Jiang, T., Shi, Y., & Ding, Z. (2020) · IEEE Transactions on Wireless Communications · doi:10.1109/twc.2019.2961673 · Cited by 1,084
“Specifically, to enhance sparsity, we adopt a novel DC representation for the 0-norm [35], which is given by the difference of the 1-norm and the Ky Fan k-norm [36], i.”
BackgroundMethodEdge artificial intelligence for 6g: vision, enabling technologies, and applications
Letaief, K. B., Shi, Y., Lu, J., & Lu, J. (2022) · IEEE Journal on Selected Areas in Communications · doi:10.1109/jsac.2021.3126076 · Cited by 829
“This issue was addressed by a difference-of-convex-functions (DC) programm [99], [31], [52] by representing the rank function via an equivalent DC function.”
MethodData Shuffling in Wireless Distributed Computing via Low-Rank Optimization
Yang, K., Shi, Y., & Ding, Z. (2019) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2019.2912139 · Cited by 43
“Recently, a DC (difference-of-convex-functions) [11], [12] representation of the rank function has been proposed in [13] with demonstrated effectiveness.”
BackgroundMethodInfluential
Metadata
- Authors
- Gotoh, J.-Y., Takeda, A., & Tono, K.
- Affiliations
- Chuo University (JP)
- RIKEN Center for Advanced Intelligence Project (JP)
- NEC (Japan) (JP)
- Corresponding author
- Takeda, Akiko
- Venue
- Mathematical Programming
- Published
- 2017-07-26
- Volume
- 169
- Issue
- 1
- Pages
- 141-176
- ISSN
- 0025-5610 (ISSN-L)
- 1436-4646
- OpenAlex
- W2738241071
- Cited by
- 184
- References
- 61
- Citations by year
- 2026: 8 · 2025: 25 · 2024: 27 · 2023: 26 · 2022: 16 · 2021: 31 · 2020: 16 · 2019: 13 · 2018: 15 · 2017: 7
- FWCI
- 11.00
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Mathematical Programming (publishedVersion)
- Funders
- Japan Society for the Promotion of Science (16H01833, 15K01204, 26242027)
- Topics
- Physical Sciences › Computer Science › Signal Processing › Sparse and Compressive Sensing Techniques
- Physical Sciences › Computer Science › Computational Theory and Mathematics › Optimization and Variational Analysis
- Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
- Keywords
- sparse optimization, DC algorithm, cardinality constraints, rank constraint, rank minimization, penalty method, quadratic minimization, soft thresholding, subgradients
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: DC formulations and algorithms for sparse optimization problems. https://app.cochat.ai/papers/10.1007/s10107-017-1181-0
- The paper
- Gotoh, J.-Y., Takeda, A., & Tono, K. (2018). DC formulations and algorithms for sparse optimization problems. Mathematical Programming. https://doi.org/10.1007/s10107-017-1181-0
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.