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
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
A variant of korpelevich’s method for variational inequalities with a new search strategy
Iusem, A. N., & Svaiter, B. F. (1997) · Optimization · doi:10.1080/02331939708844365 · Cited by 244
Improvements of Some Projection Methods for Monotone Nonlinear Variational Inequalities
He, B. S., & Liao, L. (2002) · Journal of Optimization Theory and Applications · doi:10.1023/a:1013096613105 · Cited by 232
Self-citationZhang, Z., Zheng, L., Yu, J., Li, Y., & Yu, Z. (2017) · IEEE/ASME Transactions on Mechatronics · doi:10.1109/tmech.2017.2683561 · Cited by 192
“In order to control the robots on digital computers, some numerical methods have been presented to solve the QP problems in recent years [25]– [27].”
BackgroundMethodInexact implicit methods for monotone general variational inequalities
He, B. (1999) · Mathematical Programming · doi:10.1007/s101070050086 · Cited by 178
Self-citationGeneralized System for Relaxed Cocoercive Variational Inequalities and Projection Methods
Verma, R. U. (2004) · Journal of Optimization Theory and Applications · doi:10.1023/b:jota.0000026271.19947.05 · Cited by 168
“The SNVI problem (1)–(2) is equivalent to the following system of nonlinear complementarities (SNC): find the elements x*, y* ̨K such that T(y*, x*) ̨K*,T(x*, y*) ̨K* and ÆrT( y*, x*) + x* – y*, x*æ = 0, r>0, (4) ÆhT(x*, y*)+ y* – x*, y*æ= 0, h>0, (5) where K* is a polar cone to K defined by K* = { f ̨H: Æ f , xæ$0, 8…”
MethodThe extragradient algorithm with inertial effects for solving the variational inequality
Dong, Q.-L., Lu, Y.-Y., & Yang, J. (2016) · Optimization · doi:10.1080/02331934.2016.1239266 · Cited by 163
Projection methods, algorithms, and a new system of nonlinear variational inequalities
Verma, R. U. (2001) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(00)00336-9 · Cited by 163
A class of iterative methods for solving nonlinear projection equations
Sun, D. (1996) · Journal of Optimization Theory and Applications · doi:10.1007/bf02192286 · Cited by 152
Guo, D., & Zhang, Y. (2012) · IEEE Transactions on Systems Man and Cybernetics Part C (Applications and Reviews) · doi:10.1109/tsmcc.2012.2183868 · Cited by 148
“According to [41] and [43], an error function at each iteration k = 0, 1, 2, .”
BackgroundMethodVerma, R. U. (2005) · Applied Mathematics Letters · doi:10.1016/j.aml.2005.02.026 · Cited by 134
He, B., & Yang, H. (1998) · Operations Research Letters · doi:10.1016/s0167-6377(98)00044-3 · Cited by 134
Self-citationHu, X., & Wang, J. (2007) · IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics) · doi:10.1109/tsmcb.2007.903706 · Cited by 129
Zhang, Z., Fu, T., Yan, Z., Jin, L., Xiao, L., Sun, Y., Yu, Z., & Li, Y. (2018) · IEEE/ASME Transactions on Mechatronics · doi:10.1109/tmech.2018.2799724 · Cited by 125
Korpelevich’s method for variational inequality problems in Banach spaces
Iusem, A. N., & Nasri, M. (2010) · Journal of Global Optimization · doi:10.1007/s10898-010-9613-x · Cited by 124
Some recent advances in projection-type methods for variational inequalities
Xiu, N., & Zhang, J. (2003) · Journal of Computational and Applied Mathematics · doi:10.1016/s0377-0427(02)00730-6 · Cited by 122
“For solving LVI(F; X ) where F(x) = Mx + q, He [41,42] and Solodov and Tseng [103] gave the following method which requires only one projection per iteration.”
BackgroundMethodA New Performance Index for the Repetitive Motion of Mobile Manipulators
Xiao, L., & Zhang, Y. (2013) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2013.2253461 · Cited by 120
Zhang, Z., & Yan, Z. (2019) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2019.2914618 · Cited by 119
“Generally, the QP scheme can be resolvedbynumericalmethods[6],[7]andneuralnetworkmeth-ods[8]–[13].”
A Hybrid Multi-Objective Scheme Applied to Redundant Robot Manipulators
Chen, D., & Zhang, Y. (2015) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2015.2474157 · Cited by 104
“[of (16)], of which the first elements constitute the optimal solution to the DQP problem depicted in (11) through (14) [48], [49].”
BackgroundSolving a class of linear projection equations
Binsheng, H. (1994) · Numerische Mathematik · doi:10.1007/s002110050048 · Cited by 100
“…Ω ⊂ (cid:0) n is a closed convex set and u ∗ ∈ Ω , we know by the properties of a projection on a closed convex set [14, Appendix B] that By setting v := u − ( Mu + q ) we obtain (14) Adding (14) and (15) we get (16) and it follows that A similar but weaker result of Theorem 1 was given in [9].”
BackgroundInfluentialVariable Joint-Velocity Limits of Redundant Robot Manipulators Handled by Quadratic Programming
Zhang, Z., & Zhang, Y. (2012) · IEEE/ASME Transactions on Mechatronics · doi:10.1109/tmech.2011.2181977 · Cited by 99
“By following [39], the important theorem about the convergence of the QP-solution method (17) is presented later.”
BackgroundMethodInfluentialA modified Korpelevich's method convergent to the minimum-norm solution of a variational inequality
Yao, Y., Marino, G., & Muglia, L. (2012) · Optimization · doi:10.1080/02331934.2012.674947 · Cited by 92
Xiao, L., & Zhang, Y. (2012) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2012.2190142 · Cited by 85
“By following [15] and [16], an important theorem about the global convergence of the discrete-time QP solver (23)–(25) is presented.”
BackgroundMashreghi, J., & Nasri, M. (2009) · Nonlinear Analysis · doi:10.1016/j.na.2009.10.009 · Cited by 70
A Multi-Level Simultaneous Minimization Scheme Applied to Jerk-Bounded Redundant Robot Manipulators
Chen, D., Li, S., Li, W., & Wu, Q. (2019) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2019.2931810 · Cited by 70
“Note that P (·) : Rn+m → is a typical saturation function for the piecewise linear projection from space Rn+m onto set [52], [53], which can be implemented by using an operational amplifier.”
BackgroundSolving a class of constrained ‘black-box’ inverse variational inequalities
He, B., He, X., & Liu, H. X. (2009) · European Journal of Operational Research · doi:10.1016/j.ejor.2009.07.006 · Cited by 65
“Based on (50), we can easily deduce the convergence of the method (see the similar proof in Theorem 3 of [9]).”
MethodSelf-citationChen, A., Lo, H. K., & Yang, H. (2001) · European Journal of Operational Research · doi:10.1016/s0377-2217(00)00287-3 · Cited by 65
Construction algorithms for a class of monotone variational inequalities
Yao, Y., Postolache, M., Liou, Y., & Yao, Z. (2015) · Optimization Letters · doi:10.1007/s11590-015-0954-8 · Cited by 61
A new version of extragradient method for variational inequality problems
Wang, Y., Xiu, N., & Wang, C. (2001) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(01)00213-9 · Cited by 57
“…this paper, we propose a new version of extragradient method for the solution of problem C). searching direction in this method is a combination of the projection residue and modified extra-gradient direction in [l&12], and differs from any one in existing projection-type methods (such as [14-”
MethodTwo-step projection methods for a system of variational inequality problems in Banach spaces
Yao, Y., Liou, Y., & Kang, S. M. (2011) · Journal of Global Optimization · doi:10.1007/s10898-011-9804-0 · Cited by 56
Comparison of Two Kinds of Prediction-Correction Methods for Monotone Variational Inequalities
He, B., Yuan, X., & Zhang, J. J. Z. (2004) · Computational Optimization and Applications · doi:10.1023/b:coap.0000013058.17185.90 · Cited by 54
Self-citationIterative Algorithms for General MultivaluedVariational Inequalities
Yao, Y., Noor, M. A., Liou, Y., & Kang, S. M. (2011) · Abstract and Applied Analysis · doi:10.1155/2012/768272 · Cited by 52
A neural network model for monotone linear asymmetric variational inequalities
He, B., & Yang, H. (2000) · IEEE Transactions on Neural Networks · doi:10.1109/72.822505 · Cited by 52
“(46) Adding the fundamental inequality FI1 and FI2, and using and the notation of we get (47) It follows from the above inequality that (see [9] and [23]) (48) where”
BackgroundMethodInfluentialSelf-citationThe Australian Journal of Mathematical Analysis and Applications
Jung, S.-M. (2009) · Cited by 50
Guo, D., & Zhang, Y. (2014) · IEEE Transactions on Automation Science and Engineering · doi:10.1109/tase.2014.2346490 · Cited by 49
Stability Analysis of Gradient-Based Neural Networks for Optimization Problems
Han, Q., Liao, L., Qi, H., & Qi, L. (2001) · Journal of Global Optimization · doi:10.1023/a:1011245911067 · Cited by 48
“Their models correspond to some variants of the projective gradient method for the complementarity problem and the variational inequality problem [7, 23, 8, 9, 10, 11].”
MethodSolving the bicriteria traffic equilibrium problem with variable demand and nonlinear path costs
Chen, A., Oh, J.-S., Park, D., & Recker, W. W. (2010) · Applied Mathematics and Computation · doi:10.1016/j.amc.2010.08.035 · Cited by 48
“If F is a monotone affine mapping, the search direction can be constructed based on either FI1 alone [24,25] or FI1 + FI2 together [26,27].”
BackgroundFault-tolerant motion planning and control of redundant manipulator
Li, K., & Zhang, Y. (2011) · Control Engineering Practice · doi:10.1016/j.conengprac.2011.11.004 · Cited by 47
Zhang, Z., & Yan, Z. (2018) · IEEE Transactions on Control Systems Technology · doi:10.1109/tcst.2018.2872471 · Cited by 47
“numerical methods [18]–[20] and neural networks [21]–[25].”
A Discrete Model-Free Scheme for Fault-Tolerant Tracking Control of Redundant Manipulators
Tan, N., Zhong, Z., Yu, P., Li, Z., & Ni, F. (2022) · IEEE Transactions on Industrial Informatics · doi:10.1109/tii.2022.3149919 · Cited by 44
“According to [21] and [33], the error function of (24) can be defined as”
BackgroundZhang, Y., Li, W., Liao, B., Guo, D., & Chen, P. (2014) · Journal of Intelligent & Robotic Systems · doi:10.1007/s10846-014-0022-0 · Cited by 35
“Based on the two Bridge theorems, let (cid:9) ∗ = { u ∗ | u ∗ is a solution of (16) } , then an efficient numerical algorithm worked as a QP solver is developed [27]: • Define the error-monitoring function e( u ) = u − P (cid:9) ( u − ( Wu + p )) .”
MethodYao, Y., Liou, Y., Kang, S. M., & Yu, Y. (2011) · Nonlinear Analysis · doi:10.1016/j.na.2011.05.079 · Cited by 33
Zhang, Y., Li, W., & Zhang, Z. (2014) · Robotica · doi:10.1017/s0263574714000757 · Cited by 33
“[30], the sequence {yk} generated by the PLPE-based numerical algorithm globally linearly converges to solution y∗, the first n elements of which constitute the optimal solution q∗ for QP (15)–(17).”
MethodZhang, Z., He, H., & Deng, X. (2023) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2023.3253801 · Cited by 33
“He [19] presented a linear variational inequality (LVI)-based method, and Qiu et al. [21] verified the effectiveness of this method.”
MethodA simple proof for some important properties of the projection mapping
Zhu, T., & Zhigang, Y. (2004) · Mathematical Inequalities & Applications · doi:10.7153/mia-07-45 · Cited by 32
“[6, 7 , 8, 9, 10], � e(u,β)� plays an important role in convergence analysis.”
Convergence Properties of Projection and Contraction Methods for Variational Inequality Problems
Xiu, N., Wang, C. W. C., & Zhang, J. (2001) · Applied Mathematics & Optimization · doi:10.1007/s002450010023 · Cited by 31
Local Convergence Analysis of Projection-Type Algorithms: Unified Approach
Xiu, N., & Zhang, J. (2002) · Journal of Optimization Theory and Applications · doi:10.1023/a:1019637315803 · Cited by 30
A new method for a class of nonlinear variational inequalities with fuzzy mappings
Huang, N. (1997) · Applied Mathematics Letters · doi:10.1016/s0893-9659(97)00116-x · Cited by 30
Yang, L., Liu, Z., & Chen, Y. (2018) · ISA Transactions · doi:10.1016/j.isatra.2018.11.018 · Cited by 29
A modified alternating direction method for convex minimization problems
He, B., & Zhou, J. (2000) · Applied Mathematics Letters · doi:10.1016/s0893-9659(99)00175-5 · Cited by 29
Self-citationJiang, J.-L., & Yuan, X. (2007) · European Journal of Operational Research · doi:10.1016/j.ejor.2007.02.043 · Cited by 27
“2) are reformulated into some LVI, whose special structures motive us to present an efficient variation of the projection–contraction (PC) method originally proposed by He [11,12].”
BackgroundGuo, D., Li, K., & Liao, B. (2018) · Robotica · doi:10.1017/s0263574717000625 · Cited by 23
Balanced Augmented Lagrangian Method for Convex ProgrammingPreprint
He, B., & Yuan, X. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2108.08554 · Cited by 28
Self-citationLi, Q., Qi, W., Li, Z., Xia, H., Kang, Y., & Cheng, L. (2022) · IEEE Transactions on Fuzzy Systems · doi:10.1109/tfuzz.2022.3185450 · Cited by 21
“The QP problems were generally calculated by traditional numerical methods [26], [27].”
MethodState adjustment of redundant robot manipulator based on quadratic programming
Li, K., & Zhang, Y. (2011) · Robotica · doi:10.1017/s0263574711000841 · Cited by 21
“[20, 21].”
Zhang, Y., Li, J., Mao, M., Li, W., & Fu, S. (2015) · Chinese Automation Congress · doi:10.1109/cac.2015.7382493 · Cited by 21
“By following [1], [3], [14], the important theorems illustrating the global linear convergence of E47 and 94LVI algorithms and their proofs are presented as follows.”
BackgroundMethodA Flexible ADMM Algorithm for Big Data Applications
Robinson, D. P., & Tappenden, R. (2016) · Journal of Scientific Computing · doi:10.1007/s10915-016-0306-6 · Cited by 20
On the LVI-based numerical method (E47 algorithm) for solving quadratic programming problems
Zhang, Y., Fu, S., Zhang, Z., Xiao, L., & Li, X. (2011) · IEEE International Conference on Automation and Logistics (ICAL) · doi:10.1109/ical.2011.6024697 · Cited by 20
Distributed Estimation for Multi-Subsystem With Coupled Constraints
Hao, X., Liang, Y., & Li, T. (2022) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2022.3163525 · Cited by 19
Variant extragradient-type method for monotone variational inequalities
Yao, Y., Postolache, M., & Liou, Y. (2013) · Fixed Point Theory and Applications · doi:10.1186/1687-1812-2013-185 · Cited by 17
Full convergence of an approximate projection method for nonsmooth variational inequalities
Bello-Cruz, Y., & Iusem, A. N. (2010) · Mathematics and Computers in Simulation · doi:10.1016/j.matcom.2010.05.026 · Cited by 16
A proximal decomposition algorithm for variational inequality problems
Han, D. (2003) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2003.08.001 · Cited by 15
Solving semidefinite programming problems via alternating direction methods
Yu, Z. (2005) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2005.07.002 · Cited by 15
Verma, R. U. (2001) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(00)00292-3 · Cited by 15
“For more details on variational inequalities, we refer to [1-22].”
BackgroundZhang, Z., He, H., Deng, X., Xie, J., & Luo, Y. (2022) · IEEE Transactions on Circuits and Systems I Regular Papers · doi:10.1109/tcsi.2022.3153560 · Cited by 15
Huang, C., Song, H., Yang, J., & Zhou, B. (2023) · Journal of Computational and Applied Mathematics · doi:10.1016/j.cam.2023.115484 · Cited by 14
Mu, X., & Zhang, Y. (2019) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-019-01540-9 · Cited by 14
Zhang, Z., Kong, L., Yan, Z., Chen, K., Li, S., Qu, X., & Tan, N. (2018) · IEEE International Conference on Robotics and Biomimetics (ROBIO) · doi:10.1109/robio.2018.8665072 · Cited by 13
“Another approach is the numerical method [22]–[24].”
MethodZhang, Y., Li, J., & Zhang, Z. (2012) · Optimal Control Applications and Methods · doi:10.1002/oca.2017 · Cited by 12
“According to [13], LVI-converted piecewise linear equation (14) can be solved with the following numerical algorithm.”
BackgroundMethodA new stepsize rule in He and Zhou's alternating direction method
Han, D., & Lo, H. K. (2002) · Applied Mathematics Letters · doi:10.1016/s0893-9659(01)00115-x · Cited by 12
A system of generalized auxiliary problems principle and a system of variational inequalities
Verma, R. U. (2001) · Mathematical Inequalities & Applications · doi:10.7153/mia-04-39 · Cited by 11
A projected-based neural network method for second-order cone programming
Zhang, Y. (2016) · International Journal of Machine Learning and Cybernetics · doi:10.1007/s13042-016-0569-0 · Cited by 10
“…X ½ u (cid:4) b ð Mu þ q Þ(cid:7) ¼ e ð x ; b Þ e ð y ; b Þ , where X (cid:8) is the solution set of problem (1), then we have the similar results as that in paper [29, 30] From (10) and (11), we have On the other hand, setting v ¼ 0 2 X and v ¼ 2 u (cid:8) 2 X in (12), we can obtain (10) and (11).”
ResultTufa, A. R., & Zegeye, H. (2015) · Arabian Journal of Mathematics · doi:10.1007/s40065-015-0130-0 · Cited by 10
“For example, in [4,9,31], it is proved that some very interesting Korpelevich-type algorithms strongly converge to a solution of VIP.”
BackgroundZhang, Y., Xie, L., Zhang, Z., Li, K., & Xiao, L. (2011) · IEEE International Conference on Automation and Logistics (ICAL) · doi:10.1109/ical.2011.6024740 · Cited by 10
A Neural Control Architecture for Joint-Drift-Free and Fault-Tolerant Redundant Robot Manipulators
Zhong, N., Li, X., Yan, Z., & Zhang, Z. (2018) · IEEE Access · doi:10.1109/access.2018.2878856 · Cited by 10
“Generally, a QP problem is equivalent to a linear variational inequalities (LVI) system which can be solved by numerical methods or neural networks [22]–[24].”
BackgroundXu, M., Yuan, X. M., & Huang, Q.-L. (2007) · Journal of Global Optimization · doi:10.1007/s10898-006-9129-6 · Cited by 10
“β)� ¯ β ≤ � e(u, β)� β . By using the technique of He [ 10 ], we have”
A predict-correct projection method for monotone variant variational inequalities
Han, Q., & He, B. (1998) · Chinese Science Bulletin · doi:10.1007/bf02884138 · Cited by 10
Self-citationSolving linear variational inequality problems by a self-adaptive projection method
Han, D. (2006) · Applied Mathematics and Computation · doi:10.1016/j.amc.2006.06.013 · Cited by 10
“The limited computational results show that the proposed method is quite stable and efficient and have some advantages over the same type of methods [9,10,13].”
MethodInfluentialEncoder based online motion planning and feedback control of redundant manipulators
Zhang, Y., Li, W., Yu, X., Wu, H., & Li, J. (2013) · Control Engineering Practice · doi:10.1016/j.conengprac.2013.06.001 · Cited by 9
Xu, M., & Shao, H. (2012) · Advances in Operations Research · doi:10.1155/2012/357954 · Cited by 9
Li, K., & Zhang, Y. (2012) · Industrial Robot the international journal of robotics research and application · doi:10.1108/01439911211227980 · Cited by 9
“Note that, because the numerical-computing algorithm adopts the core equations (equations (4)-(7)) of He (1994b), it can simply be called the E47 algorithm for presentation convenience.”
BackgroundMethodQiu, J., Li, W., Zhang, Y., Fu, S., & Tan, H. (2014) · International Conference on Systems and Informatics (ICSAI) · doi:10.1109/icsai.2014.7009256 · Cited by 9
Han, D., & Lo, H. K. (2003) · Journal of Global Optimization · doi:10.1023/b:jogo.0000006717.61873.2c · Cited by 9
A new class of projection and contraction methods for solving variational inequality problems
Han, D. (2006) · Computers & Mathematics with Applications · doi:10.1016/j.camwa.2005.11.029 · Cited by 8
A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces
Bello-Cruz, Y., & Millán, R. D. (2015) · Journal of Global Optimization · doi:10.1007/s10898-015-0397-x · Cited by 8
Communication Efficient Curvature Aided Primal-Dual Algorithms for Decentralized Optimization
Li, Y., Voulgaris, P. G., Stipanović, D. M., & Freris, N. M. (2023) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2023.3244904 · Cited by 10
“Proof of Corollary 1: Following Theorem 1 and standard analysis techniques in [53] and [54], we obtain that v tα − v → 0 as t → ∞ .”
MethodSolving a class of asymmetric variational inequalities by a new alternating direction method
Wang, S., Yang, H., & He, B. (2000) · Computers & Mathematics with Applications · doi:10.1016/s0898-1221(00)85004-x · Cited by 8
“For problem (8),(9), e(u) = ( f ( x ) - - A T y ) (12) Y - P v [ Y - ( A x - a ) ] " In the literature of variational inequalities [2,6,9,10,25], He(u)[] is always viewed as an 'error bound', which quantitatively measures how much u fails to be in ~*.”
BackgroundSelf-citationNew decomposition methods for solving variational inequality problems
Han, D., & Sun, W. (2003) · Mathematical and Computer Modelling · doi:10.1016/s0895-7177(03)00016-5 · Cited by 8
A new extragradient-like method for solving variational inequality problems
Huang, N., Ma, C., & Liu, Z. (2012) · Fixed Point Theory and Applications · doi:10.1186/1687-1812-2012-223 · Cited by 7
A new projection and contraction method for linear variational inequalities
Bnouhachem, A. (2005) · Journal of Mathematical Analysis and Applications · doi:10.1016/j.jmaa.2005.03.095 · Cited by 7
“, x[8] are the locations of the additional points (called Ste points).”
BackgroundThe iterative methods for monotone generalized variational inequalities
Zhao, Y.-B. (1997) · Optimization · doi:10.1080/02331939708844364 · Cited by 7
Zhang, Y., Yin, Z., Huang, H., He, L., & Jin, L. (2017) · Annual Conference of the IEEE Industrial Electronics Society (IECON) · doi:10.1109/iecon.2017.8217171 · Cited by 7
“In addition, an important theorem about the global convergence of the discrete-time QP solver (17) is provided for the completeness of the investigation [17], [19], [20].”
BackgroundMethodInfluentialExtended Projection Methods for Monotone Variational Inequalities
Zhao, Y.-B. (1999) · Journal of Optimization Theory and Applications · doi:10.1023/a:1021781318170 · Cited by 7
Projection and contraction methods for semidefinite programming
Han, Q. (1998) · Applied Mathematics and Computation · doi:10.1016/s0096-3003(97)10113-8 · Cited by 7
Energy-efficient yaw moment control for humanoid robot utilizing arms swing
Yang, L., Liu, Z., & Zhang, Y. (2016) · International Journal of Precision Engineering and Manufacturing · doi:10.1007/s12541-016-0136-3 · Cited by 6
On the Iteration Complexity of Some Projection Methods for Monotone Linear Variational Inequalities
Chen, C., Fu, X., He, B., & Yuan, X. (2017) · Journal of Optimization Theory and Applications · doi:10.1007/s10957-016-1051-6 · Cited by 6
“The first method to be discussed is the projection method proposed in [5] and later generalized in [3] to the G-norm (see Algorithm 2.”
MethodSelf-citation
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.