IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v201y2024i3d10.1007_s10957-024-02428-z.html
   My bibliography  Save this article

Lagrange Multipliers in Locally Convex Spaces

Author

Listed:
  • Mohammed Bachir

    (Université Paris 1 Panthéon-Sorbonne)

  • Joël Blot

    (Université Paris 1 Panthéon-Sorbonne)

Abstract

We give a general Lagrange multiplier rule for mathematical programming problems in a Hausdorff locally convex space. We consider infinitely many inequality and equality constraints. Our results gives in particular a generalisation of the result of Jahn (Introduction to the theory of nonlinear optimization, Springer, Berlin, 2007), replacing Fréchet-differentiability assumptions on the functions by the Gateaux-differentiability. Moreover, the closed convex cone with a nonempty interior in the constraints is replaced by a strictly general class of closed subsets introduced in the paper and called “admissible sets”. Examples illustrating our results are given.

Suggested Citation

  • Mohammed Bachir & Joël Blot, 2024. "Lagrange Multipliers in Locally Convex Spaces," Journal of Optimization Theory and Applications, Springer, vol. 201(3), pages 1275-1300, June.
  • Handle: RePEc:spr:joptap:v:201:y:2024:i:3:d:10.1007_s10957-024-02428-z
    DOI: 10.1007/s10957-024-02428-z
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-024-02428-z
    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-024-02428-z?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. Lopez, Marco & Still, Georg, 2007. "Semi-infinite programming," European Journal of Operational Research, Elsevier, vol. 180(2), pages 491-518, July.
    2. A. Jourani & L. Thibault, 1993. "Approximations and Metric Regularity in Mathematical Programming in Banach Space," Mathematics of Operations Research, INFORMS, vol. 18(2), pages 390-401, May.
    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. 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.
    4. 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.
    5. 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.
    6. 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.
    7. Huynh Van Ngai & Nguyen Huu Tron & Michel Théra, 2014. "Metric Regularity of the Sum of Multifunctions and Applications," Journal of Optimization Theory and Applications, Springer, vol. 160(2), pages 355-390, February.
    8. 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.
    9. Engau, Alexander & Sigler, Devon, 2020. "Pareto solutions in multicriteria optimization under uncertainty," European Journal of Operational Research, Elsevier, vol. 281(2), pages 357-368.
    10. Aguiar, Victor H. & Kashaev, Nail & Allen, Roy, 2023. "Prices, profits, proxies, and production," Journal of Econometrics, Elsevier, vol. 235(2), pages 666-693.
    11. 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.
    12. 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.
    13. 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.
    14. P. Khanh & L. Tung, 2015. "First- and second-order optimality conditions for multiobjective fractional programming," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 23(2), pages 419-440, July.
    15. Mohammad R. Oskoorouchi & Hamid R. Ghaffari & Tamás Terlaky & Dionne M. Aleman, 2011. "An Interior Point Constraint Generation Algorithm for Semi-Infinite Optimization with Health-Care Application," Operations Research, INFORMS, vol. 59(5), pages 1184-1197, October.
    16. 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.
    17. S. Rivaz & M. A. Yaghoobi & M. Hladík, 2016. "Using modified maximum regret for finding a necessarily efficient solution in an interval MOLP problem," Fuzzy Optimization and Decision Making, Springer, vol. 15(3), pages 237-253, September.
    18. Zhi Guo Feng & Fei Chen & Lin Chen & Ka Fai Cedric Yiu, 2020. "Optimality Analysis of a Class of Semi-infinite Programming Problems," Journal of Optimization Theory and Applications, Springer, vol. 186(2), pages 398-411, August.
    19. Boris S. Mordukhovich & T. T. A. Nghia, 2014. "Nonsmooth Cone-Constrained Optimization with Applications to Semi-Infinite Programming," Mathematics of Operations Research, INFORMS, vol. 39(2), pages 301-324, May.
    20. J. O. Royset & E. Y. Pee, 2012. "Rate of Convergence Analysis of Discretization and Smoothing Algorithms for Semiinfinite Minimax Problems," Journal of Optimization Theory and Applications, Springer, vol. 155(3), pages 855-882, 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:201:y:2024:i:3:d:10.1007_s10957-024-02428-z. 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.