Best Proximity Point Results for MK‐Proximal Contractions
Copyright policy )Best Proximity Point Results for MK‐Proximal Contractions
Let A and B be nonempty subsets of a metric space with the distance function d, and T : A → B is a given non‐self‐mapping. The purpose of this paper is to solve the nonlinear programming problem that consists in minimizing the real‐valued function x ↦ d(x, Tx), where T belongs to a new class of contractive mappings. We provide also an iterative algorithm to find a solution of such optimization problems.
- King Saud University Saudi Arabia
- Atilim University Turkey
iterative algorithm, Numerical methods based on nonlinear programming, Fixed-point and coincidence theorems (topological aspects), metric space, non-self-mapping, QA1-939, nonlinear programming, contractive mapping, Special maps on metric spaces, Mathematics
iterative algorithm, Numerical methods based on nonlinear programming, Fixed-point and coincidence theorems (topological aspects), metric space, non-self-mapping, QA1-939, nonlinear programming, contractive mapping, Special maps on metric spaces, Mathematics
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).6 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!