CoChat

DC formulations and algorithms for sparse optimization problems

Gotoh, Jun-ya, Takeda, Akiko, Tono, Katsuya · 2018 · Mathematical Programming

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

Crossref · 10.1007/s10107-017-1181-0

Cites

61 of 61 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

Citations

Cites

Show all 61 references

Research works printed but not linked: 3

  1. Le Thi, H.A., Pham Dinh, T., Muu, L.D.: Exact penalty in D.C. programming. Vietnam J. Math. 27(2), 169–178 (1999)
  2. Nocedal, Jorge, Wright, Stephen J.: Numerical Optimization 2nd. Springer, Berlin (2006)
  3. Pham Dinh, T., Le Thi, H.A.: Recent advances in DC programming and DCA. Trans. Comput. Collect. Intell. 8342, 1–37 (2014)

Cited by

See all 184

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.