Alfredo N. Iusem
Abstract
An operator T: ℝⁿ → ℝⁿ is paramonotone iff it is monotone and ⟨T(x) − T(y), x − y⟩ = 0 implies T(x) = T(y). This definition can be extended to operators defined in a convex set whose values are subsets of ℝⁿ. The notion of paramonotonicity is required to ensure convergence of several interior point methods for variational inequalities. In this paper we establish several properties of paramonotone operators. In particular, we give sufficient conditions for paramonotonicity in the differentiable case. We prove that if the symmetric part of the Jacobian matrix is positive semidefinite and its rank is greater than or equal to the rank of the Jacobian matrix at all points then the operator is paramonotone.
Author information
Alfredo N. Iusem
References
- R. S. Burachik, A. N. Iusem: A generalized proximal point algorithm for the nonlinear complementarity problem (to be published in RAIRO, Recherche Opérationelle).Google Scholar
- Y. Censor, Y., A. N. Iusem, S. Zenios: An interior point method with Bregman functions for the variational inequality problem with paramonotone operators, Mathematical Programming 81 (1998) 373-400.https://doi.org/10.1007/BF01580089Google Scholar
- D. Kinderlehrer, G. Stampacchia: An Introduction to Variational Inequalities and their Applications, Academic Press, New York, 1980.Google Scholar
- Y. Nestorov, A. S. Nemirovsky: Interior Point Polynomial Algorithms in Convex Programming, SIAM Publications, Philadelphia, PA, 1994.https://doi.org/10.1137/1.9781611970791Google Scholar
- F. A. Potra, Y. Ye: Interior point methods for nonlinear complementarity problems, Technical Report 15, Department of Mathematics, University of Iowa, 1991.Google Scholar
- R. T. Rockafellar: Convex Analysis, Princeton University Press, Princeton, N.J., 1970.Google Scholar
Suggested citation
Published by Heldermann Verlag, 1998. Rights now held by Banach Press LLC.
