Skip to main content
SpringerLink
Log in

Merit Functions for Variational Inequality and Complementarity Problems

  • Chapter
Nonlinear Optimization and Applications

Abstract

This paper presents an overview of the recent effort in reformulating the variational inequality problem and the complementarity problem as an equivalent optimization problem with certain desirable properties. Merit functions used to formulate such equivalent optimization problems turn out to be useful in designing a globally convergent algorithm and provide error bounds for those problems under appropriate conditions.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. Auchmuty, “Variational principles for variational inequalities”. Numerical Functional Analysis and Optimization, 10, pp. 863–874, 1989.

    Article  MathSciNet  MATH  Google Scholar 

  2. A. Auslender, “Optimisation: Méthodes Numériques”. Masson, Paris, 1976.

    MATH  Google Scholar 

  3. R.W. Cottle, J.-S. Pang and R.E. Stone, “The Linear Complementarity Problem”. Academic Press, San Diego, 1992.

    MATH  Google Scholar 

  4. T. De Luca, F. Facchinei and C. Kanzow, “A semismooth equation approach to the solution of nonlinear complementarity problems”. Technical Report, Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”, Rome, Italy, January 1995.

    Google Scholar 

  5. F. Facchinei and J. Soares, “A new merit function for nonlinear complementarity problems and a related algorithm”, Technical Report, Dipartimento di Informatica e Sistemistica, Università di Roma “La Sapienza”, Rome, Italy, December 1994.

    Google Scholar 

  6. F. Facchinei and J. Soares, “Testing a new class of algorithms for nonlinear complementarity problems”. In “Variational Inequality and Network Equilibrium Problems”, F. Giannessi and A. Maugeri (eds.), Plenum Press, New York, pp. 69–83, 1995.

    Google Scholar 

  7. A. Fischer, “A special Newton-type optimization method”. Optimization, 24, pp. 269–284, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  8. A. Fischer, “On the local superlinear convergence of a Newton-type method for LCP under weak conditions”. Technical Report, Institute of Numerical Mathematics, Technical University of Dresden, Dresden, Germany, March 1994.

    Google Scholar 

  9. A. Fischer, “A Newton-type method for linear complementarity problems”. To appear in Journal of Optimization Theory and Applications.

    Google Scholar 

  10. A. Fischer, “An NCP-function and its use for the solution of complementarity problems.” In “Recent Advances in Nonsmooth Optimization”, D.-Z. Du, L. Qi and R.S. Womersley (eds.), World Scientific Publishers, Singapore, pp. 88–105, 1995.

    Chapter  Google Scholar 

  11. A. Friedlander, J.M. Martínez and S.A. Santos, “Resolution of linear complementarity problems using minimization with simple bounds”. Technical Report 66/93, Department of Applied Mathematics, State University of Campinas, Campinas SP, Brazil, November 1993.

    Google Scholar 

  12. A. Friedlander, J.M. Martínez and S.A. Santos, “A new strategy for solving variational inequalities in bounded polytopes”. Technical Report 02/94, Department of Applied Mathematics, State University of Campinas, Campinas SP, Brazil, January 1994.

    Google Scholar 

  13. M. Fukushima, “Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems”. “Mathematical Programming”, 53, pp. 99–110, 1992.

    Article  MathSciNet  MATH  Google Scholar 

  14. S.A. Gabriel and J.-S. Pang, “An inexact NE/SQP method for solving the nonlinear complementarity problem”. Computational Optimization and Applications, 1, 1992, pp. 67–91.

    Article  MathSciNet  MATH  Google Scholar 

  15. C. Geiger and C. Kanzow, “On the resolution of monotone complementarity problems”. To appear in Computational Optimization and Applications.

    Google Scholar 

  16. F. Giannessi, “Separation of sets and gap functions for quasi-variational inequalities”. In “Variational Inequalities and Network Equilibrium Problems”, F. Giannessi and A. Maugeri (eds.), Plenum Press, New York, pp. 101–121, 1995.

    Chapter  Google Scholar 

  17. P.T. Harker and J.-S. Pang, “Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications”. Mathematical Programming, 48, 1990, pp. 161–220.

    Article  MathSciNet  MATH  Google Scholar 

  18. D.W. Hearn, “The gap function of a convex program”. Operations Research Letters, 1, pp. 67–71, 1982.

    Article  MathSciNet  MATH  Google Scholar 

  19. H. Jiang, “Unconstrained minimization approaches to nonlinear complementarities”. AMR 94/33, School of Mathematics, The University of New South Wales, Sydney, Australia, October 1994.

    Google Scholar 

  20. H. Jiang and L. Qi, “A new nonsmooth equations approach to nonlinear complementarities”. AMR94/31, School of Mathematics, The University of New South Wales, Sydney, Australia, October 1994.

    Google Scholar 

  21. C. Kanzow, “Nonlinear complementarity as unconstrained optimization”. To appear in Journal of Optimization Theory and Applications.

    Google Scholar 

  22. C. Kanzow, “Some equation-based methods for the nonlinear complementarity problem”. Optimization Methods and Software, 3, pp. 327–340, 1994.

    Article  Google Scholar 

  23. C. Kanzow and M. Fukushima, “Equivalence of the generalized complementarity problem to differentiable unconstrained minimization”. TR-IS-95001, Nara Institute of Science and Technology, Nara, Japan, January 1995.

    Google Scholar 

  24. C. Kanzow and H. Kleinmichel, “A class of Newton-type methods for equality and inequality constrained optimization”. Optimization Methods and Software, 5, 1995, pp. 173–198.

    Article  Google Scholar 

  25. T. Larsson and M. Patriksson, “A class of gap functions for variational inequalities”. Mathematical Programming, 64, pp. 53–79, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  26. Z.-Q. Luo, O.L. Mangasarian, J. Ren and M. V. Solodov, “New error bounds for the linear complementarity problem”. To appear in Mathematics of Operations Research.

    Google Scholar 

  27. O.L. Mangasarian and M.V. Solodov, “Nonlinear complementarity as unconstrained and constrained minimization”. Mathematical Programming, 62, pp. 277–297, 1993.

    Article  MathSciNet  MATH  Google Scholar 

  28. P. Marcotte, “A new algorithm for solving variational inequalities with application to the traffic assignment problem”. Mathematical Programming, 33, pp. 339–351, 1985.

    Article  MathSciNet  Google Scholar 

  29. P. Marcotte and J.P. Dussault, “A note on a globally convergent Newton method for solving monotone variational inequalities”. Operations Research Letters, 6, pp. 35–42, 1987.

    Article  MathSciNet  MATH  Google Scholar 

  30. P. Marcotte and J.P. Dussault, “A sequential linear programming algorithm for solving monotone variational inequalities.” SIAM Journal on Control and Optimization, 27, pp. 1260–1278, 1989.

    Article  MathSciNet  MATH  Google Scholar 

  31. J.J. More, “Global methods for nonlinear complementarity problems”. Preprint MCS-P429-0494, Argonne National Laboratory, Argonne, Illinois, April 1994.

    Google Scholar 

  32. A. Nagurney, “Network Economics: A Variational Inequality Approach”, Kluwer Academic Publishers, Boston, 1993.

    Book  MATH  Google Scholar 

  33. S. Nguyen and C. Dupuis, “An efficient method for computing traffic equilibria in networks with asymmetric transportation costs”. Transportation Science, 18, pp. 185–202, 1984.

    Article  Google Scholar 

  34. J.M. Ortega and W.C. Rheinboldt, “Iterative Solution of Nonlinear Equations in Several Variables”, Academic Press, New York, 1970.

    MATH  Google Scholar 

  35. J.-S. Pang, “A posteriori error bounds for the linearly-constrained variational inequality problem”. Mathematics of Operations Research, 12, pp. 474–484, 1987.

    Article  MathSciNet  Google Scholar 

  36. J.-S. Pang and S.A. Gabriel, “NE/SQP: A robust algorithm for the nonlinear complementarity problem”. Mathematical Programming, 60, pp. 295–337, 1993.

    Article  MathSciNet  MATH  Google Scholar 

  37. J.-S. Pang, “Complementarity problems”. In “Handbook of Global Optimization”, R. Horst and P. Pardalos (eds.), Kluwer Academic Publishers, Boston, pp. 271–338, 1995.

    Google Scholar 

  38. M. Patriksson, “On the convergence of descent methods for monotone variational inequalities”. Operations Research Letters, 16, pp. 265–269, 1994.

    Article  MathSciNet  MATH  Google Scholar 

  39. J.M. Peng, “Equivalence of variational inequality problems to unconstrained optimization”. Technical Report, State Key Laboratory of Scientific and Engineering Computing, Academia Sinica, Beijing, China, April 1995.

    Google Scholar 

  40. J.M. Peng and Y.X. Yuan, “Unconstrained methods for generalized complementarity problems”. Technical Report, State Key Laboratory of Scientific and Engineering Computing, Academia Sinica, Beijing, China, December 1994.

    Google Scholar 

  41. L. Qi and J. Sun, “A nonsmooth version of Newton’s method”. Mathematical Programming, 58, pp. 353–368, 1993.

    Article  MathSciNet  MATH  Google Scholar 

  42. L. Qi, “Convergence analysis of some algorithms for solving nonsmooth equations”. Mathematics of Operations Research, 18, 1993, pp. 227–244.

    Article  MathSciNet  MATH  Google Scholar 

  43. K. Taji and M. Fukushima, “Optimization based globally convergent methods for the nonlinear complementarity problem”. Journal of the Operations Research Society of Japan, 37, pp. 310–331, 1994.

    MathSciNet  MATH  Google Scholar 

  44. K. Taji and M. Fukushima, “A new merit function and a successive quadratic programming algorithm for variational inequality problems”. To appear in SIAM Journal on Optimization.

    Google Scholar 

  45. K. Taji and M. Fukushima, “A globally convergent Newton method for solving variational inequality problems with inequality constraints”. In Recent Advances in Nonsmooth Optimization, D.-Z. Du, L. Qi and R.S. Womersley (eds.), World Scientific Publishers, Singapore, pp. 405–417, 1995.

    Chapter  Google Scholar 

  46. K. Taji, M. Fukushima and T. Ibaraki, “A globally convergent Newton method for solving strongly monotone variational inequalities”. Mathematical Programming, 58, pp. 369–383, 1993.

    Article  MathSciNet  MATH  Google Scholar 

  47. P. Tseng, “Growth behaviour of a class of merit functions for the nonlinear complementarity problem”. Technical Report, Department of Mathematics, University of Washington, Seattle, May 1994.

    Google Scholar 

  48. P. Tseng, N. Yamashita and M. Fukushima, “Equivalence of complementarity problems to differentiable minimization: A unified approach”. To appear in SIAM Journal on Optimization.

    Google Scholar 

  49. J.H. Wu, M. Florian and P. Marcotte, “A general descent framework for the monotone variational inequality problem”. Mathematical Programming, 61, pp. 281–300, 1993.

    Article  MathSciNet  MATH  Google Scholar 

  50. N. Yamashita and M. Fukushima, “On stationary points of the implicit Lagrangian for nonlinear complementarity problems”. Journal of Optimization Theory and Applications, 84, pp. 653–663, 1995.

    Article  MathSciNet  MATH  Google Scholar 

  51. N. Yamashita and M. Fukushima, “Equivalent unconstrained minimization and global error bounds for variational inequality problems”. TR-IS-94034, Nara Institute of Science and Technology, Nara, Japan, November 1994.

    Google Scholar 

  52. N. Yamashita and M. Fukushima, “Modified Newton methods for solving semismooth reformulations of monotone complementarity problems”. TR-IS-95021, Nara Institute of Science and Technology, Nara, Japan, May 1995.

    Google Scholar 

  53. N. Yamashita, K. Taji and M. Fukushima, “Unconstrained optimization reformulations of variational inequality problems”. TR-IS-95024, Nara Institute of Science and Technology, Nara, Japan, August 1995.

    Google Scholar 

  54. D.L. Zhu and P. Marcotte, “Modified descent methods for solving the monotone variational inequality problem”. Operations Research Letters, 14, pp. 111–120, 1993.

    Article  MathSciNet  MATH  Google Scholar 

  55. D.L. Zhu and P. Marcotte, “An extended descent framework for variational inequalities”. Journal of Optimization Theory and Applications, 80, pp. 349–366, 1994.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Information Science, Nara Institute of Science and Technology, Ikoma, Nara, 630-01, Japan

    Masao Fukushima

Authors
  1. Masao Fukushima
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Rome “La Sapienza”, Rome, Italy

    G. Di Pillo

  2. University of Pisa, Pisa, Italy

    F. Giannessi

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer Science+Business Media New York

About this chapter

Cite this chapter

Fukushima, M. (1996). Merit Functions for Variational Inequality and Complementarity Problems. In: Di Pillo, G., Giannessi, F. (eds) Nonlinear Optimization and Applications. Springer, Boston, MA. https://doi.org/10.1007/978-1-4899-0289-4_11

Download citation

  • DOI: https://doi.org/10.1007/978-1-4899-0289-4_11

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4899-0291-7

  • Online ISBN: 978-1-4899-0289-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation