A self-adaptive method for solving a system of nonlinear variational inequalities.
Shi, Chaofeng (2007)
Mathematical Problems in Engineering
Similarity:
Displaying similar documents to “A new method for solving monotone generalized variational inequalities.”
A self-adaptive method for solving a system of nonlinear variational inequalities.
Partially relaxed cocoercive variational inqualities and auxiliary problem principle.
Verma, Ram U. (2004)
Journal of Applied Mathematics and Stochastic Analysis
Similarity:
Generalized partially relaxed pseudomonotone variational inequalities and general auxiliary problem principle.
Verma, Ram U. (2006)
Journal of Inequalities and Applications [electronic only]
Similarity:
Generalized auxiliary problem principle and solvability of a class of nonlinear variational inequalities involving cocoercive and co-Lipschitzian mappings.
Verma, Ram U. (2001)
JIPAM. Journal of Inequalities in Pure & Applied Mathematics [electronic only]
Similarity:
A new approach to the extragradient method for nonlinear variational inequalities.
Verma, Ram U. (2000)
Journal of Inequalities and Applications [electronic only]
Similarity:
Super-relaxed -proximal point algorithms, relaxed -proximal point algorithms, linear convergence analysis, and nonlinear variational inclusions.
Agarwal, Ravi P., Verma, Ram U. (2009)
Fixed Point Theory and Applications [electronic only]
Similarity:
General system of strongly pseudomonotone nonlinear variational inequalities based on projection systems.
Verma, Ram U. (2007)
JIPAM. Journal of Inequalities in Pure & Applied Mathematics [electronic only]
Similarity:
Global convergence property of modified Levenberg-Marquardt methods for nonsmooth equations
Shou-qiang Du, Yan Gao (2011)
Applications of Mathematics
Similarity:
In this paper, we discuss the globalization of some kind of modified Levenberg-Marquardt methods for nonsmooth equations and their applications to nonlinear complementarity problems. In these modified Levenberg-Marquardt methods, only an approximate solution of a linear system at each iteration is required. Under some mild assumptions, the global convergence is shown. Finally, numerical results show that the present methods are promising.
Second-order differential proximal methods for equilibrium problems.
Moudafi, A. (2003)
JIPAM. Journal of Inequalities in Pure & Applied Mathematics [electronic only]
Similarity:
Rescaled proximal methods for linearly constrained convex problems
Paulo J.S. Silva, Carlos Humes (2007)
RAIRO - Operations Research
Similarity:
We present an inexact interior point proximal method to solve linearly constrained convex problems. In fact, we derive a primal-dual algorithm to solve the KKT conditions of the optimization problem using a modified version of the rescaled proximal method. We also present a pure primal method. The proposed proximal method has as distinctive feature the possibility of allowing inexact inner steps even for Linear Programming. This is achieved by using an error criterion that ...