Best proximity point theorems: unriddling a special nonlinear programming problem

S. Sadiq Basha ^[1]
1. [1] Anna University, India
Localización: Top, ISSN-e 1863-8279, ISSN 1134-5764, Vol. 22, Nº. 2, 2014, págs. 543-553
Idioma: inglés
Enlaces
- Texto completo (pdf)
Resumen
- This paper addresses the non-linear programming problem of globally minimizing the real valued function x⟶d(x,Sx) where S is a generalized proximal contraction in the setting of a metric space. Eventually, one can obtain optimal approximate solutions to some fixed-point equations in the event that they have no solution.