Best proximity point theorems: unriddling a special nonlinear programming problem

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:TOP Jg. 22; H. 2; S. 543 - 553
1. Verfasser: Sadiq Basha, S.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.07.2014
Schlagworte:
ISSN:1134-5764, 1863-8279
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:1134-5764
1863-8279
DOI:10.1007/s11750-012-0269-1