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
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
Items 101–161 of 161
A Time-Varying-Constrained Motion Generation Scheme for Humanoid Robot Arms
Zhang, Z., Kong, L., & Niu, Y. (2018) · Lecture notes in computer science · doi:10.1007/978-3-319-92537-0_86 · Cited by 6
“Supposing that the initial primal-dual decision variable vector is set as u ∈ R, for iteration number k = 0, 1, 2, · · · , if u ∈ Ω∗, then [15] u = u − ‖ε(u )‖(2)2σ(u) ‖σ(u)‖(2)2 (27) where ε(u) = u − ΦΩ(u − (Γu + q)) and σ(u) = (Γ + I)ε(u).”
Liao, L., & Wang, S. (2002) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(01)00269-3 · Cited by 6
“There are already a substantial number of algorithms for solving problem (1) (see [3-13] and references therein).”
BackgroundMethodInfluentialSolving a class of matrix minimization problems by linear variational inequality approaches
Tao, M., Yuan, X., & He, B.-S. (2011) · Linear Algebra and its Applications · doi:10.1016/j.laa.2010.11.041 · Cited by 6
Self-citationDecomposition Method for a Class of Monotone Variational Inequality Problems
He, B. S., Liao, L., & Yang, H. (1999) · Journal of Optimization Theory and Applications · doi:10.1023/a:1021736008175 · Cited by 6
“For any solution point of VI(W, Q), denoted by w* = (x*, y*, z*), we will show that, if Bk = B, the generated sequence {wk = (xk, yk, z k )} satisfies Therefore, from (14), (16), and Without loss of generality, we assume that Bk+1 > 1. Hence using ( 8 ), (11), (15), we have”
BackgroundSelf-citationAlNemer, G., Ali, R., & Kazmi, K. R. (2021) · Journal of Inequalities and Applications · doi:10.1186/s13660-021-02565-3 · Cited by 5
Matrix linear variational inequality approach for finite element model updating
Yuan, Q. (2011) · Mechanical Systems and Signal Processing · doi:10.1016/j.ymssp.2011.09.016 · Cited by 5
Rassias, T. M., & Verma, R. U. (2002) · Mathematical Inequalities & Applications · doi:10.7153/mia-05-17 · Cited by 5
Local Convergence Behavior of Some Projection-Type Methods for Affine Variational Inequalities
Zhang, J., & Xiu, H. H. (2001) · Journal of Optimization Theory and Applications · doi:10.1023/a:1026474207884 · Cited by 5
Wang, X., Gu, X., Huang, K., Lu, Q., & Tan, N. (2024) · IEEE/ASME Transactions on Mechatronics · doi:10.1109/tmech.2024.3513645 · Cited by 4
“For the optimization solver (23), it can be obtained that [35] where x ∗ ∈ Ω ∗ , Ω ∗ represents the set of feasible solutions.”
Ke, Y., & Ma, C. (2013) · Fixed Point Theory and Applications · doi:10.1186/1687-1812-2013-189 · Cited by 4
A variational inequality approach for constrained multifacility Weber problem under gauge
Jiang, J., Zhang, S., Zhang, S., & Wen, J. (2017) · Journal of Industrial and Management Optimization · doi:10.3934/jimo.2017091 · Cited by 4
“Existing algorithms available for solving the LVI (18)-(19) include those presented in [12, 13], etc.”
MethodProjection and Contraction Method for Pricing American Bond Options
Zhang, Q., Wang, Q., Zuo, P., Du, H., & Wu, F. (2023) · Mathematics · doi:10.3390/math11224689 · Cited by 4
“Based on the positive definiteness of the discretized matrix A , the projected and contraction method (PCM) [26,27] is a fast numerical method to solve the variational form (18).”
MethodA Comparison of Different Contraction Methods for Monotone Variational Inequalities
He, B., Wang, X., & Yang, J. (2009) · Journal of Computational Mathematics · doi:10.4208/jcm.2009.27.4.013 · Cited by 4
Self-citationA New Rank-two Semidefinite Programming Relaxation Method for Multiuser Detection Problem
Mu, X., & Zhang, Y. (2011) · Wireless Personal Communications · doi:10.1007/s11277-011-0246-2 · Cited by 4
Verification of Iterative Methods for the Linear Complementarity Problem
Najafi, H. S., & Edalatpanah, S. A. (2016) · Advances in computational intelligence and robotics book series · doi:10.4018/978-1-4666-9644-0.ch021 · Cited by 3
Alansari, M. O., Ali, R., & Farid, M. (2025) · Mathematics · doi:10.3390/math13233740 · Cited by 3
A generalized Weber problem with different gauges for different regions
Jiang, J., Luan, F., Wang, L., & Zhu, X. X. (2014) · Applied Mathematics and Computation · doi:10.1016/j.amc.2014.07.005 · Cited by 3
Xu, H. (2012) · Journal of Inequalities and Applications · doi:10.1186/1029-242x-2012-93 · Cited by 3
“Such a method is called a projection method, as described elsewhere [13-17].”
MethodPeng, J., Wang, Z., Yu, S., & Tang, Z. (2025) · Mathematics · doi:10.3390/math13050811 · Cited by 3
Solving Linear Equation Systems by Simplified 94LVI Algorithm from Quadratic Program
Zhang, Z. Y., & Mao, M. (2024) · International Annual Conference on Complex Systems and Intelligent Science (CSIS-IAC) · doi:10.1109/csis-iac63491.2024.10919456 · Cited by 3
“This section details the common quadratic program problem formulation and the 94LVI solution algorithm [1], [5], [7], being quite valuable and meaningful for solving the linear equation system of interest in this paper.”
InfluentialA Modified Projection and Contraction Method for a Class of Linear Complementarity Problems
He, B. S. (1996) · Journal of Computational Mathematics · doi:10.4208/jcm.v14.n1.p54 · Cited by 3
“As in [7], one can prove the global linear convergence from (27).”
Self-citationNonlinear implicit variational inequalities involving partially relaxed pseudomonotone mappings
Verma, R. U. (2003) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(03)90204-5 · Cited by 3
Gu, Y., Jiang, J., Ling, L., Lv, Y., & Zhang, S. (2022) · Asia Pacific Journal of Operational Research · doi:10.1142/s0217595922400103 · Cited by 2
An inexact parallel splitting augmented Lagrangian method for large system of linear equations
Peng, Z., & Wu, D. (2010) · Applied Mathematics and Computation · doi:10.1016/j.amc.2010.03.018 · Cited by 2
“For example, He [14] developed a class of projection-contraction (PC) methods for monotone linear variational inequalities (LVIs).”
Forward–backward-based descent methods for composite variational inequalities
He, B., & Yuan, X. (2012) · Optimization methods & software · doi:10.1080/10556788.2011.645033 · Cited by 2
“…Remark 5.1 Although the proposed Algorithm 4 is convergent for any β > 0, we suggest to choose β dynamically at each iteration such that Remark 5.2 For the special case that S ≡ 0, the proposed Algorithm 4 reduces to the method for linear VI which was presented in [11] and studied later in [23].”
MethodInfluentialSelf-citationCui, Y., & He, B. (1999) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(99)00294-1 · Cited by 2
Self-citationThe Prediction-Correction and Relaxed Hybrid Steepest-Descent Method for Variational Inequalities
Xu, H., Shao, H., & Zhang, Q. (2009) · International Workshop on Education Technology and Computer Science · doi:10.1109/etcs.2009.63 · Cited by 2
“Then the variational inequality problem ( )VI F K, [13] is to find x ∗ ∈ K such that ( ) 0 ,x K x x F x x K∗ ∗ ∗∈ , < − , >≥ ∀ ∈ Furthermore in the space nIR , variational inequality problem ( )VI f , Ω [18] is to find x X∗ ∈ such that ( )( ) 0 ,Tf x y x x∗ ∗− ≥ ∀ ∈ Ω where n n: IR IRF → be an operator, nIRΩ ⊆ is a cl…”
Iteration complexity of generalized complementarity problems
Salahuddin, S., & Alesemi, M. (2019) · Journal of Inequalities and Applications · doi:10.1186/s13660-019-2024-8 · Cited by 2
Projection and contraction method for updating simultaneously mass and stiffness matrices
Xiang, M.-L., & Dai, H. (2022) · Applied Mathematical Modelling · doi:10.1016/j.apm.2022.04.032 · Cited by 2
Verma, R. U. (2002) · Journal of Computational Analysis and Applications · doi:10.1023/a:1012983317154 · Cited by 2
Gong, H., Yin, Z., Chen, D., Jin, L., & Zhang, Y. (2017) · International Conference on Control, Automation and Systems (ICCAS) · doi:10.23919/iccas.2017.8204355 · Cited by 1
Jiang, J., Assani, S., Cheng, K., & Zhu, X. X. (2013) · Abstract and Applied Analysis · doi:10.1155/2013/624398 · Cited by 1
Convergence estimates and approximation solvability of nonlinear implicit variational inequalities
Verma, R. U. (2001) · International Journal of Stochastic Analysis · doi:10.1155/s1048953302000047 · Cited by 1
“To learn more details about the general variational inequalities and related algorithmic applications, see [1-18]).”
BackgroundAn LVI-based Numerical Algorithm for Solving Quadratic Programming Problems
Zhang, Y., & Li, X. (2012) · Or Transactions · Cited by 1
A projection and contraction method for circular cone programming support vector machines
Mu, X., & Dong, G. (2021) · International Journal of Machine Learning and Cybernetics · doi:10.1007/s13042-021-01360-2 · Cited by 1
A New Projection Contraction Algorithm for Semidefinite Programming
Bi, H., Zhao, X., & Ren, J. (2022) · Procedia Computer Science · doi:10.1016/j.procs.2022.10.086 · Cited by 1
Robotic RMP Schemes and QP Formulations
Zhang, Y., & Zhang, Z. (2013) · Springer eBooks · doi:10.1007/978-3-642-37518-7_2 · Cited by 1
New projection-type methods for monotone LCP with finite termination
Zhang, J., & Xiu, N. (2002) · Numerische Mathematik · doi:10.1007/s002110100362 · Cited by 1
Gao, Y. (1998) · Applied mathematics/Applied Mathematics. A Journal of Chinese Universities/Gao-xiao yingyong shuxue xuebao · doi:10.1007/s11766-998-0035-1 · Cited by 1
Application to Mobile Robot RMP
Zhang, Y., & Guo, D. (2015) · Springer eBooks · doi:10.1007/978-3-662-47334-4_15
An Extension of a Class of Iterative Procedures for Nonlinear Quasivariational Inequalities
Verma, R. U. (2002) · Journal of Computational Analysis and Applications · doi:10.1023/a:1013171724578
A Heuristic Algorithm for Constrain Single-Source Problem with Constrained Customers
Dehkordi, S. A. R., Farahani, M., & Ahmadi, A. (2012)
A New Decomposition Method for Variational Inequalities with Linear Constraints
Zhang, M., Han, D., Qian, G., & Yan, X. (2011) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-011-9931-2
“In [28–30], ‖e(u,β)‖ was viewed as a measure function, which measures how much u fails to be a solution point.”
Role of twice fréchet-differentiable mappings in general auxiliary problem principle
Lin, E.-B., & Verma, R. U. (2003) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(03)00153-6
Some Recent Trends in Variational Inequalities and Optimization Problems with Applications
Bnouhachem, A., Hamdi, A., & Minghua, X. (2014) · Abstract and Applied Analysis · doi:10.1155/2014/215098
Numerical Methods for Solving Variational Inequalities and Complementarity Problems
Bnouhachem, A., & Li, M. (2012) · Advances in Operations Research · doi:10.1155/2012/925915
Physical Robot Manipulator Experiments
Zhang, Y., & Zhang, Z. (2013) · Springer eBooks · doi:10.1007/978-3-642-37518-7_11
Projection and Contraction Methods for Solving Symmetric Cone Variational Inequalities
Zeng, Y., & Lou, Y. (2011) · International Conference on Business Computing and Global Informatization · doi:10.1109/bcgin.2011.180
“, reference [1], [2], [3], [4], [5], [6].”
Xu, H. (2013) · Abstract and Applied Analysis · doi:10.1155/2013/515902
“Such a method is called the projectionmethod ormore results about the projection method see [6, 8, 20] and so forth.”
MethodA new Algorithm for the location of m-facilities for n-apparent customers
Dehkordi, S. A. R. (2012) · Acta computare · doi:10.5899/2012/cjac-001-013
Zhang, Y., & Zhang, Z. (2013) · Springer eBooks · doi:10.1007/978-3-642-37518-7_6
PGA-based Predictor-Corrector Algorithms for Monotone Generalized Variational InequalityPreprint
Yu, Y. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2009.03548
“Inspired by the extragradient method [18] and the projection contraction algorithms [11,15] for monotone variational inequality (MVI), we propose a class of PGA-based Predictor-Corrector algorithms for MGVI.”
MethodInfluentialZhang, Y., & Jin, L. (2017) · Wiley eBooks · doi:10.1002/9781119381440.refs
Zhang, Y., & Zhang, Z. (2013) · Springer eBooks · doi:10.1007/978-3-642-37518-7_7
Li, Z., Liu, J., Yuan, Z., Yu, P., & Zhang, Y. (2025) · International Conference on Advanced Computing and Intelligent Robotics Applications (ACIRA) · doi:10.1109/acira67680.2025.11334856
“In practical experiments, P Ω( t ) ( · ) is defined as [18]: B. OIpU-94LVI and OIpU-E47 Algorithms Both the OIpU-94LVI algorithm [20] and the OIpU-E47 algorithm [19] are the iterative methods designed to find the zero point of the error function (which will also be a Zhang function in future) e ( y…”
InfluentialChen, Y., Cai, X., & Han, D. (2026) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-025-02901-3
“In this paper, we focus on two fundamental schemes [11, 12, 21] denoted as Algorithm-I and Algorithm-II, for which the iteration complexity was recently established [6].”
Wang, L.-X., Chencan, Z., & Shen, Q. (2026) · Electronics · doi:10.3390/electronics15081720
Zhang, Y., Mu, X., & Zong, Z. (2026) · Axioms · doi:10.3390/axioms15060428
Distributed Fault Detection for Multiagent Systems With Coupled State Constraints
Liu, L., Yu, C., Zhang, Y., Ma, Y., & Xu, J. (2026) · IEEE Transactions on Instrumentation and Measurement · doi:10.1109/tim.2026.3709360
On the Linear Convergence of PC-Method for a Class of Linear Variational Inequalities
Xiu, N.-H. (1999) · Journal of Computational Mathematics · doi:10.4208/jcm.v17.n2.p199
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.