scholarly journals Best Proximity Point Theorem in Quasi-Pseudometric Spaces

2016 ◽  
Vol 2016 ◽  
pp. 1-8
Author(s):  
Robert Plebaniak
Keyword(s):  
Approximate Solution ◽  
Point Theorem ◽  
Best Proximity Point ◽  
Sufficient Conditions ◽  
Optimal Solution ◽  
Pseudometric Space

In quasi-pseudometric spaces (not necessarily sequentially complete), we continue the research on the quasi-generalized pseudodistances. We introduce the concepts of semiquasiclosed map and contraction of Nadler type with respect to generalized pseudodistances. Next, inspired by Abkar and Gabeleh we proved new best proximity point theorem in a quasi-pseudometric space. A best proximity point theorem furnishes sufficient conditions that ascertain the existence of an optimal solution to the problem of globally minimizing the errorinf⁡{d(x,y):y∈T(x)}, and hence the existence of a consummate approximate solution to the equationT(X)=x.

scholarly journals Best Proximity Points for Some Classes of Proximal Contractions

2013 ◽  
Vol 2013 ◽  
pp. 1-10 ◽  
Author(s):  
Maryam A. Alghamdi ◽  
Naseer Shahzad ◽  
Francesca Vetro
Keyword(s):  
Approximate Solution ◽  
Nonlinear Programming ◽  
Programming Problem ◽  
Iterative Algorithm ◽  
Best Proximity Point ◽  
Sufficient Conditions ◽  
Nonlinear Programming Problem ◽  
Optimal Approximate Solution ◽  
Unique Point ◽  
Banach’S Contraction Principle

Given a self-mapping and a non-self-mapping , the aim of this work is to provide sufficient conditions for the existence of a unique point , calledg-best proximity point, which satisfies . In so doing, we provide a useful answer for the resolution of the nonlinear programming problem of globally minimizing the real valued function , thereby getting an optimal approximate solution to the equation . An iterative algorithm is also presented to compute a solution of such problems. Our results generalize a result due to Rhoades (2001) and hence such results provide an extension of Banach's contraction principle to the case of non-self-mappings.

scholarly journals Best Proximity Results with Applications to Nonlinear Dynamical Systems

Mathematics ◽  
2019 ◽  
Vol 7 (10) ◽  
pp. 900 ◽  
Author(s):  
Hamed H Al-Sulami ◽  
Nawab Hussain ◽  
Jamshaid Ahmad
Keyword(s):  
Approximate Solution ◽  
Global Minimum ◽  
Metric Spaces ◽  
Nonlinear Dynamical Systems ◽  
Best Proximity Point ◽  
Sufficient Conditions ◽  
Dynamical Programming ◽  
Ordered Metric Spaces ◽  
Nonlinear Dynamical ◽  
Multivalued Contraction

Best proximity point theorem furnishes sufficient conditions for the existence and computation of an approximate solution ω that is optimal in the sense that the error σ ( ω , J ω ) assumes the global minimum value σ ( θ , ϑ ) . The aim of this paper is to define the notion of Suzuki α - Θ -proximal multivalued contraction and prove the existence of best proximity points ω satisfying σ ( ω , J ω ) = σ ( θ , ϑ ) , where J is assumed to be continuous or the space M is regular. We derive some best proximity results on a metric space with graphs and ordered metric spaces as consequences. We also provide a non trivial example to support our main results. As applications of our main results, we discuss some variational inequality problems and dynamical programming problems.

A new algorithm for finding CRM-model coefficients

2019 ◽  
Vol 5 (3) ◽  
pp. 164-185 ◽  
Author(s):  
Alexander D. Bekman ◽  
Sergey V. Stepanov ◽  
Alexander A. Ruchkin ◽  
Dmitry V. Zelenin
Keyword(s):  
Approximate Solution ◽  
Optimization Problem ◽  
Optimal Solution ◽  
Complex Form ◽  
Approximate Solutions ◽  
The Other ◽  
Programming Algorithm ◽  
Stochastic Algorithms ◽  
Large Set ◽  
Flow Rates

The quantitative evaluation of producer and injector well interference based on well operation data (profiles of flow rates/injectivities and bottomhole/reservoir pressures) with the help of CRM (Capacitance-Resistive Models) is an optimization problem with large set of variables and constraints. The analytical solution cannot be found because of the complex form of the objective function for this problem. Attempts to find the solution with stochastic algorithms take unacceptable time and the result may be far from the optimal solution. Besides, the use of universal (commercial) optimizers hides the details of step by step solution from the user, for example&nbsp;— the ambiguity of the solution as the result of data inaccuracy.<br> The present article concerns two variants of CRM problem. The authors present a new algorithm of solving the problems with the help of “General Quadratic Programming Algorithm”. The main advantage of the new algorithm is the greater performance in comparison with the other known algorithms. Its other advantage is the possibility of an ambiguity analysis. This article studies the conditions which guarantee that the first variant of problem has a unique solution, which can be found with the presented algorithm. Another algorithm for finding the approximate solution for the second variant of the problem is also considered. The method of visualization of approximate solutions set is presented. The results of experiments comparing the new algorithm with some previously known are given.

scholarly journals Algebraic Solution to Constrained Bi-Criteria Decision Problem of Rating Alternatives through Pairwise Comparisons

Mathematics ◽  
2021 ◽  
Vol 9 (4) ◽  
pp. 303
Author(s):  
Nikolai Krivulin
Keyword(s):  
Decision Problem ◽  
Optimization Problem ◽  
Pareto Frontier ◽  
Sufficient Conditions ◽  
Approximation Error ◽  
Optimal Solution ◽  
Algebraic Solution ◽  
Pairwise Comparisons ◽  
Logarithmic Scale ◽  
Idempotent Algebra

We consider a decision-making problem to evaluate absolute ratings of alternatives from the results of their pairwise comparisons according to two criteria, subject to constraints on the ratings. We formulate the problem as a bi-objective optimization problem of constrained matrix approximation in the Chebyshev sense in logarithmic scale. The problem is to approximate the pairwise comparison matrices for each criterion simultaneously by a common consistent matrix of unit rank, which determines the vector of ratings. We represent and solve the optimization problem in the framework of tropical (idempotent) algebra, which deals with the theory and applications of idempotent semirings and semifields. The solution involves the introduction of two parameters that represent the minimum values of approximation error for each matrix and thereby describe the Pareto frontier for the bi-objective problem. The optimization problem then reduces to a parametrized vector inequality. The necessary and sufficient conditions for solutions of the inequality serve to derive the Pareto frontier for the problem. All solutions of the inequality, which correspond to the Pareto frontier, are taken as a complete Pareto-optimal solution to the problem. We apply these results to the decision problem of interest and present illustrative examples.

scholarly journals Best Proximity Point for Generalized Proximal Weak Contractions in Complete Metric Space

2014 ◽  
Vol 2014 ◽  
pp. 1-6 ◽  
Author(s):  
Erdal Karapınar ◽  
V. Pragadeeswarar ◽  
M. Marudai
Keyword(s):  
Approximate Solution ◽  
Metric Space ◽  
Existence And Uniqueness ◽  
Metric Spaces ◽  
Best Proximity Point ◽  
Complete Metric Space ◽  
Optimal Approximate Solution ◽  
Weak Contraction ◽  
Complete Metric Spaces ◽  
New Class

We introduce a new class of nonself-mappings, generalized proximal weak contraction mappings, and prove the existence and uniqueness of best proximity point for such mappings in the context of complete metric spaces. Moreover, we state an algorithm to determine such an optimal approximate solution designed as a best proximity point. We establish also an example to illustrate our main results. Our result provides an extension of the related results in the literature.

scholarly journals Existence of Positive Periodic Solutions for a Class ofn-Species Competition Systems with Impulses

2011 ◽  
Vol 2011 ◽  
pp. 1-9
Author(s):  
Peilian Guo ◽  
Yansheng Liu
Keyword(s):  
Fixed Point ◽  
Fixed Point Theorem ◽  
Periodic Solutions ◽  
Point Theorem ◽  
Sufficient Conditions ◽  
Species Competition ◽  
Positive Periodic Solutions ◽  
The Fixed Point Theorem

By using the fixed point theorem on cone, some sufficient conditions are obtained on the existence of positive periodic solutions for a class ofn-species competition systems with impulses. Meanwhile, we point out that the conclusion of (Yan, 2009) is incorrect.

scholarly journals Uniqueness and Stability Results on Non-local Stochastic Random Impulsive Integro-Differential Equations

2021 ◽  
Vol 2 (3) ◽  
pp. 9-20
Author(s):  
VARSHINI S ◽  
BANUPRIYA K ◽  
RAMKUMAR K ◽  
RAVIKUMAR K
Keyword(s):  
Fixed Point ◽  
Fixed Point Theorem ◽  
Differential Equations ◽  
Point Theorem ◽  
Sufficient Conditions ◽  
Banach Fixed Point Theorem ◽  
Local Conditions ◽  
Non Local ◽  
Inequality Techniques ◽  
Stability Results

The paper is concerned with stochastic random impulsive integro-differential equations with non-local conditions. The sufficient conditions guarantees uniqueness of mild solution derived using Banach fixed point theorem. Stability of the solution is derived by incorporating Banach fixed point theorem with certain inequality techniques.

On a fixed point theorem and its stochastic equivalent

1975 ◽  
Vol 12 (03) ◽  
pp. 605-611 ◽  
Author(s):  
Joseph A. Yahav
Keyword(s):  
Fixed Point ◽  
Markov Process ◽  
Fixed Point Theorem ◽  
Point Theorem ◽  
Discrete Time ◽  
Sufficient Conditions ◽  
Limiting Distribution

A discrete-time Markov process on the interval [0, 1] is considered. Sufficient conditions for the existence of a unique stationary limiting distribution are given.

scholarly journals On the Fredholm integral equation associated with pairs of dual integral equations

1969 ◽  
Vol 16 (3) ◽  
pp. 185-194 ◽  
Author(s):  
V. Hutson
Keyword(s):  
Integral Equation ◽  
Approximate Solution ◽  
Bessel Function ◽  
Integral Equations ◽  
Fredholm Integral Equation ◽  
Unknown Function ◽  
Sufficient Conditions ◽  
Neumann Series ◽  
Dual Integral Equations ◽  
Image Position

Consider the Fredholm equation of the second kindwhereand Jv is the Bessel function of the first kind. Here ka(t) and h(x) are given, the unknown function is f(x), and the solution is required for large values of the real parameter a. Under reasonable conditions the solution of (1.1) is given by its Neumann series (a set of sufficient conditions on ka(t) for the convergence of this series is given in Section 4, Lemma 2). However, in many applications the convergence of the series becomes too slow as a→∞ for any useful results to be obtained from it, and it may even happen that f(x)→∞ as a→∞. It is the aim of the present investigation to consider this case, and to show how under fairly general conditions on ka(t) an approximate solution may be obtained for large a, the approximation being valid in the norm of L2(0, 1). The exact conditions on ka(t) and the main result are given in Section 4. Roughly, it is required that 1 -ka(at) should behave like tp(p>0) as t→0. For example, ka(at) might be exp ⌈-(t/ap)⌉.

Sign in / Sign up

Export Citation Format

Share Document