Skip to main content
Log in

On the connectedness of the solution set to linear complementarity systems

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

Abstract

This paper establishes sufficient conditions for the connectedness of nontrivial subsets of the solution set to linear complementarity systems with special structure. Connectedness may be important to investigate stability and sensitivity questions, parametric problems, and for extending a Lemke-type method to a new class of problems. Such a property may help in analyzing the structure of the feasible region by checking the explicitly given matrices of the resulting conditions. From the point of view of geometry, the question is how to analyze the combined geometrical object consisting of a Riemannian manifold, a pointed cone, and level sets determined by linear inequalities.

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. Karamardian, S.,The Complementarity Problem, Mathematical Programming, Vol. 2, pp. 107–129, 1972.

    Google Scholar 

  2. Cottle, R. W.,Complementarity and Variational Problems, Symposia Mathematica, Academic Press, New York, New York, Vol. 19, pp. 177–208, 1976.

    Google Scholar 

  3. Cottle, R. W., Giannessi, F., andLions, J. L., Editors,Variational Inequalities and Complementarity Problems, John Wiley and Sons, New York, New York, 1980.

    Google Scholar 

  4. Giannessi, F., andTomasin, E.,Nonconvex Quadratic Programming, Linear Complementarity Problems, and Integer Linear Programs, Mathematical Programming in Theory and Practice, Edited by P. L. Hammer and A. B. Zoutendijk, North-Holland, Amsterdam, Holland, pp. 161–199, 1974.

    Google Scholar 

  5. Cohn, M. Z., andMaier, G., Editors,Engineering Plasticity by Mathematical Programming, Pergamon Press, Oxford, England, 1979.

    Google Scholar 

  6. Luk, F. T., andPagano, M.,Quadratic Programming with M-Matrices, Linear Algebra and Its Applications, Vol. 33, pp. 15–40, 1980.

    Google Scholar 

  7. Judice, J. J., andMitra, G.,Reformulation of Mathematical Programming Problems as Linear Complementarity Problems and Investigation of Their Solution Methods, Journal of Optimization Theory and Applications, Vol. 57, pp. 123–149, 1988.

    Google Scholar 

  8. Rapcsák, T.,Geodesic Convexity in Nonlinear Optimization, Journal of Optimization Theory and Applications, Vol. 69, pp. 169–183, 1991.

    Google Scholar 

  9. Hicks, N. J.,Notes on Differential Geometry, Van Nostrand Publishing Company, Princeton, New Jersey, 1965.

    Google Scholar 

  10. Samelson, H., Thrall, R. M. andWesler, O.,A Partitioning Theorem for Euclidean n-Space, Proceedings of the American Mathematical Society, Vol. 9, pp. 805–807, 1958.

    Google Scholar 

  11. Avriel, M., Diewert, W. E., Schaible, S., andZang, I.,Generalized Concavity, Plenum Press, New York, New York, 1988.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by F. Giannessi

This paper has been mainly prepared while the author was visiting the Department of Mathematics at the University of Pisa. This research was partialy supported by the Hungarian National Research Foundation, Grant No. OTKA-2568.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Rapcsák, T. On the connectedness of the solution set to linear complementarity systems. J Optim Theory Appl 80, 501–512 (1994). https://doi.org/10.1007/BF02207777

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02207777

Key Words

Navigation