IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v171y2016i3d10.1007_s10957-016-0997-8.html
   My bibliography  Save this article

Copositivity and Sparsity Relations Using Spectral Properties

Author

Listed:
  • Abdeljelil Baccari

    (University of Tunis, ENSIT)

  • Mourad Naffouti

    (University of Tunis El Manar, FST)

Abstract

A standard quadratic optimization problem consists in minimizing a quadratic form over the standard simplex. This problem has a closer connection with copositive optimization, where the copositivity appears in local optimality conditions. In this paper, we establish a relationship between the sparsity of a solution of the standard quadratic optimization problem, from one hand, and the copositivity of the Hessian matrix of the Lagrangian from other hand. More precisely, if the Hessian matrix is copositive we prove that the number of zero components, of a local minimizer associated with a standard quadratic optimization problem, is greater or equal to the number of negative eigenvalues counting multiplicities. Moreover, we show that if the number of zero components of a local minimizer is equal to the number of negative eigenvalues of the Hessian matrix, then the strict complementarity condition is satisfied and the critical cone is a linear subspace.

Suggested Citation

  • Abdeljelil Baccari & Mourad Naffouti, 2016. "Copositivity and Sparsity Relations Using Spectral Properties," Journal of Optimization Theory and Applications, Springer, vol. 171(3), pages 998-1007, December.
  • Handle: RePEc:spr:joptap:v:171:y:2016:i:3:d:10.1007_s10957-016-0997-8
    DOI: 10.1007/s10957-016-0997-8
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-016-0997-8
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10957-016-0997-8?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. Bomze, Immanuel M., 2012. "Copositive optimization – Recent developments and applications," European Journal of Operational Research, Elsevier, vol. 216(3), pages 509-520.
    2. 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.
    Full references (including those not matched with items on IDEAS)

    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. Andrey Afonin & Roland Hildebrand & Peter J. C. Dickinson, 2021. "The extreme rays of the $$6\times 6$$ 6 × 6 copositive cone," Journal of Global Optimization, Springer, vol. 79(1), pages 153-190, January.
    2. Immanuel M. Bomze & Bo Peng, 2023. "Conic formulation of QPCCs applied to truly sparse QPs," Computational Optimization and Applications, Springer, vol. 84(3), pages 703-735, April.
    3. 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.
    4. Zhijian Lai & Akiko Yoshise, 2022. "Completely positive factorization by a Riemannian smoothing method," Computational Optimization and Applications, Springer, vol. 83(3), pages 933-966, December.
    5. Peter Dickinson & Luuk Gijben, 2014. "On the computational complexity of membership problems for the completely positive cone and its dual," Computational Optimization and Applications, Springer, vol. 57(2), pages 403-415, March.
    6. Alexander Engau & Miguel Anjos & Immanuel Bomze, 2013. "Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 78(1), pages 35-59, August.
    7. Carmo Brás & Gabriele Eichfelder & Joaquim Júdice, 2016. "Copositivity tests based on the linear complementarity problem," Computational Optimization and Applications, Springer, vol. 63(2), pages 461-493, March.
    8. Faizan Ahmed & Mirjam Dür & Georg Still, 2013. "Copositive Programming via Semi-Infinite Optimization," Journal of Optimization Theory and Applications, Springer, vol. 159(2), pages 322-340, November.
    9. Deng, Zhibin & Fang, Shu-Cherng & Jin, Qingwei & Xing, Wenxun, 2013. "Detecting copositivity of a symmetric matrix by an adaptive ellipsoid-based approximation scheme," European Journal of Operational Research, Elsevier, vol. 229(1), pages 21-28.
    10. Immanuel M. Bomze & Michael Kahr & Markus Leitner, 2021. "Trust Your Data or Not—StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization," Mathematics of Operations Research, INFORMS, vol. 46(1), pages 301-316, February.
    11. Wong, Man Hong & Zhang, Shuzhong, 2014. "On distributional robust probability functions and their computations," European Journal of Operational Research, Elsevier, vol. 233(1), pages 23-33.
    12. 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.
    13. Anwa Zhou & Jinyan Fan, 2015. "Interiors of completely positive cones," Journal of Global Optimization, Springer, vol. 63(4), pages 653-675, December.
    14. O. I. Kostyukova & T. V. Tchemisova, 2022. "On strong duality in linear copositive programming," Journal of Global Optimization, Springer, vol. 83(3), pages 457-480, July.
    15. 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.
    16. 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.
    17. Cheng Lu & Zhibin Deng & Qingwei Jin, 2017. "An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints," Journal of Global Optimization, Springer, vol. 67(3), pages 475-493, March.
    18. Li, Xiaobo & Natarajan, Karthik & Teo, Chung-Piaw & Zheng, Zhichao, 2014. "Distributionally robust mixed integer linear programs: Persistency models with applications," European Journal of Operational Research, Elsevier, vol. 233(3), pages 459-473.
    19. O. I. Kostyukova & T. V. Tchemisova & O. S. Dudina, 2024. "On the Uniform Duality in Copositive Optimization," Journal of Optimization Theory and Applications, Springer, vol. 203(2), pages 1940-1966, November.
    20. Immanuel Bomze & Markus Gabl, 2021. "Interplay of non-convex quadratically constrained problems with adjustable robust optimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 93(1), pages 115-151, February.

    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:joptap:v:171:y:2016:i:3:d:10.1007_s10957-016-0997-8. 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.