IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v179y2018i3d10.1007_s10957-018-1373-7.html
   My bibliography  Save this article

Constraint Qualifications and Stationary Conditions for Mathematical Programming with Non-differentiable Vanishing Constraints

Author

Listed:
  • Sajjad Kazemi

    (Payam Noor University)

  • Nader Kanzi

    (Payam Noor University)

Abstract

This paper aims at studying a broad class of mathematical programming with non-differentiable vanishing constraints. First, we are interested in some various qualification conditions for the problem. Then, these constraint qualifications are applied to obtain, under different conditions, several stationary conditions of type Karush/Kuhn–Tucker.

Suggested Citation

  • Sajjad Kazemi & Nader Kanzi, 2018. "Constraint Qualifications and Stationary Conditions for Mathematical Programming with Non-differentiable Vanishing Constraints," Journal of Optimization Theory and Applications, Springer, vol. 179(3), pages 800-819, December.
    • Handle: RePEc:spr:joptap:v:179:y:2018:i:3:d:10.1007_s10957-018-1373-7
    DOI: 10.1007/s10957-018-1373-7
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-018-1373-7
    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-018-1373-7?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. Do Luu, 2016. "Optimality Condition for Local Efficient Solutions of Vector Equilibrium Problems via Convexificators and Applications," Journal of Optimization Theory and Applications, Springer, vol. 171(2), pages 643-665, November.
    2. Nguyen Huy Chieu & Gue Myung Lee, 2014. "Constraint Qualifications for Mathematical Programs with Equilibrium Constraints and their Local Preservation Property," Journal of Optimization Theory and Applications, Springer, vol. 163(3), pages 755-776, December.
    3. HALKIN, Hubert, 1974. "Implicit functions and optimization problems without continuous differentiability of the data," LIDAM Reprints CORE 184, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
    4. A. F. Izmailov & M. V. Solodov, 2009. "Mathematical Programs with Vanishing Constraints: Optimality Conditions, Sensitivity, and a Relaxation Method," Journal of Optimization Theory and Applications, Springer, vol. 142(3), pages 501-532, September.
    5. Nooshin Movahedian, 2017. "Bounded Lagrange multiplier rules for general nonsmooth problems and application to mathematical programs with equilibrium constraints," Journal of Global Optimization, Springer, vol. 67(4), pages 829-850, April.
    6. S. K. Mishra & Vinay Singh & Vivek Laha, 2016. "On duality for mathematical programs with vanishing constraints," Annals of Operations Research, Springer, vol. 243(1), pages 249-272, August.
    7. Yogendra Pandey & Shashi Kant Mishra, 2016. "Duality for Nonsmooth Optimization Problems with Equilibrium Constraints, Using Convexificators," Journal of Optimization Theory and Applications, Springer, vol. 171(2), pages 694-707, November.
    8. J. V. Burke & A. S. Lewis & M. L. Overton, 2002. "Approximating Subdifferentials by Random Sampling of Gradients," Mathematics of Operations Research, INFORMS, vol. 27(3), pages 567-584, August.
    9. Giancarlo Bigi & Massimo Pappalardo & Mauro Passacantando, 2016. "Optimization Tools for Solving Equilibrium Problems with Nonsmooth Data," Journal of Optimization Theory and Applications, Springer, vol. 171(3), pages 887-905, December.
    10. Wolfgang Achtziger & Tim Hoheisel & Christian Kanzow, 2013. "A smoothing-regularization approach to mathematical programs with vanishing constraints," Computational Optimization and Applications, Springer, vol. 55(3), pages 733-767, July.
    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. Hui Huang & Haole Zhu, 2022. "Stationary Condition for Borwein Proper Efficient Solutions of Nonsmooth Multiobjective Problems with Vanishing Constraints," Mathematics, MDPI, vol. 10(23), pages 1-18, December.
    2. Balendu Bhooshan Upadhyay & Arnav Ghosh, 2023. "On Constraint Qualifications for Mathematical Programming Problems with Vanishing Constraints on Hadamard Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 199(1), pages 1-35, October.
    3. Tadeusz Antczak, 2022. "Optimality conditions and Mond–Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints," 4OR, Springer, vol. 20(3), pages 417-442, September.
    4. Ali Sadeghieh & Nader Kanzi & Giuseppe Caristi & David Barilla, 2022. "On stationarity for nonsmooth multiobjective problems with vanishing constraints," Journal of Global Optimization, Springer, vol. 82(4), pages 929-949, April.
    5. Le Thanh Tung, 2022. "Karush–Kuhn–Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints," Annals of Operations Research, Springer, vol. 311(2), pages 1307-1334, April.

    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. Qingjie Hu & Jiguang Wang & Yu Chen, 2020. "New dualities for mathematical programs with vanishing constraints," Annals of Operations Research, Springer, vol. 287(1), pages 233-255, April.
    2. Tadeusz Antczak, 2023. "On directionally differentiable multiobjective programming problems with vanishing constraints," Annals of Operations Research, Springer, vol. 328(2), pages 1181-1212, September.
    3. Tadeusz Antczak, 2022. "Optimality conditions and Mond–Weir duality for a class of differentiable semi-infinite multiobjective programming problems with vanishing constraints," 4OR, Springer, vol. 20(3), pages 417-442, September.
    4. Ali Sadeghieh & Nader Kanzi & Giuseppe Caristi & David Barilla, 2022. "On stationarity for nonsmooth multiobjective problems with vanishing constraints," Journal of Global Optimization, Springer, vol. 82(4), pages 929-949, April.
    5. Yogendra Pandey & S. K. Mishra, 2018. "Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators," Annals of Operations Research, Springer, vol. 269(1), pages 549-564, October.
    6. Matúš Benko & Helmut Gfrerer, 2017. "An SQP method for mathematical programs with vanishing constraints with strong convergence properties," Computational Optimization and Applications, Springer, vol. 67(2), pages 361-399, June.
    7. Kin Keung Lai & Shashi Kant Mishra & Sanjeev Kumar Singh & Mohd Hassan, 2022. "Stationary Conditions and Characterizations of Solution Sets for Interval-Valued Tightened Nonlinear Problems," Mathematics, MDPI, vol. 10(15), pages 1-16, August.
    8. Do Luu & Tran Thi Mai, 2018. "Optimality and duality in constrained interval-valued optimization," 4OR, Springer, vol. 16(3), pages 311-337, September.
    9. Balendu Bhooshan Upadhyay & Arnav Ghosh, 2023. "On Constraint Qualifications for Mathematical Programming Problems with Vanishing Constraints on Hadamard Manifolds," Journal of Optimization Theory and Applications, Springer, vol. 199(1), pages 1-35, October.
    10. Vivek Laha & Harsh Narayan Singh, 2023. "On quasidifferentiable mathematical programs with equilibrium constraints," Computational Management Science, Springer, vol. 20(1), pages 1-20, December.
    11. M. Ruiz Galán, 2016. "A sharp Lagrange multiplier theorem for nonlinear programs," Journal of Global Optimization, Springer, vol. 65(3), pages 513-530, July.
    12. Tran Van Su, 2018. "New optimality conditions for unconstrained vector equilibrium problem in terms of contingent derivatives in Banach spaces," 4OR, Springer, vol. 16(2), pages 173-198, June.
    13. Fan-Yun Meng & Li-Ping Pang & Jian Lv & Jin-He Wang, 2017. "An approximate bundle method for solving nonsmooth equilibrium problems," Journal of Global Optimization, Springer, vol. 68(3), pages 537-562, July.
    14. Dmitriy Drusvyatskiy & Alexander D. Ioffe & Adrian S. Lewis, 2015. "Clarke Subgradients for Directionally Lipschitzian Stratifiable Functions," Mathematics of Operations Research, INFORMS, vol. 40(2), pages 328-349, February.
    15. W. L. Hare & A. S. Lewis, 2005. "Estimating Tangent and Normal Cones Without Calculus," Mathematics of Operations Research, INFORMS, vol. 30(4), pages 785-799, November.
    16. Tran Van Su, 2023. "Optimality and duality for nonsmooth mathematical programming problems with equilibrium constraints," Journal of Global Optimization, Springer, vol. 85(3), pages 663-685, March.
    17. Giovanni Colombo & Antonio Marigonda & Peter R. Wolenski, 2013. "The Clarke Generalized Gradient for Functions Whose Epigraph Has Positive Reach," Mathematics of Operations Research, INFORMS, vol. 38(3), pages 451-468, August.
    18. Tran Su & Dinh Dieu Hang, 2022. "Optimality and duality in nonsmooth multiobjective fractional programming problem with constraints," 4OR, Springer, vol. 20(1), pages 105-137, March.
    19. Le Thanh Tung, 2022. "Karush–Kuhn–Tucker optimality conditions and duality for multiobjective semi-infinite programming with vanishing constraints," Annals of Operations Research, Springer, vol. 311(2), pages 1307-1334, April.
    20. N. J. Huang & J. Li & S. Y. Wu, 2009. "Optimality Conditions for Vector Optimization Problems," Journal of Optimization Theory and Applications, Springer, vol. 142(2), pages 323-342, August.

    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:179:y:2018:i:3:d:10.1007_s10957-018-1373-7. 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.