首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Global optimization in metric spaces with partial orders
Abstract:The main objective of this article is to resolve an optimization problem in the setting of a metric space that is endowed with a partial order. In fact, given non-empty subsets A and B of a metric space that is equipped with a partial order, and a non-self mapping S: A?→?B, this article explores the existence of an optimal approximate solution, known as a best proximity point of the mapping S, to the equation Sx?=?x, where S is a proximally increasing, ordered proximal contraction. This article exhibits an algorithm for determining such an optimal approximate solution. Moreover, the result elicited in this article subsumes a fixed point theorem, due to Nieto and Rodriguez-Lopez, in the setting of a metric space with a partial order.
Keywords:partially ordered set  optimal approximate solution  increasing mapping  proximally increasing mapping  ordered proximal contraction  ordered contraction  fixed point  best proximity point
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号