Abstract
Given a self-mapping g: A → A and a non-self-mapping T: A → B, the aim of this work is to provide sufficient conditions for the existence of a unique point x ∈ A, called g-best proximity point, which satisfies d g x, T x = d A, B. In so doing, we provide a useful answer for the resolution of the nonlinear programming problem of globally minimizing the real valued function x → d g x, T x, thereby getting an optimal approximate solution to the equation T x = g x. An iterative algorithm is also presented to compute a solution of such problems. Our results generalize a result due to Rhoades (2001) and hence such results provide an extension of Banach's contraction principle to the case of non-self-mappings. © 2013 Maryam A. Alghamdi et al.
Lingua originale | English |
---|---|
pagine (da-a) | 1-10 |
Numero di pagine | 0 |
Rivista | Abstract and Applied Analysis |
Volume | 2013 |
Stato di pubblicazione | Published - 2013 |
All Science Journal Classification (ASJC) codes
- ???subjectarea.asjc.2600.2603???
- ???subjectarea.asjc.2600.2604???