A new method for a class of linear variational inequalities
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
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
“The convergence of z k to a solution z ∗ follows from the standard analysis for contraction methods; see, for example, Theorem 3 in [11].”
From EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization (2015) · cites this paper as [11]
Citations
Cites
Introduction to linear and nonlinear programming
Polak, E. (1974) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1974.1100535 · Cited by 2,100
Introduction to linear and nonlinear programming
Luenberger, D. G. (1973) · Medical Entomology and Zoology · Cited by 1,915
Equilibrium Points of Bimatrix Games
Lemke, C. E., & Howson, Jr. (1964) · Journal of the Society for Industrial and Applied Mathematics · doi:10.1137/0112033 · Cited by 1,231
Bimatrix Equilibrium Points and Mathematical Programming
Lemke, C. E. (1965) · Management Science · doi:10.1287/mnsc.11.7.681 · Cited by 1,029
Complementary pivot theory of mathematical programming
Cottle, R. W., & Dantzig, G. B. (1968) · Linear Algebra and its Applications · doi:10.1016/0024-3795(68)90052-9 · Cited by 767
Lectures on Applied Mathematics
(2000) · Springer eBooks · doi:10.1007/978-3-642-59709-1 · Cited by 767
A polynomial-time algorithm for a class of linear complementarity problems
Kojima, M., Mizuno, S., & Yoshise, A. (1989) · Mathematical Programming · doi:10.1007/bf01587074 · Cited by 345
Solution of symmetric linear complementarity problems by iterative methods
Mangasarian, O. L. (1977) · Journal of Optimization Theory and Applications · doi:10.1007/bf01268170 · Cited by 327
Iterative methods for variational and complementarity problems
Pang, J., & Chan, D. (1982) · Mathematical Programming · doi:10.1007/bf01585112 · Cited by 305
An iterative scheme for variational inequalities
Dafermos, S. C. (1983) · Mathematical Programming · doi:10.1007/bf02591891 · Cited by 278
Asymmetric variational inequality problems over product sets: Applications and iterative methods
Pang, J. (1985) · Mathematical Programming · doi:10.1007/bf02591749 · Cited by 137
He, B. (1992) · Applied Mathematics & Optimization · doi:10.1007/bf01182323 · Cited by 97
Self-citationAn iterative solution of a variational inequality for certain monotone operators in Hilbert space
Bruck, R. E. (1975) · Bulletin of the American Mathematical Society · doi:10.1090/s0002-9904-1975-13874-2 · Cited by 94
A new polynomial time method for a linear complementarity problem
Mizuno, S. (1992) · Mathematical Programming · doi:10.1007/bf01580891 · Cited by 47
An iterative method for generalized complementarity problems
Fang, S. (1980) · IEEE Transactions on Automatic Control · doi:10.1109/tac.1980.1102537 · Cited by 38
Research works printed but not linked: 2
- P.G. Ciarlet,Introduction to Matrix Numerical Analysis and Optimization, Collection of Applied Mathematics for the Master's Degree (Masson, Paris, 1982).
- 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
EXTRA: An Exact First-Order Algorithm for Decentralized Consensus Optimization
Shi, W., Ling, Q., Wu, G., & Yin, W. (2015) · SIAM Journal on Optimization · doi:10.1137/14096668x · Cited by 1,261
“The convergence of z to a solution z∗ follows from the standard analysis for contraction methods; see, for example, Theorem 3 in [11].”
MethodA Class of Projection and Contraction Methods for Monotone Variational Inequalities
He, B. (1997) · Applied Mathematics & Optimization · doi:10.1007/bf02683320 · Cited by 379
“As in [ 6 ], from inequality (19), it is easy to prove that the PC methods are globally convergent if the solution set is nonempty.”
BackgroundMethodSelf-citationModified Projection-Type Methods for Monotone Variational Inequalities
Solodov, M. V., & Tseng, P. (1996) · SIAM Journal on Control and Optimization · doi:10.1137/s0363012994268655 · Cited by 318
A Proximal Gradient Algorithm for Decentralized Composite Optimization
Shi, W., Ling, Q., Wu, G., & Yin, W. (2015) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2015.2461520 · Cited by 307
“solution follows from the standard analysis for contraction methods; see, for example, Theorem 3 in [29].”
MethodGolden ratio algorithms for variational inequalities
Malitsky, Y. (2020) · Mathematical Programming · doi:10.1007/s10107-019-01416-w · Cited by 239
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
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.