Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 355

The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.

Some Notes on Alternating Optimization

Bezdek, James C., Hathaway, Richard J.·2002·Lecture Notes in Computer Science

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/3-540-45631-7_39

Cites

1 of 1 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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

  • Practical Optimization

    Gill, P. E., Murray, W., & Wright, M. H. (2019) · doi:10.1137/1.9781611975604 · Cited by 1,737 · cited 2×

    “[13] itemize the following factors: number of variables, constraints on the variables, smoothness of the problem functions and their derivatives, highest level of derivatives that can be efficiently coded, sparseness of the Hessian and Jacobian matrices, number of general linear constraints compared to the number of v…”
    BackgroundMethod

Show all 1 references

Cited by

See all 355

Metadata

Authors
Bezdek, J. C., & Hathaway, R. J.
Venue
Lecture Notes in Computer Science
Published
2002
Pages
288-300
ISSN
0302-9743 (ISSN-L)
OpenAlex
W1528703258
Cited by
355
References
1
FWCI
1.90
Type
conference paper
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: Some Notes on Alternating Optimization. https://app.cochat.ai/papers/10.1007/3-540-45631-7_39
The paper
Bezdek, J. C., & Hathaway, R. J. (2002). Some Notes on Alternating Optimization. Lecture Notes in Computer Science. https://doi.org/10.1007/3-540-45631-7_39

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.