The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
The Hybrid Steepest Descent Method for the Variational Inequality Problem Over the Intersection of Fixed Point Sets of Nonexpansive Mappings
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.
Integrity signals
Registry
Cites
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.
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
Cited by
Sidky, E. Y., & Pan, X. (2008) · Physics in Medicine and Biology · doi:10.1088/0031-9155/53/17/021 · Cited by 1,995
A unified treatment of some iterative algorithms in signal processing and image reconstruction
Byrne, C. (2004) · Inverse Problems · doi:10.1088/0266-5611/20/1/006 · Cited by 1,339
Wavelets, Ridgelets, and Curvelets for Poisson Noise Removal
Zhang, B., Fadili, J. M., & Starck, J. L. (2008) · IEEE Transactions on Image Processing · doi:10.1109/tip.2008.924386 · Cited by 349
Iterative Methods for Fixed Point Problems in Hilbert Spaces
Cegielski, A. (2013) · Lecture Notes in Mathematics · doi:10.1007/978-3-642-30901-4 · Cited by 318
Convergence of Hybrid Steepest-Descent Methods for Variational Inequalities
Xu, H. K., & Kim, T. H. (2003) · Journal of Optimization Theory and Applications · doi:10.1023/b:jota.0000005048.79379.b6 · Cited by 312
Metadata
- Venue
- Studies in Computational Mathematics
- Publisher
- Elsevier
- Published
- 2001
- Pages
- 473-504
- ISSN
- 1570-579X (ISSN-L)
- OpenAlex
- W1546168022
- Cited by
- 610
- References
- 1
- FWCI
- 15.24
- Type
- book chapter
- 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: The Hybrid Steepest Descent Method for the Variational Inequality Problem Over the Intersection of Fixed Point Sets of Nonexpansive Mappings. https://app.cochat.ai/papers/10.1016/s1570-579x(01)80028-8
- The paper
- The Hybrid Steepest Descent Method for the Variational Inequality Problem Over the Intersection of Fixed Point Sets of Nonexpansive Mappings. (2001). Studies in Computational Mathematics. https://doi.org/10.1016/s1570-579x(01)80028-8
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.