IDEAS home Printed from https://ideas.repec.org/a/spr/coopap/v55y2013i3p703-731.html
   My bibliography  Save this article

A new method for solving Pareto eigenvalue complementarity problems

Author

Listed:
  • Samir Adly
  • Hadia Rammal

Abstract

In this paper, we introduce a new method, called the Lattice Projection Method (LPM), for solving eigenvalue complementarity problems. The original problem is reformulated to find the roots of a nonsmooth function. A semismooth Newton type method is then applied to approximate the eigenvalues and eigenvectors of the complementarity problems. The LPM is compared to SNM min and SNM FB , two methods widely discussed in the literature for solving nonlinear complementarity problems, by using the performance profiles as a comparing tool (Dolan, Moré in Math. Program. 91:201–213, 2002 ). The performance measures, used to analyze the three solvers on a set of matrices mostly taken from the Matrix Market (Boisvert et al. in The quality of numerical software: assessment and enhancement, pp. 125–137, 1997 ), are computing time, number of iterations, number of failures and maximum number of solutions found by each solver. The numerical experiments highlight the efficiency of the LPM and show that it is a promising method for solving eigenvalue complementarity problems. Finally, Pareto bi-eigenvalue complementarity problems were solved numerically as an application to confirm the efficiency of our method. Copyright Springer Science+Business Media New York 2013

Suggested Citation

  • Samir Adly & Hadia Rammal, 2013. "A new method for solving Pareto eigenvalue complementarity problems," Computational Optimization and Applications, Springer, vol. 55(3), pages 703-731, July.
    • Handle: RePEc:spr:coopap:v:55:y:2013:i:3:p:703-731
    DOI: 10.1007/s10589-013-9534-y
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1007/s10589-013-9534-y
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1007/s10589-013-9534-y?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. C. Kanzow & N. Yamashita & M. Fukushima, 1997. "New NCP-Functions and Their Properties," Journal of Optimization Theory and Applications, Springer, vol. 94(1), pages 115-135, July.
    2. Mohamed Hanafi & Jos Berge, 2003. "Global optimality of the successive Maxbet algorithm," Psychometrika, Springer;The Psychometric Society, vol. 68(1), pages 97-103, March.
    3. Liqun Qi, 1993. "Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations," Mathematics of Operations Research, INFORMS, vol. 18(1), pages 227-244, February.
    4. Paul Horst, 1961. "Relations amongm sets of measures," Psychometrika, Springer;The Psychometric Society, vol. 26(2), pages 129-149, June.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Pinto da Costa, A. & Seeger, A. & Simões, F.M.F., 2017. "Complementarity eigenvalue problems for nonlinear matrix pencils," Applied Mathematics and Computation, Elsevier, vol. 312(C), pages 134-148.
    2. Samir Adly & Hadia Rammal, 2015. "A New Method for Solving Second-Order Cone Eigenvalue Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 165(2), pages 563-585, May.
    3. Fatemeh Abdi & Fatemeh Shakeri, 2017. "A New Descent Method for Symmetric Non-monotone Variational Inequalities with Application to Eigenvalue Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 173(3), pages 923-940, June.
    4. Chen Ling & Hongjin He & Liqun Qi, 2016. "Higher-degree eigenvalue complementarity problems for tensors," Computational Optimization and Applications, Springer, vol. 64(1), pages 149-176, May.
    5. Chen Ling & Hongjin He & Liqun Qi, 2016. "On the cone eigenvalue complementarity problem for higher-order tensors," Computational Optimization and Applications, Springer, vol. 63(1), pages 143-168, January.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Lei-Hong Zhang & Li-Zhi Liao & Li-Ming Sun, 2011. "Towards the global solution of the maximal correlation problem," Journal of Global Optimization, Springer, vol. 49(1), pages 91-107, January.
    2. Lei-Hong Zhang & Li-Zhi Liao, 2012. "An alternating variable method for the maximal correlation problem," Journal of Global Optimization, Springer, vol. 54(1), pages 199-218, September.
    3. Vartan Choulakian, 2011. "Picture of all Solutions of Successive 2-Block Maxbet Problems," Psychometrika, Springer;The Psychometric Society, vol. 76(4), pages 550-563, October.
    4. Anwa Zhou & Xin Zhao & Jinyan Fan & Yanqin Bai, 2018. "Tensor maximal correlation problems," Journal of Global Optimization, Springer, vol. 70(4), pages 843-858, April.
    5. Dong-Hui Li & Liqun Qi & Judy Tam & Soon-Yi Wu, 2004. "A Smoothing Newton Method for Semi-Infinite Programming," Journal of Global Optimization, Springer, vol. 30(2), pages 169-194, November.
    6. Hanafi, Mohamed & Kiers, Henk A.L., 2006. "Analysis of K sets of data, with differential emphasis on agreement between and within sets," Computational Statistics & Data Analysis, Elsevier, vol. 51(3), pages 1491-1508, December.
    7. John Duggan & Tasos Kalandrakis, 2011. "A Newton collocation method for solving dynamic bargaining games," Social Choice and Welfare, Springer;The Society for Social Choice and Welfare, vol. 36(3), pages 611-650, April.
    8. Pietro Amenta & Antonio Lucadamo & Antonello D’Ambra, 2021. "Restricted Common Component and Specific Weight Analysis: A Constrained Explorative Approach for the Customer Satisfaction Evaluation," Social Indicators Research: An International and Interdisciplinary Journal for Quality-of-Life Measurement, Springer, vol. 156(2), pages 409-427, August.
    9. Liang Chen & Anping Liao, 2020. "On the Convergence Properties of a Second-Order Augmented Lagrangian Method for Nonlinear Programming Problems with Inequality Constraints," Journal of Optimization Theory and Applications, Springer, vol. 187(1), pages 248-265, October.
    10. H. Xu & B. M. Glover, 1997. "New Version of the Newton Method for Nonsmooth Equations," Journal of Optimization Theory and Applications, Springer, vol. 93(2), pages 395-415, May.
    11. Ralf Münnich & Ekkehard Sachs & Matthias Wagner, 2012. "Calibration of estimator-weights via semismooth Newton method," Journal of Global Optimization, Springer, vol. 52(3), pages 471-485, March.
    12. Y. Gao, 2006. "Newton Methods for Quasidifferentiable Equations and Their Convergence," Journal of Optimization Theory and Applications, Springer, vol. 131(3), pages 417-428, December.
    13. Stan Lipovetsky, 2022. "Canonical Concordance Correlation Analysis," Mathematics, MDPI, vol. 11(1), pages 1-12, December.
    14. Sanja Rapajić & Zoltan Papp, 2017. "A nonmonotone Jacobian smoothing inexact Newton method for NCP," Computational Optimization and Applications, Springer, vol. 66(3), pages 507-532, April.
    15. Walter Kristof, 1967. "Orthogonal inter-battery factor analysis," Psychometrika, Springer;The Psychometric Society, vol. 32(2), pages 199-227, June.
    16. J. Han & D. Sun, 1997. "Newton and Quasi-Newton Methods for Normal Maps with Polyhedral Sets," Journal of Optimization Theory and Applications, Springer, vol. 94(3), pages 659-676, September.
    17. G. L. Zhou & L. Caccetta, 2008. "Feasible Semismooth Newton Method for a Class of Stochastic Linear Complementarity Problems," Journal of Optimization Theory and Applications, Springer, vol. 139(2), pages 379-392, November.
    18. M. A. Tawhid & J. L. Goffin, 2008. "On Minimizing Some Merit Functions for Nonlinear Complementarity Problems under H-Differentiability," Journal of Optimization Theory and Applications, Springer, vol. 139(1), pages 127-140, October.
    19. C. Kanzow & H. Qi & L. Qi, 2003. "On the Minimum Norm Solution of Linear Programs," Journal of Optimization Theory and Applications, Springer, vol. 116(2), pages 333-345, February.
    20. D. H. Li & N. Yamashita & M. Fukushima, 2001. "Nonsmooth Equation Based BFGS Method for Solving KKT Systems in Mathematical Programming," Journal of Optimization Theory and Applications, Springer, vol. 109(1), pages 123-167, April.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:coopap:v:55:y:2013:i:3:p:703-731. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.