Skip to main content
Log in

Solution of Finite-Dimensional Variational Inequalities Using Smooth Optimization with Simple Bounds

  • Published:
Journal of Optimization Theory and Applications Aims and scope Submit manuscript

Abstract

The variational inequality problem is reduced to an optimization problem with a differentiable objective function and simple bounds. Theoretical results are proved, relating stationary points of the minimization problem to solutions of the variational inequality problem. Perturbations of the original problem are studied and an algorithm that uses the smooth minimization approach for solving monotone problems is defined.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. HARKER, P. T., and PANG, J. S., Finite-Dimensional Variational Inequality and Nonlinear Complementarity Problems: A Survey of Theory, Algorithms, and Applications, Mathematical Programming, Vol. 48B, pp. 161–220, 1990.

    Google Scholar 

  2. MURTY, K. G., Linear Complementarity, Linear and Nonlinear Programming, Sigma Series in Applied Mathematics 3, Heldermann Verlag, Berlin, Germany, 1988.

    Google Scholar 

  3. COTTLE, R. W., PANG, J. S., and STONE, R. E., The Linear Complementarity Problem, Academic Press, Boston, Massachusetts, 1992.

    Google Scholar 

  4. JUDICE, J. J., Algorithms for Linear Complementarity Problems, Algorithms for Continuous Optimization, Edited by E. Spedicato, Kluwer Academic Publishers, Dordrecht, Netherlands, pp. 435–474, 1994.

    Google Scholar 

  5. BONNANS, J. F., and GONZAGA, C. C., Convergence of Interior-Point Algorithms for the Monotone Linear Complementarity Problem, Mathematics of Operations Research, Vol. 21, pp. 1–25, 1996.

    Google Scholar 

  6. ZHANG, Y., TAPIA, R. A., and POTRA, F., On the Superlinear Convergence of Interior-Point Algorithms for a General Class of Problems, SIAM Journal on Optimization, Vol. 3, pp. 413–422, 1993.

    Google Scholar 

  7. YE, Y., and PARDALOS, P., A Class of Linear Complementarity Problems Solvable in Polynomial Time, Linear Algebra and Its Applications, Vol. 152, pp. 3–19, 1991.

    Google Scholar 

  8. FISCHER, A., An NCP-Function and Its Use for the Solution of Complementarity Problems, Recent Advances in Nonsmooth Optimization, Edited by D. Z. Du, L. Qi, and R. Womersley, World Scientific, River Edge, New Jersey, pp. 88–105, 1995.

    Google Scholar 

  9. FRIEDLANDER, A., MARTÍNEZ, J. M., and SANTOS, S. A., Solution of Linear Complementarity Problems Using Minimization with Simple Bounds, Journal of Global Optimization, Vol. 6, pp. 1–15, 1995.

    Google Scholar 

  10. FRIEDLANDER, A., MARTÍNEZ, J. M., and SANTOS, S. A., A New Strategy for Solving Variational Inequalities on Bounded Polytopes, Numerical Functional Analysis and Optimization, Vol. 16, pp. 653–668, 1995.

    Google Scholar 

  11. KANZOW, C., Nonlinear Complementarity as Unconstrained Optimization, Journal of Optimization Theory and Applications, Vol. 88, pp. 139–156, 1996.

    Google Scholar 

  12. MANGASARIAN, O. L., and SOLODOV, M. V., Nonlinear Complementarity as Unconstrained and Constrained Minimization, Mathematical Programming, Vol. 62, pp. 277–297, 1993.

    Google Scholar 

  13. MORÉ, J., Global Methods for Nonlinear Complementarity Problems, Preprint MCS-P429–0494, Mathematics and Computer Science Division, Argonne National Laboratory, 1994.

  14. FUKUSHIMA, M., Equivalent Differentiable Optimization Problems and Descent Methods for Asymmetric Variational Inequality Problems, Mathematical Programming, Vol. 53, pp. 99–110, 1992.

    Google Scholar 

  15. CONN, A. R., GOULD, N. I. M., and TOINT, P. L., Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds, SIAM Journal on Numerical Analysis, Vol. 25, pp. 433–460, 1988.

    Google Scholar 

  16. FRIEDLANDER, A., MARTÍNEZ, J. M., and SANTOS, S. A., A New Algorithm for Bound-Constrained Minimization, Journal of Applied Mathematics and Optimization, Vol. 30, pp. 235–255, 1994.

    Google Scholar 

  17. AUSLENDER, A., Optimisation: Méthodes Numériques, Masson, Paris, France, 1976.

    Google Scholar 

  18. HEARN, D. W., The Gap Function of a Convex Program, Operations Research Letters, Vol. 1, pp. 67–71, 1982.

    Google Scholar 

  19. TAJI, K., and FUKUSHIMA, M., A New Merit Function and A Successive Quadratic Programming Algorithm for Variational Inequality Problems, SIAM Journal on Optimization, Vol. 6, pp. 704–713, 1996.

    Google Scholar 

  20. TAJI, K., and FUKUSHIMA, M., A Globally Convergent Newton Method for Solving Variational Inequality Problems with Inequality Constraints, Recent Advances in Nonsmooth Optimization, Edited by D. Z. Du, L. Qi, and R. Womersley, World Scientific, Rive Edge, New Jersey, pp. 405–417, 1995.

    Google Scholar 

  21. YAMASHITA, N., TAJI, K., and FUKUSHIMA, M., Unconstrained Optimization Reformulations of Variational Inequality Problems, Report 95–24, Graduate School of Information Science, Nara Institute of Science and Technology, 1995.

  22. PENG, J. M., Equivalence of Variational Inequality Problems to Unconstrained Optimization, ICM–95–14, State Key Laboratory of Scientific and Engineering Computing, Academia Sinica, 1995.

  23. FRIEDLANDER, A., MARTÍNEZ, J. M., and SANTOS, S. A., On the Resolution of Large-Scale Linearly Constrained Convex Minimization Problems, SIAM Journal on Optimization, Vol. 4, pp. 331–339, 1994.

    Google Scholar 

  24. SCHNABEL, R. B., and CHOW, T., Tensor Methods for Unconstrained Optimization Using Second Derivatives, SIAM Journal on Optimization, Vol. 1, pp. 293–315, 1991.

    Google Scholar 

  25. AVRIEL, M., Nonlinear Programming: Analysis and Methods, Prentice Hall, Englewood Cliffs, New Jersey, 1976.

    Google Scholar 

  26. WATSON, L. T., BILLUPS, S. C., and MORGAN, A. P., Algorithm 652, HOMPACK: A Suite of Codes for Globally Convergent Homotopy Algorithms, ACM Transactions on Mathematical Software, Vol. 13, pp. 281–310, 1987.

    Google Scholar 

  27. GOMES-RUGGIERO, M. A., MARTÍNEZ, J. M., and MORETTI, A. C., Comparing Alogrithms for Solving Sparse Nonlinear Systems of Equations, SIAM Journal on Scientific and Statistical Computing, Vol. 13, pp. 459–483, 1992.

    Google Scholar 

  28. GOMES-RUGGIERO, M. A., MARTÍNEZ, J. M., and SANTOS, S. A., Solving Nonsmooth Equations by Means of Quasi-Newton Methods with Globalization, Recent Advances in Nonsmooth Optimization, Edited by D. Z. Du, L. Qi, and R. Womersley, World Scientific, River Edge, New Jersey, pp. 121–140, 1995.

    Google Scholar 

  29. FACCHINEI, F., and KANZOW, C., A Nonsmooth Inexact Newton Method for the Solution of Large-Scale Nonlinear Complementarity Problems, Report 95, Institute of Applied Mathematics, University of Hamburg, 1995.

  30. ANDREANI, R., FRIEDLANDER, A., and MARTÍNEZ, J. M., On the Solution of Finite-Dimensional Variational Inequalities Using Smooth Optimization with Simple Bounds, Report 96–32, Institute of Mathematics, University of Campinas, 1996.

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Andreani, R., Friedlander, A. & Martínez, J.M. Solution of Finite-Dimensional Variational Inequalities Using Smooth Optimization with Simple Bounds. Journal of Optimization Theory and Applications 94, 635–657 (1997). https://doi.org/10.1023/A:1022601017090

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1022601017090

Navigation