CoChat

A new method for a class of linear variational inequalities

He, Bingsheng · 1994 · Mathematical Programming

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

Overview

Integrity signals

Registry

Crossref · 10.1007/bf01581141

Cites

15 of 15 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 15 references

Research works printed but not linked: 2

  1. P.G. Ciarlet,Introduction to Matrix Numerical Analysis and Optimization, Collection of Applied Mathematics for the Master's Degree (Masson, Paris, 1982).
  2. P.T. Harker and J.S. Pang, “A damped-Newton method for the linear complementarity problem,”Lectures in Applied Mathematics 26 (1990) 265–284.

Cited by

See all 162

Metadata

Authors
He, B.
Affiliations
Nanjing University (CN)
Corresponding author
He, Bingsheng
Venue
Mathematical Programming
Published
1994-08
Volume
66
Issue
1-3
Pages
137-144
ISSN
  • 0025-5610 (ISSN-L)
  • 1436-4646
OpenAlex
W1974974058
Cited by
162
References
15
Citations by year
2026: 3 · 2025: 3 · 2024: 2 · 2023: 4 · 2022: 7 · 2021: 3 · 2020: 1 · 2019: 5 · 2018: 8 · 2017: 6 · 2016: 5 · 2015: 8 · 2014: 6 · 2013: 10 · 2012: 13
FWCI
3.90
Type
journal article
Language
en
Open access
closed
Licence
www.springer.com/tdm (tdm)
Locations
Mathematical Programming (publishedVersion)
Topics
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Optimization and Variational Analysis
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
  • Physical Sciences › Mathematics › Numerical Analysis › Advanced Optimization Algorithms Research
Keywords
linear variational inequalities, iterative methods, projection onto convex sets, convergence analysis

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: A new method for a class of linear variational inequalities. https://app.cochat.ai/papers/10.1007/bf01581141
The paper
He, B. (1994). A new method for a class of linear variational inequalities. Mathematical Programming. https://doi.org/10.1007/bf01581141

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.