IDEAS home Printed from https://ideas.repec.org/a/spr/jglopt/v88y2024i2d10.1007_s10898-023-01317-5.html
   My bibliography  Save this article

Relaxed method for optimization problems with cardinality constraints

Author

Listed:
  • Yan-Chao Liang

    (Henan Normal University)

  • Gui-Hua Lin

    (Shanghai University)

Abstract

In this paper, we review optimality conditions and constraint qualifications for the optimization problems with cardinality constraints (OPCC). OPCC is a class of optimization problems with important applications. In this paper, we provide a relaxed method for OPCC. We show that the Mangasarian-Fromovitz constraint qualification or constant positive linear dependence constraint qualification holds for the relaxed problem under some mild conditions. We provide that the local solution of the relaxed problem converges to the M-stationarity of OPCC under appropriate conditions. Furthermore, we obtain that the inexact stationary points of relaxed problem converges to the M-stationarity of OPCC under very weaker conditions. Numerical experiments show the effectiveness of the proposed method.

Suggested Citation

  • Yan-Chao Liang & Gui-Hua Lin, 2024. "Relaxed method for optimization problems with cardinality constraints," Journal of Global Optimization, Springer, vol. 88(2), pages 359-375, February.
  • Handle: RePEc:spr:jglopt:v:88:y:2024:i:2:d:10.1007_s10898-023-01317-5
    DOI: 10.1007/s10898-023-01317-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10898-023-01317-5
    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/s10898-023-01317-5?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. Walter Murray & Howard Shek, 2012. "A local relaxation method for the cardinality constrained portfolio optimization problem," Computational Optimization and Applications, Springer, vol. 53(3), pages 681-709, December.
    2. Christian Kanzow & Andreas B. Raharja & Alexandra Schwartz, 2021. "An Augmented Lagrangian Method for Cardinality-Constrained Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 189(3), pages 793-813, June.
    3. Dimitris Bertsimas & Romy Shioda, 2009. "Algorithm for cardinality-constrained quadratic optimization," Computational Optimization and Applications, Springer, vol. 43(1), pages 1-22, May.
    4. Max Bucher & Alexandra Schwartz, 2018. "Second-Order Optimality Conditions and Improved Convergence Results for Regularization Methods for Cardinality-Constrained Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 178(2), pages 383-410, August.
    5. Martin Branda & Max Bucher & Michal Červinka & Alexandra Schwartz, 2018. "Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization," Computational Optimization and Applications, Springer, vol. 70(2), pages 503-530, June.
    6. Xiaojin Zheng & Xiaoling Sun & Duan Li & Jie Sun, 2014. "Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach," Computational Optimization and Applications, Springer, vol. 59(1), pages 379-397, October.
    7. Christian Kanzow & Andreas B. Raharja & Alexandra Schwartz, 2021. "Sequential optimality conditions for cardinality-constrained optimization problems with applications," Computational Optimization and Applications, Springer, vol. 80(1), pages 185-211, September.
    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. Jean C. A. Medeiros & Ademir A. Ribeiro & Mael Sachine & Leonardo D. Secchin, 2025. "A Practical Second-Order Optimality Condition for Cardinality-Constrained Problems with Application to an Augmented Lagrangian Method," Journal of Optimization Theory and Applications, Springer, vol. 206(2), pages 1-25, August.
    2. Christian Kanzow & Andreas B. Raharja & Alexandra Schwartz, 2021. "Sequential optimality conditions for cardinality-constrained optimization problems with applications," Computational Optimization and Applications, Springer, vol. 80(1), pages 185-211, September.
    3. Ademir A. Ribeiro & Mael Sachine & Evelin H. M. Krulikovski, 2022. "A Comparative Study of Sequential Optimality Conditions for Mathematical Programs with Cardinality Constraints," Journal of Optimization Theory and Applications, Springer, vol. 192(3), pages 1067-1083, March.
    4. Matteo Lapucci & Tommaso Levato & Francesco Rinaldi & Marco Sciandrone, 2023. "A Unifying Framework for Sparsity-Constrained Optimization," Journal of Optimization Theory and Applications, Springer, vol. 199(2), pages 663-692, November.
    5. Martin Branda & Max Bucher & Michal Červinka & Alexandra Schwartz, 2018. "Convergence of a Scholtes-type regularization method for cardinality-constrained optimization problems with an application in sparse robust portfolio optimization," Computational Optimization and Applications, Springer, vol. 70(2), pages 503-530, June.
    6. Max Bucher & Alexandra Schwartz, 2018. "Second-Order Optimality Conditions and Improved Convergence Results for Regularization Methods for Cardinality-Constrained Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 178(2), pages 383-410, August.
    7. Jize Zhang & Tim Leung & Aleksandr Aravkin, 2018. "A Relaxed Optimization Approach for Cardinality-Constrained Portfolio Optimization," Papers 1810.10563, arXiv.org.
    8. N. Krejić & E. H. M. Krulikovski & M. Raydan, 2023. "A Low-Cost Alternating Projection Approach for a Continuous Formulation of Convex and Cardinality Constrained Optimization," SN Operations Research Forum, Springer, vol. 4(4), pages 1-24, December.
    9. Nasim Dehghan Hardoroudi & Abolfazl Keshvari & Markku Kallio & Pekka Korhonen, 2017. "Solving cardinality constrained mean-variance portfolio problems via MILP," Annals of Operations Research, Springer, vol. 254(1), pages 47-59, July.
    10. Madani Bezoui & Mustapha Moulaï & Ahcène Bounceur & Reinhardt Euler, 2019. "An iterative method for solving a bi-objective constrained portfolio optimization problem," Computational Optimization and Applications, Springer, vol. 72(2), pages 479-498, March.
    11. Didier Aussel & Daniel Lasluisa & David Salas, 2025. "Cardinality Constraints in Single-Leader-Multi-Follower Games," Journal of Optimization Theory and Applications, Springer, vol. 206(1), pages 1-27, July.
    12. Zhou, Zhongbao & Jin, Qianying & Xiao, Helu & Wu, Qian & Liu, Wenbin, 2018. "Estimation of cardinality constrained portfolio efficiency via segmented DEA," Omega, Elsevier, vol. 76(C), pages 28-37.
    13. Christian Kanzow & Andreas B. Raharja & Alexandra Schwartz, 2021. "An Augmented Lagrangian Method for Cardinality-Constrained Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 189(3), pages 793-813, June.
    14. Lili Pan & Ziyan Luo & Naihua Xiu, 2017. "Restricted Robinson Constraint Qualification and Optimality for Cardinality-Constrained Cone Programming," Journal of Optimization Theory and Applications, Springer, vol. 175(1), pages 104-118, October.
    15. S. Lämmel & V. Shikhman, 2022. "On nondegenerate M-stationary points for sparsity constrained nonlinear optimization," Journal of Global Optimization, Springer, vol. 82(2), pages 219-242, February.
    16. Ken Kobayashi & Yuichi Takano & Kazuhide Nakata, 2021. "Bilevel cutting-plane algorithm for cardinality-constrained mean-CVaR portfolio optimization," Journal of Global Optimization, Springer, vol. 81(2), pages 493-528, October.
    17. Francesco Cesarone & Andrea Scozzari & Fabio Tardella, 2015. "Linear vs. quadratic portfolio selection models with hard real-world constraints," Computational Management Science, Springer, vol. 12(3), pages 345-370, July.
    18. Rui Pedro Brito & Hélder Sebastião & Pedro Godinho, 2015. "Portfolio Management With Higher Moments: The Cardinality Impact," GEMF Working Papers 2015-15, GEMF, Faculty of Economics, University of Coimbra.
    19. Ceren Tuncer Şakar & Murat Köksalan, 2013. "A stochastic programming approach to multicriteria portfolio optimization," Journal of Global Optimization, Springer, vol. 57(2), pages 299-314, October.
    20. Ricardo M. Lima & Ignacio E. Grossmann, 2017. "On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study," Computational Optimization and Applications, Springer, vol. 66(1), pages 1-37, January.

    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:jglopt:v:88:y:2024:i:2:d:10.1007_s10898-023-01317-5. 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.