Skip to main content
Log in

Stationary Points of Bound Constrained Minimization Reformulations of Complementarity Problems

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

Abstract

We consider two merit functions which can be used for solving the nonlinear complementarity problem via nonnegatively constrained minimization. One of the functions is the restricted implicit Lagrangian (Refs. 1–3), and the other appears to be new. We study the conditions under which a stationary point of the minimization problem is guaranteed to be a solution of the underlying complementarity problem. It appears that, for both formulations, the same regularity condition is needed. This condition is closely related to the one used in Ref. 4 for unrestricted implicit Lagrangian. Some new sufficient conditions are also given.

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.

Institutional subscriptions

Similar content being viewed by others

References

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

    Google Scholar 

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

    Google Scholar 

  3. TAJI, K., and FUKUSHIMA, M., Optimization Based Globally Convergent Methods for the Nonlinear Complementarity Problem, Journal of the Operations Research Society of Japan, Vol. 37, pp. 310–331, 1994.

    Google Scholar 

  4. FACCHINEI, F., and KANZOW, C., On Unconstrained and Constrained Stationary Points of the Implicit Lagrangian, Technical Report A-97, Institute of Applied Mathematics, University of Hamburg, Hamburg, Germany, 1995.

    Google Scholar 

  5. COTTLE, R., GIANNESSI, F., and LIONS, J. L., Variational Inequalities and Complementarity Problems: Theory and Applications, Wiley, New York, New York, 1980.

    Google Scholar 

  6. PANG, J. S., Complementarity Problems, Handbook of Global Optimization, Edited by R. Horst and P. Pardalos, Kluwer Academic Publishers, Boston, Massachusetts, pp. 271–338, 1995.

    Google Scholar 

  7. COTTLE, R., PANG, J. S., and STONE, R., The Linear Complementarity Problem, Academic Press, New York, New York, 1992.

    Google Scholar 

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

    Google Scholar 

  9. GEIGER, C., and KANZOW, C., On the Resolution of Monotone Complementarity Problems, Computational Optimization and Applications, Vol. 5, pp. 155–173, 1996.

    Google Scholar 

  10. LUO, Z. Q., and TSENG, P., A New Class of Merit Functions for the Nonlinear Complementarity Problem, SIAM Journal on Optimization (to appear).

  11. LI, W., A Merit Function and a Newton-Type Method for Symmetric Linear Complementarity Problems, SIAM Journal on Optimization (to appear).

  12. MORÉ, J., Global Methods for Nonlinear Complementarity Problems, Technical Report MCS-P429–0494, Mathematics and Computer Sciences Division, Argonne National Laboratory, 1994.

  13. TSENG, P., YAMASHITA, N., and FUKUSHIMA, M., Equivalence of Complementarity Problems to Differentiable Minimization: A Unified Approach, SIAM Journal on Optimization, Vol. 6, pp. 446–460, 1996.

    Google Scholar 

  14. FERRIS, M., and RALPH, D., Projected Gradient Methods for Nonlinear Complementarity Problems via Normal Maps, Recent Advances in Nonsmooth Optimization, Edited by D. Z. Du, L. Qi, and R. Womersley, World Scientific Publishers, Singapore, pp. 1–29, 1994.

    Google Scholar 

  15. 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 Publishers, Singapore, pp. 88–105, 1995.

    Google Scholar 

  16. LUCA, T. D., FACCHINEI, F., and KANZOW, C., 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, 1995.

    Google Scholar 

  17. FACCHINEL, F., FISCHER, A., and KANZOW, C., Inexact Newton Methods for Semismooth Equations with Applications to Variational Inequality Problems, Technical Report, Institute of Numerical Mathematics, Dresden University of Technology, Dresden, Germany, 1995.

    Google Scholar 

  18. PANG, J. S., and GABRIEL, S., NE/SQP: A Robust Algorithm for the Nonlinear Complementarity Problem, Mathematical Programming, Vol. 60, pp. 295–337, 1993.

    Google Scholar 

  19. JIANG, H., and QI, L., A New Nonsmooth Equations Approach to Nonlinear Complementarities, Technical Report AMR94/31, School of Mathematics, University of New South Wales, Sydney, NSW, Australia, 1994.

    Google Scholar 

  20. FUKUSHIMA, M., Merit Functions for Variational Inequality and Complementarity Problems, Nonlinear Optimization and Applications, Edited by G. D. Pillo and F. Giannessi, Plenum Publishing Corporation, New York, New York, 1996.

    Google Scholar 

  21. MANGASARIAN, O. L., Nonlinear Programming, McGraw-Hill, New York, New York, 1969.

    Google Scholar 

  22. LUO, Z. Q., MANGASARIAN, O. L., REN, J., and SOLODOV, M. V., New Error Bounds for the Linear Complementarity Problem, Mathematics of Operations Research, Vol. 19, pp. 880–892, 1994.

    Google Scholar 

  23. YAMASHITA, N., and FUKUSHIMA, M., On Stationary Points of the Implicit Lagrangian for Nonlinear Complementarity Problems, Journal of Optimization Theory and Applications, Vol. 84, pp. 653–663, 1995.

    Google Scholar 

  24. JIANG, H., Unconstrained Minimization Approaches to Nonlinear Complementarities, Technical Report AMR94/33, School of Mathematics, University of New South Wales, Sydney, NSW, Australia, 1994.

    Google Scholar 

  25. PENG, J. M., The Convexity of the Implicit Lagrangian, Technical Report, State Key Laboratory of Scientific and Engineering Computing, Academia Sinica, Beijing, China, 1995.

    Google Scholar 

  26. YAMASHITA, N., TAJI, K., and FUKUSHIMA, M., Unconstrained Optimization Reformulations of Variational Inequality Problems, Technical Report, Graduate School of Information Science, Nara Institute of Science and Technology, Nara, Japan, 1995.

    Google Scholar 

  27. KANZOW, C., YAMASHITA, N., and FUKUSHIMA, M., New NCP Functions and Their Properties, Technical Report TR-IS-96010, Nara Institute of Science and Technology, Nara, Japan, 1996.

    Google Scholar 

  28. FISCHER, A., A New Constrained Optimization Reformulation for Complementarity Problems, Technical Report MATH-NM–10–1995, Institute for Numerical Mathematics, Technical University of Dresden, Dresden, Germany, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Solodov, M.V. Stationary Points of Bound Constrained Minimization Reformulations of Complementarity Problems. Journal of Optimization Theory and Applications 94, 449–467 (1997). https://doi.org/10.1023/A:1022695931376

Download citation

  • Issue Date:

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

Navigation