Best proximity point theorems: exposition of a significant non-linear programming problem

作     者：Basha, S. Sadiq Shahzad, N. Jeyaraj, R. 

作者机构：Anna Univ Dept Math Madras 600025 Tamil Nadu India King Abdulaziz Univ Dept Math Jeddah 21589 Saudi Arabia St Josephs Coll Higher Secondary Sch Tiruchirappalli 620002 India 

出 版 物：《JOURNAL OF GLOBAL OPTIMIZATION》 

年 卷 期：2013年第56卷第4期

页      面：1699-1705页

核心收录：

学科分类：1201[管理学-管理科学与工程(可授管理学、工学学位)] 07[理学] 070104[理学-应用数学] 0701[理学-数学] 

主　　题：Global optimization Non-linear programming problem Best proximity point Optimal approximate solution Generalized proximal contraction Proximal contraction Fixed point 

摘      要：The primary goal of this work is to address the non-linear programming problem of globally minimizing the real valued function x - d(x, Tx) where T is presumed to be a non-self mapping that is a generalized proximal contraction in the setting of a metric space. Indeed, an iterative algorithm is presented to determine a solution of the preceding non-linear programming problem that focuses on global optimization. As a sequel, one can compute optimal approximate solutions to some fixed point equations and optimal solutions to some unconstrained non-linear programming problems.