IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v294y2017icp36-48.html
   My bibliography  Save this article

A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem

Author

Listed:
  • Brás, Carmo P.
  • Fischer, Andreas
  • Júdice, Joaquim J.
  • Schönefeld, Klaus
  • Seifert, Sarah

Abstract

In this paper, we address the solution of the symmetric eigenvalue complementarity problem (EiCP) by treating an equivalent reformulation of finding a stationary point of a fractional quadratic program on the unit simplex. The spectral projected-gradient (SPG) method has been recommended to this optimization problem when the dimension of the symmetric EiCP is large and the accuracy of the solution is not a very important issue. We suggest a new algorithm which combines elements from the SPG method and the block active set method, where the latter was originally designed for box constrained quadratic programs. In the new algorithm the projection onto the unit simplex in the SPG method is replaced by the much cheaper projection onto a box. This can be of particular advantage for large and sparse symmetric EiCPs. Global convergence to a solution of the symmetric EiCP is established. Computational experience with medium and large symmetric EiCPs is reported to illustrate the efficacy and efficiency of the new algorithm.

Suggested Citation

  • Brás, Carmo P. & Fischer, Andreas & Júdice, Joaquim J. & Schönefeld, Klaus & Seifert, Sarah, 2017. "A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem," Applied Mathematics and Computation, Elsevier, vol. 294(C), pages 36-48.
    • Handle: RePEc:eee:apmaco:v:294:y:2017:i:c:p:36-48
    DOI: 10.1016/j.amc.2016.09.005
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300316305653
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2016.09.005?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. Andrei Patrascu & Ion Necoara, 2015. "Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization," Journal of Global Optimization, Springer, vol. 61(1), pages 19-46, January.
    2. Luís Fernandes & Joaquim Júdice & Hanif Sherali & Masao Fukushima, 2014. "On the computation of all eigenvalues for the eigenvalue complementarity problem," Journal of Global Optimization, Springer, vol. 59(2), pages 307-326, July.
    3. Julia Sponsel & Stefan Bundfuss & Mirjam Dür, 2012. "An improved algorithm to test copositivity," Journal of Global Optimization, Springer, vol. 52(3), pages 537-551, March.
    4. L. Fernandes & A. Fischer & J. Júdice & C. Requejo & J. Soares, 1998. "A block active set algorithm for large-scalequadratic programming with box constraints," Annals of Operations Research, Springer, vol. 81(0), pages 75-96, June.
    5. 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.
    6. A. Pinto da Costa & A. Seeger, 2010. "Cone-constrained eigenvalue problems: theory and algorithms," Computational Optimization and Applications, Springer, vol. 45(1), pages 25-57, January.
    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. Joaquim Júdice & Valentina Sessa & Masao Fukushima, 2022. "Solution of Fractional Quadratic Programs on the Simplex and Application to the Eigenvalue Complementarity Problem," Journal of Optimization Theory and Applications, Springer, vol. 193(1), pages 545-573, June.
    2. Andrea Cristofari & Marianna Santis & Stefano Lucidi & Francesco Rinaldi, 2022. "Minimization over the $$\ell _1$$ ℓ 1 -ball using an active-set non-monotone projected gradient," Computational Optimization and Applications, Springer, vol. 83(2), pages 693-721, November.
    3. Masao Fukushima & Joaquim Júdice & Welington Oliveira & Valentina Sessa, 2020. "A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem," Computational Optimization and Applications, Springer, vol. 77(3), pages 711-728, December.
    4. Niu, Yi-Shuai & Júdice, Joaquim & Le Thi, Hoai An & Pham, Dinh Tao, 2019. "Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem," Applied Mathematics and Computation, Elsevier, vol. 353(C), pages 95-113.
    5. Andrea Cristofari & Marianna Santis & Stefano Lucidi & Francesco Rinaldi, 2020. "An active-set algorithmic framework for non-convex optimization problems over the simplex," Computational Optimization and Applications, Springer, vol. 77(1), pages 57-89, September.

    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. Niu, Yi-Shuai & Júdice, Joaquim & Le Thi, Hoai An & Pham, Dinh Tao, 2019. "Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem," Applied Mathematics and Computation, Elsevier, vol. 353(C), pages 95-113.
    2. 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.
    3. Masao Fukushima & Joaquim Júdice & Welington Oliveira & Valentina Sessa, 2020. "A sequential partial linearization algorithm for the symmetric eigenvalue complementarity problem," Computational Optimization and Applications, Springer, vol. 77(3), pages 711-728, December.
    4. Mohammadreza Safi & Seyed Saeed Nabavi & Richard J. Caron, 2021. "A modified simplex partition algorithm to test copositivity," Journal of Global Optimization, Springer, vol. 81(3), pages 645-658, November.
    5. Pedro Gajardo & Alberto Seeger, 2012. "Reconstructing a matrix from a partial sampling of Pareto eigenvalues," Computational Optimization and Applications, Springer, vol. 51(3), pages 1119-1135, April.
    6. Bomze, Immanuel M., 2012. "Copositive optimization – Recent developments and applications," European Journal of Operational Research, Elsevier, vol. 216(3), pages 509-520.
    7. Ion Necoara & Yurii Nesterov & François Glineur, 2017. "Random Block Coordinate Descent Methods for Linearly Constrained Optimization over Networks," Journal of Optimization Theory and Applications, Springer, vol. 173(1), pages 227-254, April.
    8. Bomze, Immanuel M. & Gabl, Markus, 2023. "Optimization under uncertainty and risk: Quadratic and copositive approaches," European Journal of Operational Research, Elsevier, vol. 310(2), pages 449-476.
    9. Haibin Chen & Zheng-Hai Huang & Liqun Qi, 2017. "Copositivity Detection of Tensors: Theory and Algorithm," Journal of Optimization Theory and Applications, Springer, vol. 174(3), pages 746-761, September.
    10. Haibin Chen & Zheng-Hai Huang & Liqun Qi, 2018. "Copositive tensor detection and its applications in physics and hypergraphs," Computational Optimization and Applications, Springer, vol. 69(1), pages 133-158, January.
    11. Orizon Pereira Ferreira & Yingchao Gao & Sándor Zoltán Németh & Petra Renáta Rigó, 2024. "Gradient projection method on the sphere, complementarity problems and copositivity," Journal of Global Optimization, Springer, vol. 90(1), pages 1-25, September.
    12. Dingfei Jin & Guang Yang & Zhenghui Li & Haode Liu, 2019. "Sparse Recovery Algorithm for Compressed Sensing Using Smoothed l 0 Norm and Randomized Coordinate Descent," Mathematics, MDPI, vol. 7(9), pages 1-13, September.
    13. Immanuel Bomze & Werner Schachinger & Gabriele Uchida, 2012. "Think co(mpletely)positive ! Matrix properties, examples and a clustered bibliography on copositive optimization," Journal of Global Optimization, Springer, vol. 52(3), pages 423-445, March.
    14. Akihiro Tanaka & Akiko Yoshise, 2018. "LP-based tractable subcones of the semidefinite plus nonnegative cone," Annals of Operations Research, Springer, vol. 265(1), pages 155-182, June.
    15. Honggang Zhang & Zhiyuan Liu & Yicheng Zhang & Weijie Chen & Chenyang Zhang, 2024. "A Distributed Computing Method Integrating Improved Gradient Projection for Solving Stochastic Traffic Equilibrium Problem," Networks and Spatial Economics, Springer, vol. 24(2), pages 361-381, June.
    16. Brás, Carmo P. & Fukushima, Masao & Iusem, Alfredo N. & Júdice, Joaquim J., 2015. "On the Quadratic Eigenvalue Complementarity Problem over a general convex cone," Applied Mathematics and Computation, Elsevier, vol. 271(C), pages 594-608.
    17. Andrea Cristofari & Marianna Santis & Stefano Lucidi & Francesco Rinaldi, 2020. "An active-set algorithmic framework for non-convex optimization problems over the simplex," Computational Optimization and Applications, Springer, vol. 77(1), pages 57-89, September.
    18. Sergiy Butenko, 2016. "Journal of Global Optimization Best Paper Award for 2015," Journal of Global Optimization, Springer, vol. 66(4), pages 595-596, December.
    19. 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.
    20. Luís Fernandes & Joaquim Júdice & Hanif Sherali & Maria Forjaz, 2014. "On an enumerative algorithm for solving eigenvalue complementarity problems," Computational Optimization and Applications, Springer, vol. 59(1), pages 113-134, October.

    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:eee:apmaco:v:294:y:2017:i:c:p:36-48. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.