IDEAS home Printed from https://ideas.repec.org/a/spr/joptap/v189y2021i3d10.1007_s10957-021-01856-5.html
   My bibliography  Save this article

Lagrange Multiplier Characterizations of Constrained Best Approximation with Infinite Constraints

Author

Listed:
  • Hassan Bakhtiari

    (Shahid Bahonar University of Kerman)

  • Hossein Mohebi

    (Shahid Bahonar University of Kerman
    Shahid Bahonar University of Kerman)

Abstract

In this paper, we first employ the subdifferential closedness condition and Guignard’s constraint qualification to present “dual cone characterizations” of the constraint set $$ \varOmega $$ Ω with infinite nonconvex inequality constraints, where the constraint functions are Fréchet differentiable that are not necessarily convex. We next provide sufficient conditions for which the “strong conical hull intersection property” (strong CHIP) holds, and moreover, we establish necessary and sufficient conditions for characterizing “perturbation property” of the best approximation to any $$x \in {\mathcal {H}}$$ x ∈ H from the convex set $$ \tilde{\varOmega }:=C \cap \varOmega $$ Ω ~ : = C ∩ Ω by using the strong CHIP of $$\lbrace C,\varOmega \rbrace ,$$ { C , Ω } , where C is a non-empty closed convex set in the Hilbert space $${\mathcal {H}}.$$ H . Finally, we derive the “Lagrange multiplier characterizations” of constrained best approximation under the subdifferential closedness condition and Guignard’s constraint qualification. Several illustrative examples are presented to clarify our results.

Suggested Citation

  • 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.
  • Handle: RePEc:spr:joptap:v:189:y:2021:i:3:d:10.1007_s10957-021-01856-5
    DOI: 10.1007/s10957-021-01856-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10957-021-01856-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/s10957-021-01856-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. 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.
    2. Lopez, Marco & Still, Georg, 2007. "Semi-infinite programming," European Journal of Operational Research, Elsevier, vol. 180(2), pages 491-518, July.
    3. Goberna, M. A. & Lopez, M. A., 2002. "Linear semi-infinite programming theory: An updated survey," European Journal of Operational Research, Elsevier, vol. 143(2), pages 390-405, December.
    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. 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.
    2. 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.
    3. He, Li & Huang, Guo H. & Lu, Hongwei, 2011. "Bivariate interval semi-infinite programming with an application to environmental decision-making analysis," European Journal of Operational Research, Elsevier, vol. 211(3), pages 452-465, June.
    4. Bo Wei & William B. Haskell & Sixiang Zhao, 2020. "An inexact primal-dual algorithm for semi-infinite programming," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 91(3), pages 501-544, June.
    5. 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.
    6. 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.
    7. Stein, Oliver, 2012. "How to solve a semi-infinite optimization problem," European Journal of Operational Research, Elsevier, vol. 223(2), pages 312-320.
    8. Souvik Das & Ashwin Aravind & Ashish Cherukuri & Debasish Chatterjee, 2022. "Near-optimal solutions of convex semi-infinite programs via targeted sampling," Annals of Operations Research, Springer, vol. 318(1), pages 129-146, November.
    9. Aguiar, Victor H. & Kashaev, Nail & Allen, Roy, 2023. "Prices, profits, proxies, and production," Journal of Econometrics, Elsevier, vol. 235(2), pages 666-693.
    10. Li Wang & Feng Guo, 2014. "Semidefinite relaxations for semi-infinite polynomial programming," Computational Optimization and Applications, Springer, vol. 58(1), pages 133-159, May.
    11. Shaojian Qu & Mark Goh & Soon-Yi Wu & Robert Souza, 2014. "Multiobjective DC programs with infinite convex constraints," Journal of Global Optimization, Springer, vol. 59(1), pages 41-58, May.
    12. 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.
    13. Josef Kallrath & Steffen Rebennack, 2014. "Cutting ellipses from area-minimizing rectangles," Journal of Global Optimization, Springer, vol. 59(2), pages 405-437, July.
    14. 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.
    15. 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.
    16. P. Guo & G. Huang & L. He & H. Zhu, 2009. "Interval-parameter Two-stage Stochastic Semi-infinite Programming: Application to Water Resources Management under Uncertainty," Water Resources Management: An International Journal, Published for the European Water Resources Association (EWRA), Springer;European Water Resources Association (EWRA), vol. 23(5), pages 1001-1023, March.
    17. Takayuki Okuno & Masao Fukushima, 2014. "Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints," Journal of Global Optimization, Springer, vol. 60(1), pages 25-48, September.
    18. Lopez, Marco & Still, Georg, 2007. "Semi-infinite programming," European Journal of Operational Research, Elsevier, vol. 180(2), pages 491-518, July.
    19. Balendu Bhooshan Upadhyay & Arnav Ghosh & Savin Treanţă, 2024. "Efficiency conditions and duality for multiobjective semi-infinite programming problems on Hadamard manifolds," Journal of Global Optimization, Springer, vol. 89(3), pages 723-744, July.
    20. Lou, Yingyan & Yin, Yafeng & Lawphongpanich, Siriphong, 2010. "Robust congestion pricing under boundedly rational user equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 44(1), pages 15-28, 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:joptap:v:189:y:2021:i:3:d:10.1007_s10957-021-01856-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.