Infinite Programming and Application in the Best Proximity Point Theory

  • Chapter
  • First Online:
Advances in Functional Analysis and Fixed-Point Theory

Part of the book series: Industrial and Applied Mathematics ((INAMA))

  • 66 Accesses

Abstract

Various types of unconnected optimization problems in infinite space are explored. In particular, many papers have been published on the best approximation and the best proximity point. The purpose of this chapter is to start a new path to solve constrained optimization problems in the infinite space of the best approximation and the best proximity point types. Hence, we give a new extension of the KKT optimality conditions in a Hilbert space, and we solve the KKT system of a nonlinear programming problem with infinite constraints.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
EUR 32.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or Ebook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
EUR 29.95
Price includes VAT (Germany)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
EUR 117.69
Price includes VAT (Germany)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
EUR 149.79
Price includes VAT (Germany)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free ship** worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Alfuraidan, M.R., Jorquera, E.D., Khamsi, M.A.: Fixed point theorems for monotone Caristi inward map**s. Numer. Funct. Anal. Optim. 39, 1092–1101 (2018)

    Article  MathSciNet  Google Scholar 

  2. Braunschweiger, C.C., Clark, H.E.: An extension of the farkas theorem. Am. Math. Monthly 69(4), 272–277 (1962)

    Article  MathSciNet  Google Scholar 

  3. Craven, B.D.: Sufficient Fritz John optimality conditions. Bull. Austral. Math. Soc. 13, 411–419 (1975)

    Article  MathSciNet  Google Scholar 

  4. Chaira, K., Kabil, M., Kamouss, A., Lazaiz, S.: Best proximity points for monotone relatively nonexpansive map**s in ordered Banach spaces. Axioms 8, 121 (2019)

    Article  Google Scholar 

  5. Craven, B.D.: Modified Kuhn-Tucker conditions when a minimum is not attained. Oper. Res. Lett. 3, 47–52 (1984)

    Google Scholar 

  6. Eldred, A.A., Kirk, W.A., Veeramani, P.: Proximinal normal structure and relatively nonexpansive map**s. Studia Math. 171(3), 283–293 (2005)

    Article  MathSciNet  Google Scholar 

  7. Eldred, A.A., Veeramani, P.: Existence and convergence of best proximity points. J. Math. Anal. Appl. 323, 1001–1006 (2006)

    Article  MathSciNet  Google Scholar 

  8. Fiacco, A.V., McCormick, G.P.: The slacked unconstrained minimization technique for convex programming. SIAM J. Appl. Math. 15, 505–515 (1967)

    Article  MathSciNet  Google Scholar 

  9. Giorgi, G., Jiménez, B., Novo, V.: Approximate Karush-Kuhn-Tucker condition in multiobjective optimization. J. Optim. Theory Appl. 171, 70–89 (2016)

    Article  MathSciNet  Google Scholar 

  10. Guignard, M.: Generalized Kuhn-Tucker conditions for mathematical programming problems in a Banach space. SIAM J. Control 7, 232–241 (1969)

    Article  MathSciNet  Google Scholar 

  11. Gulati, T.R.: A Fritz John type sufficient optimality theorem in complex space. Bull. Austral. Math. Soc. 11, 219–224 (1974)

    Article  MathSciNet  Google Scholar 

  12. Kortanek, K.O., Evans, J.P.: Asymptotic Lagrange regularity for pseudoconcave programming with weak constraint qualification. Oper. Res. 16, 849–857 (1968)

    Article  MathSciNet  Google Scholar 

  13. Nashine, H.K., Kumam, P., Vetro, C.: Best proximity point theorems for rational proximal contractions. Fixed Point Theory Appl. 2013, 95 (2013)

    Article  MathSciNet  Google Scholar 

  14. Oliveira, A.V., Santos, B.L., Osuna-Gómez, R., Rojas-Medar, M.A.: Optimality conditions for nonlinear infinite programming problems. Optim. Lett. 9(6), 1131–1147 (2015)

    Google Scholar 

  15. Trudzik, L.I.: Asymptotic Kuhn-Tucker conditions in abstract spaces. Numer. Funct. Anal. Optim. 4, 355–369 (1982)

    Article  MathSciNet  Google Scholar 

  16. Tapia, R.A., Trosset, M.W.: Extension of the Karush-Kuhn-Tucker necessity conditions to infinite programming. SIAM Rev. 36(1), 1–17 (1994)

    Article  MathSciNet  Google Scholar 

  17. Sankar, R.V., Veeramani, P.: Best proximity pair theorems for relatively nonexpansive map**s. Appl. Gen. Topol. 10(1), 21–28 (2009)

    Article  MathSciNet  Google Scholar 

  18. Zlobec, S.: Extensions of asymptotic Kuhn-Tucker conditions in mathematical programming. SIAM J. Appl. Math. 21, 448–460 (1971)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Vahid Parvaneh .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Haddadi, M.R., Mursaleen, M., Valaei, M., Parvaneh, V. (2024). Infinite Programming and Application in the Best Proximity Point Theory. In: Hazarika, B., Acharjee, S., Djordjević, D.S. (eds) Advances in Functional Analysis and Fixed-Point Theory. Industrial and Applied Mathematics. Springer, Singapore. https://doi.org/10.1007/978-981-99-9207-2_2

Download citation

Publish with us

Policies and ethics

Navigation