IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v192y2022i3d10.1007_s10957-022-02007-0.html
   My bibliography  Save this article

A Comparative Study of Sequential Optimality Conditions for Mathematical Programs with Cardinality Constraints

Author

Listed:
  • Ademir A. Ribeiro

    (Federal University of Paraná)

  • Mael Sachine

    (Federal University of Paraná)

  • Evelin H. M. Krulikovski

    (Federal University of Paraná)

Abstract

We propose a comparative study of sequential optimality conditions for mathematical programs with cardinality constraints. Besides analyzing some of the classical approximate conditions for nonlinear programming, such as AKKT, CAKKT and PAKKT, we also propose an approximate weak stationarity ( $${ AW}$$ AW -stationarity) concept designed to deal with this class of problems and we prove that it is a legitimate optimality condition independently of any constraint qualification. We point out that, despite the computational appeal of the sequential optimality conditions, in this work we are not concerned with algorithmic consequences. Our aim is purely to discuss theoretical aspects of such conditions for MPCaC problems.

Suggested Citation

  • 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.
    • Handle: RePEc:spr:joptap:v:192:y:2022:i:3:d:10.1007_s10957-022-02007-0
    DOI: 10.1007/s10957-022-02007-0
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-022-02007-0
    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-022-02007-0?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. 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.
    2. J.M. Martínez & B.F. Svaiter, 2003. "A Practical Optimality Condition Without Constraint Qualifications for Nonlinear Programming," Journal of Optimization Theory and Applications, Springer, vol. 118(1), pages 117-133, July.
    3. 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.
    4. Elias S. Helou & Sandra A. Santos & Lucas E. A. Simões, 2020. "Analysis of a New Sequential Optimality Condition Applied to Mathematical Programs with Equilibrium Constraints," Journal of Optimization Theory and Applications, Springer, vol. 185(2), pages 433-447, May.
    5. 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.
    6. 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.
    7. Roberto Andreani & José Mario Martínez & Alberto Ramos & Paulo J. S. Silva, 2018. "Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization," Mathematics of Operations Research, INFORMS, vol. 43(3), pages 693-717, August.
    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. 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.

    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. Renan W. Prado & Sandra A. Santos & Lucas E. A. Simões, 2023. "On the Fulfillment of the Complementary Approximate Karush–Kuhn–Tucker Conditions and Algorithmic Applications," Journal of Optimization Theory and Applications, Springer, vol. 197(2), pages 705-736, May.
    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. L. F. Bueno & G. Haeser & F. Lara & F. N. Rojas, 2020. "An Augmented Lagrangian method for quasi-equilibrium problems," Computational Optimization and Applications, Springer, vol. 76(3), pages 737-766, July.
    4. 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.
    5. Roberto Andreani & José Mario Martínez & Alberto Ramos & Paulo J. S. Silva, 2018. "Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization," Mathematics of Operations Research, INFORMS, vol. 43(3), pages 693-717, August.
    6. Gabriel Haeser & Alberto Ramos, 2020. "Constraint Qualifications for Karush–Kuhn–Tucker Conditions in Multiobjective Optimization," Journal of Optimization Theory and Applications, Springer, vol. 187(2), pages 469-487, November.
    7. Letícia Becher & Damián Fernández & Alberto Ramos, 2023. "A trust-region LP-Newton method for constrained nonsmooth equations under Hölder metric subregularity," Computational Optimization and Applications, Springer, vol. 86(2), pages 711-743, November.
    8. 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.
    9. L. F. Bueno & G. Haeser & J. M. Martínez, 2015. "A Flexible Inexact-Restoration Method for Constrained Optimization," Journal of Optimization Theory and Applications, Springer, vol. 165(1), pages 188-208, April.
    10. R. Gárciga Otero & B. F. Svaiter, 2008. "New Condition Characterizing the Solutions of Variational Inequality Problems," Journal of Optimization Theory and Applications, Springer, vol. 137(1), pages 89-98, April.
    11. A. Pascoletti & P. Serafini, 2007. "Differential Conditions for Constrained Nonlinear Programming via Pareto Optimization," Journal of Optimization Theory and Applications, Springer, vol. 134(3), pages 399-411, September.
    12. Juliano B. Francisco & Douglas S. Gonçalves & Fermín S. V. Bazán & Lila L. T. Paredes, 2020. "Non-monotone inexact restoration method for nonlinear programming," Computational Optimization and Applications, Springer, vol. 76(3), pages 867-888, July.
    13. An, Kun & Lo, Hong K., 2014. "Ferry service network design with stochastic demand under user equilibrium flows," Transportation Research Part B: Methodological, Elsevier, vol. 66(C), pages 70-89.
    14. Gabriel Haeser, 2018. "A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms," Computational Optimization and Applications, Springer, vol. 70(2), pages 615-639, June.
    15. R. Andreani & S. Castro & J. Chela & A. Friedlander & S. Santos, 2009. "An inexact-restoration method for nonlinear bilevel programming problems," Computational Optimization and Applications, Springer, vol. 43(3), pages 307-328, July.
    16. Hachem Slimani & Mohammed-Said Radjef, 2016. "Generalized Fritz John optimality in nonlinear programming in the presence of equality and inequality constraints," Operational Research, Springer, vol. 16(2), pages 349-364, July.
    17. R. Andreani & E. H. Fukuda & G. Haeser & D. O. Santos & L. D. Secchin, 2021. "On the use of Jordan Algebras for improving global convergence of an Augmented Lagrangian method in nonlinear semidefinite programming," Computational Optimization and Applications, Springer, vol. 79(3), pages 633-648, July.
    18. 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.
    19. Nithirat Sisarat & Rabian Wangkeeree & Tamaki Tanaka, 2020. "Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps," Journal of Global Optimization, Springer, vol. 77(2), pages 273-287, June.
    20. Juliano Francisco & J. Martínez & Leandro Martínez & Feodor Pisnitchenko, 2011. "Inexact restoration method for minimization problems arising in electronic structure calculations," Computational Optimization and Applications, Springer, vol. 50(3), pages 555-590, December.

    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:192:y:2022:i:3:d:10.1007_s10957-022-02007-0. 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.