IDEAS home Printed from https://ideas.repec.org/a/inm/ormoor/v47y2022i4p3282-3303.html

Slater Condition for Tangent Derivatives

Author

Listed:
  • Xi Yin Zheng

    (Department of Mathematics, Yunnan University, Kunming 650091, People’s Republic of China)

Abstract

Noting that the existing Slater condition, as a fundamental constraint qualification in optimization, is only applicable in the convex setting, we introduce and study the Slater condition for the Bouligand and Clarke tangent derivatives of a general vector-valued function F with respect to a closed convex cone K . Without any assumption, it is proved that the Slater condition for the Clarke (respectively, Bouligand) tangent derivative with respect to K is always stable when the objective function F undergoes small Lipschitz (calm) perturbations. Based on this, we prove that if the Clarke (Bouligand) tangent derivative of F satisfies the Slater condition (with respect to K ) then the conic inequality determined by F has a stable metric subregularity when F undergoes small Lipschitz (calm regular) perturbations. In the composite-convexity case, the converse implication is also proved to be true. Moreover, under the Slater condition for the tangent derivative of F , it is proved that the normal cone to the sublevel set of F can be formulated by the subdifferential of F , which improves the corresponding results in either the smooth or convex case. As applications, without any qualification assumption, we improve and generalize formulas for the normal cone to a convex sublevel set by Cabot and Thibault [(2014), Sequential formulae for the normal cone to sublevel sets. Transactions of the American Mathematical Society 366(12):6591–6628]. With the help of these formulas, some new Karush–Kuhn–Tucker optimality conditions are established.

Suggested Citation

  • Xi Yin Zheng, 2022. "Slater Condition for Tangent Derivatives," Mathematics of Operations Research, INFORMS, vol. 47(4), pages 3282-3303, November.
  • Handle: RePEc:inm:ormoor:v:47:y:2022:i:4:p:3282-3303
    DOI: 10.1287/moor.2021.1246
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/moor.2021.1246
    Download Restriction: no

    File URL: https://libkey.io/10.1287/moor.2021.1246?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
    ---><---

    References listed on IDEAS

    as
    1. Lopez, Marco & Still, Georg, 2007. "Semi-infinite programming," European Journal of Operational Research, Elsevier, vol. 180(2), pages 491-518, July.
    2. Stephen M. Robinson, 1976. "Regularity and Stability for Convex Multivalued Functions," Mathematics of Operations Research, INFORMS, vol. 1(2), pages 130-143, May.
    3. Hui Hu, 2005. "Characterizations of the Strong Basic Constraint Qualifications," Mathematics of Operations Research, INFORMS, vol. 30(4), pages 956-965, November.
    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. Li Wang & Feng Guo, 2014. "Semidefinite relaxations for semi-infinite polynomial programming," Computational Optimization and Applications, Springer, vol. 58(1), pages 133-159, May.
    2. S. Mishra & M. Jaiswal & H. Le Thi, 2012. "Nonsmooth semi-infinite programming problem using Limiting subdifferentials," Journal of Global Optimization, Springer, vol. 53(2), pages 285-296, June.
    3. P. Q. Khanh & N. M. Tung, 2015. "Second-Order Optimality Conditions with the Envelope-Like Effect for Set-Valued Optimization," Journal of Optimization Theory and Applications, Springer, vol. 167(1), pages 68-90, October.
    4. Cao Thanh Tinh & Thai Doan Chuong, 2022. "Conic Linear Programming Duals for Classes of Quadratic Semi-Infinite Programs with Applications," Journal of Optimization Theory and Applications, Springer, vol. 194(2), pages 570-596, August.
    5. Duarte, Belmiro P.M. & Sagnol, Guillaume & Wong, Weng Kee, 2018. "An algorithm based on semidefinite programming for finding minimax optimal designs," Computational Statistics & Data Analysis, Elsevier, vol. 119(C), pages 99-117.
    6. Nguyen Minh Tung & Nguyen Xuan Duy Bao, 2023. "New Set-Valued Directional Derivatives: Calculus and Optimality Conditions," Journal of Optimization Theory and Applications, Springer, vol. 197(2), pages 411-437, May.
    7. A. S. Lewis, 2004. "The Structured Distance to Ill-Posedness for Conic Systems," Mathematics of Operations Research, INFORMS, vol. 29(4), pages 776-785, November.
    8. Kung Fu Ng & Xi Yin Zheng, 2004. "Characterizations of Error Bounds for Convex Multifunctions on Banach Spaces," Mathematics of Operations Research, INFORMS, vol. 29(1), pages 45-63, February.
    9. Nazih Abderrazzak Gadhi, 2019. "Necessary optimality conditions for a nonsmooth semi-infinite programming problem," Journal of Global Optimization, Springer, vol. 74(1), pages 161-168, May.
    10. Rafael Correa & Marco A. López & Pedro Pérez-Aros, 2023. "Optimality Conditions in DC-Constrained Mathematical Programming Problems," Journal of Optimization Theory and Applications, Springer, vol. 198(3), pages 1191-1225, September.
    11. C. Zălinescu, 2003. "A Nonlinear Extension of Hoffman's Error Bounds for Linear Inequalities," Mathematics of Operations Research, INFORMS, vol. 28(3), pages 524-532, August.
    12. Phan Quoc Khanh & Nguyen Minh Tung, 2016. "Second-Order Conditions for Open-Cone Minimizers and Firm Minimizers in Set-Valued Optimization Subject to Mixed Constraints," Journal of Optimization Theory and Applications, Springer, vol. 171(1), pages 45-69, October.
    13. Jan Schwientek & Tobias Seidel & Karl-Heinz Küfer, 2021. "A transformation-based discretization method for solving general semi-infinite optimization problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 93(1), pages 83-114, February.
    14. Engau, Alexander & Sigler, Devon, 2020. "Pareto solutions in multicriteria optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 281(2), pages 357-368.
    15. G. Kassay & J. Kolumban, 2000. "Multivalued Parametric Variational Inequalities with α-Pseudomonotone Maps," Journal of Optimization Theory and Applications, Springer, vol. 107(1), pages 35-50, October.
    16. Aguiar, Victor H. & Kashaev, Nail & Allen, Roy, 2023. "Prices, profits, proxies, and production," Journal of Econometrics, Elsevier, vol. 235(2), pages 666-693.
    17. David Mogalle & Philipp Seufert & Jan Schwientek & Michael Bortz & Karl-Heinz Küfer, 2024. "Computing T-optimal designs via nested semi-infinite programming and twofold adaptive discretization," Computational Statistics, Springer, vol. 39(5), pages 2451-2478, July.
    18. Hassan Bakhtiari & Hossein Mohebi, 2021. "Lagrange Multiplier Characterizations of Constrained Best Approximation with Infinite Constraints," Journal of Optimization Theory and Applications, Springer, vol. 189(3), pages 814-835, June.
    19. 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.
    20. Gürkan, G. & Ozge, A.Y., 1996. "Sample-Path Optimization of Buffer Allocations in a Tandem Queue - Part I : Theoretical Issues," Other publications TiSEM 77da022b-635b-46fd-bf4a-f, Tilburg University, School of Economics and Management.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;

    JEL classification:

    Statistics

    Access and download statistics

    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:inm:ormoor:v:47:y:2022:i:4:p:3282-3303. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.