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 that they have no solution. Copyright Sociedad de Estadística e Investigación Operativa 2014

MoreLess

Year of publication:	2014
Authors:	Basha, S. Sadiq
Published in:	TOP: An Official Journal of the Spanish Society of Statistics and Operations Research. - Springer. - Vol. 22.2014, 2, p. 543-553
Publisher:	Springer
Subject:	Global optimization \| Non-linear programming problem \| Optimal approximate solution \| Best proximity point \| Fixed point \| Proximal contraction \| Generalized proximal contraction \| Proximal cyclic contraction \| Generalized proximal cyclic contraction

Online Resource

Check full text access |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	text/html
Type of publication:	Article
Source:	RePEc - Research Papers in Economics

Persistent link: https://www.econbiz.de/10010995396