Abstract
The D-gap function has been useful in developing unconstrained descent methods for solving strongly monotone variational inequality problems. We show that the D-gap function has certain properties that are useful also for monotone variational inequality problems with bounded feasible set. Accordingly, we develop two unconstrained methods based on them that are similar in spirit to a feasible method of Zhu and Marcotte based on the regularized-gap function. We further discuss a third method based on applying the D-gap function to a regularized problem. Preliminary numerical experience is also reported.
Similar content being viewed by others
References
F. Al-Khayyal and J. Kyparisis, “Finite convergence of algorithms for nonlinear programs and variational inequalities,” Journal of Optimization Theory and Applications, vol. 70, pp. 319-332, 1991.
G. Auchmuty, “Variational principles for variational inequalities,” Numerical Functional Analysis and Optimization, vol. 10, pp. 863-874, 1989.
A. Auslender, Optimisation: Méthodes Numériques, Masson: Paris, 1976.
D.P. Bertsekas, Nonlinear Programming, Athena Scientific: Belmont, 1995.
J.V. Burke and M.C. Ferris, “Weak sharp minima in mathematical programming,” SIAM Journal on Control and Optimization, vol. 31, pp. 1340-1359, 1993.
S.C. Billups and M.C. Ferris, “QPCOMP: A quadratic program based solver for mixed complementarity problems,” Mathematical Programming, vol. 76, pp. 533-562, 1997.
M.C. Ferris and J.-S. Pang (Eds.), Complementarity and Variational Problems: State of the Art, SIAM: Philadelphia, 1997.
M. Fukushima, “Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems,” Mathematical Programming, vol. 53, pp. 99-110, 1992.
M. Fukushima, “Merit functions for variational inequality and complementarity problems,” in Nonlinear Optimization and Applications, G. Di Pillo and F. Giannessi (Eds.), Plenum Press: New York, 1996, pp. 155-170.
H. Jiang, “Unconstrained minimization approaches to nonlinear complementarity problems,” Journal of Global Optimization, vol. 9, pp. 169-181, 1996.
C. Kanzow and M. Fukushima, “Theoretical and numerical investigation of the D-gap function for box constrained variational inequalities,” Mathematical Programming, vol. 83, pp. 55-87, 1998.
C. Kanzow and M. Fukushima, “Solving box constrained variational inequalities by using the natural residual with D-gap function globalization,” Operations Research Letters, vol. 23, pp. 45-51, 1998.
C. Kanzow, N. Yamashita, and M. Fukushima, “New NCP-functions and their properties,” Journal of Optimization Theory and Applications, vol. 94, pp. 115-135, 1997.
T. Larsson and M. Patriksson, “A class of gap functions for variational inequalities,” Mathematical Programming, vol. 64, pp. 53-79, 1994.
Z.-Q. Luo and P. Tseng, “A new class of merit functions for the nonlinear complementarity problem,” in Complementarity and Variational Problems: State of the Art, M.C. Ferris and J.-S. Pang (Eds.), SIAM: Philadelphia, 1997.
O.L. Mangasarian and M.V. Solodov, “Nonlinear complementarity as unconstrained and constrained minimization,” Mathematical Programming, vol. 62, pp. 277-297, 1993.
O.L. Mangasarian and M.V. Solodov, “A linearly convergent derivative-free descent method for strongly monotone complementarity problems,” Computational Optimization and Applications, vol. 14, pp. 5-16, 1999.
P. Marcotte and D.L. Zhu, “Weak sharp solutions of variational inequalities,” SIAM Journal on Optimization, vol. 9, pp. 179-189, 1999.
J.-S. Pang, “Error bounds in mathematical programming,” Mathematical Programming, vol. 79, pp. 299-332, 1997.
J.-M. Peng, “Equivalence of variational inequality problems to unconstrained minimization,” Mathematical Programming, vol. 78, pp. 347-355, 1997.
J.-M. Peng and M. Fukushima, “A hybrid Newton method for solving the variational inequality problem via the D-gap function,” Mathematical Programming, vol. 86, pp. 367-386, 1999.
J.-M. Peng, M. Fukushima, and C. Kanzow, “A hybrid Josephy-Newton method for solving box constrained variational inequality problems via the D-gap function,” Optimization Methods and Software, vol. 10, pp. 687-710, 1999.
B.T. Polyak, Introduction to Optimization, Optimization Software, Inc., Publications Division: New York, 1987.
M.V. Solodov, “Implicit Lagrangian,” in Encyclopedia of Optimization, C. Floudas and P. Pardalos (Eds.), Kluwer Academic Publishers, 2000.
M.V. Solodov and B.F. Svaiter, “A hybrid projection-proximal point algorithm,” Journal of Convex Analysis, vol. 6, pp. 59-70, 1999.
K. Taji, M. Fukushima, and T. Ibaraki, “A globally convergent Newton method for solving strongly monotone variational inequalities,” Mathematical Programming, vol. 58, pp. 369-383, 1993.
D. Sun, M. Fukushima, and L. Qi, “A computable generalized Hessian of the D-gap function and Newton-type methods for variational inequality problems,” in Complementarity and Variational Problems: State of the Art, M.C. Ferris and J.-S. Pang (Eds.), SIAM: Philadelphia, 1997, pp. 452-473.
J.H. Wu, M. Florian, and P. Marcotte, “A general descent framework for the monotone variational inequality problem,” Mathematical Programming, vol. 61, pp. 281-300, 1993.
K. Yamada, N. Yamashita, and M. Fukushima, “A new derivative-free descent method for the nonlinear complementarity problem,” in Nonlinear Optimization and Applications 2, G. Di Pillo and F. Giannessi (Eds.), Kluwer Academic Publishers, pp. 463-487, 2000.
N. Yamashita and M. Fukushima, “On stationary points of the implicit Lagrangian for nonlinear complementarity problems,” Journal of Optimization Theory and Applications, vol. 19, pp. 653-663, 1995.
N. Yamashita, K. Taji, and M. Fukushima, “Unconstrained optimization reformulations of variational inequality problems,” Journal of Optimization Theory and Applications, vol. 92, pp. 439-456, 1997.
H. Xu, “Fukushima's regularized gap function and Peng's D-gap function for nonsmooth variational inequalities,” Research Report, School of Information Technology and Mathematical Sciences, University of Ballarat, Ballarat, Australia, 1998.
D.L. Zhu and P. Marcotte, “Modified descent methods for solving the monotone variational inequality problem,” Operations Research Letters, vol. 14, pp. 111-120, 1993.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Solodov, M.V., Tseng, P. Some Methods Based on the D-Gap Function for Solving Monotone Variational Inequalities. Computational Optimization and Applications 17, 255–277 (2000). https://doi.org/10.1023/A:1026506516738
Issue Date:
DOI: https://doi.org/10.1023/A:1026506516738