Recent Developments on Fixed Point Theory in Function Spaces and Applications to Control and Optimization Problems
Pourquoi ce travail est dans la base
Une base qui oublie comment elle a trouvé un travail ne peut pas être vérifiée. Voici les voies qui ont admis celui-ci.
Notice bibliographique
Résumé
Nonlinear and Convex Analysis have as one of their goals solving equilibrium problems arising in applied sciences. In fact, a lot of these problems can be modelled in an abstract form of an equation (algebraic, functional, differential, integral, etc.), and this can be further transferred into a form of a fixed point problem of a certain operator. In this context, finding solutions of fixed point problems, or at least proving that such solutions exist and can be approximately computed, is a very interesting area of research. The Banach Contraction Principle is one of the cornerstones in the development of Nonlinear Analysis, in general, and metric fixed point theory, in particular. This principle was extended and improved in many directions and various fixed point theorems were established. Two usual ways for extending and improving the Banach Contraction Principle are obtained by (1) changing the contraction condition to more general ones and (2) replacing the complete metric space by certain generalized metric spaces. In this special issue we focused on applications in the area of nonlinear functional analysis, in particular to control and optimization problems. We received submissions devoted to the study of fixed points and fixed point spaces with applications; fractional evolution equations with applications; operator equations; best approximation theorems in abstract spaces; convergence and stability of iteration procedures; semilinear control problems. Now, we are going to describe briefly the papers published in the special issue. B. Alamri et al. discussed the completeness of ]- generalized metric spaces in the sense of Branciari. Also, they generalized Subrahmanyam’s and Caristi’s fixed point theorems. N. I. Mahmudov and M. A. McKibben studied the approximate controllability of fractional evolution equations involving generalized Riemann-Liouville fractional derivative. To obtain their results, the authors used the theory of fractional calculus, semigroup theory, and the Schauder fixed point theorem under the assumption that the corresponding linear system is approximately controllable. M. A. Kutbi et al. introduced new concepts of -GF-contractive non-self-mapping, weak -GF-contractive non-self-mapping, generalized -GF-contractive non-selfmapping, and Suzuki typeGF-contractions.Then, they established the existence of PPF dependent fixed point theorems for such kind of contractive non-self-mappings in the Razumikhin class. They used these results to deduce some PPF dependent fixed point theorems for GF-contractive non-selfmappings, whenever the range space is endowed with a graph or a partial order. M. De la Sen and E. Karapınar discussed the properties of convergence of distances of -cyclic contractions on the union of the subsets of an abstract set defining probabilistic metric spaces and Menger probabilistic metric spaces as well as the characterization of Cauchy sequences which converge to best proximity points. The existence and uniqueness of fixed points and best proximity points of -cyclic contractions, defined in induced complete Menger probabilistic metric spaces, are also discussed in the case that the associate complete metric space is a uniformly convex Banach space. Finally, the fixed points of the -composite mappings restricted to each of the subsets in the cyclic framework disposal are investigated. K. Wongkum et al. worked on the generalized UlamHyers-Rassias stability of a quadratic functional equation, by using methods of fixed point theory in the framework of modular spaces whose modulars are lower semicontinuous but do not satisfy any relatives of Δ2-conditions. We hope that the results contained in this special issue will create the inspiration for researchers working in fixed point theory and its applications to differential, integral, and functional equations.
Récupéré en direct depuis OpenAlex et désinversé. Les résumés ne sont pas conservés dans cette base de données : les index inversés représentent 8,6 Go des 9,3 Go de texte de la base, et le serveur dispose de 13 Go libres.
Prédiction distillée sur la base complète
Imitation des enseignantsNi prévalence calibrée, ni vérité terrain. Validation humaine à venir. Apprise à partir de 10 348 étiquettes directes de Codex et de 10 348 étiquettes directes de Gemma. Le mode candidate est l'union des têtes enseignantes seuillées; le consensus est leur intersection. Ces sorties portent le statut machine_predicted_unvalidated et ne sont ni des étiquettes humaines ni des étiquettes directes de modèles de pointe.
Scores Codex et Gemma par catégorie
| Catégorie | Codex | Gemma |
|---|---|---|
| Métarecherche | 0,002 | 0,001 |
| Méta-épidémiologie (sens strict) | 0,000 | 0,000 |
| Méta-épidémiologie (sens large) | 0,000 | 0,000 |
| Bibliométrie | 0,000 | 0,000 |
| Études des sciences et des technologies | 0,000 | 0,000 |
| Communication savante | 0,000 | 0,000 |
| Science ouverte | 0,000 | 0,000 |
| Intégrité de la recherche | 0,000 | 0,000 |
| Charge utile insuffisante (le modèle a refusé de juger) | 0,000 | 0,000 |
Scores machine (provisoires)
Les deux têtes enseignantes du modèle étudiant, lues sur ce travail. Un score ordonne la base pour la relecture; il n'affirme jamais une catégorie, et le statut de validation accompagne chaque rangée tel quel.
Scores de référence d'un modèle non mature (critères de maturité non atteints, 7 itérations). Un score ordonne; il n'affirme jamais une catégorie.
score_only:v0-immature-baseline · tel quel depuis la passe de notation : score_only signifie que le nombre peut ordonner les travaux, et qu'aucune étiquette de catégorie n'en découle