Computational Optimization and Applications

, Volume 37, Issue 2, pp 139–156

The eigenvalue complementarity problem

Authors

    • Departamento de Matemática da Universidade de Coimbra and Instituto de Telecomunicações
  • Hanif D. Sherali
    • Grado Department of Industrial & Systems EngineeringVirginia Polytechnic Institute and State University
  • Isabel M. Ribeiro
    • Secção de Matemática do Departamento de Engenharia Civil, Faculdade de EngenhariaUniversidade do Porto
Article

DOI: 10.1007/s10589-007-9017-0

Cite this article as:
Júdice, J.J., Sherali, H.D. & Ribeiro, I. Comput Optim Appl (2007) 37: 139. doi:10.1007/s10589-007-9017-0

Abstract

In this paper an eigenvalue complementarity problem (EiCP) is studied, which finds its origins in the solution of a contact problem in mechanics. The EiCP is shown to be equivalent to a Nonlinear Complementarity Problem, a Mathematical Programming Problem with Complementarity Constraints and a Global Optimization Problem. A finite Reformulation–Linearization Technique (Rlt)-based tree search algorithm is introduced for processing the EiCP via the lattermost of these formulations. Computational experience is included to highlight the efficacy of the above formulations and corresponding techniques for the solution of the EiCP.

Keywords

Global optimizationComplementarityEigenvalue problems

Copyright information

© Springer Science+Business Media, LLC 2007