Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników

Znaleziono wyników: 4

Liczba wyników na stronie
first rewind previous Strona / 1 next fast forward last
Wyniki wyszukiwania
Wyszukiwano:
w słowach kluczowych:  operator pseudo-monotoniczny
help Sortuj według:

help Ogranicz wyniki do:
first rewind previous Strona / 1 next fast forward last
EN
In this article, motivated by the works of Ali Akbar and Elahe Shahrosvand [Split equality common null point problem for Bregman quasi-nonexpansive mappings, Filomat 32 (2018), no. 11, 3917–3932], Eskandani et al. [A hybrid extragradient method for solving pseudomonotone equilibrium problem using Bregman distance, J. Fixed Point Theory Appl. 20 (2018), 132], B. Ali and M. H. Harbau [Convergence theorems for Bregman K-mappings and mixed equilibrium problems in reflexive Banach spaces, J. Funct. Spaces (2016) Article ID 5161682, 18 pages], and some other related results in the literature, we introduce a hybrid extragradient iterative algorithm that employs a Bregman distance approach for approximating a split feasibility problem for a finite family of equilibrium problems involving pseudomonotone bifunctions and fixed point problems for a finite family of Bregman quasi-asymptotically nonexpansive mappings using the concept of Bregman K-mapping in reflexive Banach spaces. Using our iterative algorithm, we state and prove a strong convergence result for approximating a common solution to the aforementioned problems. Furthermore, we give an application of our main result to variational inequalities and also report a numerical example to illustrate the convergence of our method. The result presented in this article extends and complements many related results in the literature.
EN
The purpose of this article is to study and analyse a new extragradient-type algorithm with an inertial extrapolation step for solving split fixed-point problems for demicontractive mapping, equilibrium problem, and pseudomonotone variational inequality problem in real Hilbert spaces. One of the advantages of the proposed algorithm is that a strong convergence result is achieved without a prior estimate of the Lipschitz constant of the cost operator, which is very difficult to find. In addition, the stepsize is generated at each iteration by some simple computations, which allows it to be easily implemented without the prior knowledge of the Lipschitz constant of the cost operator. Some numerical experiments are reported to show the performance and behaviour of the sequence generated by our algorithm. The obtained results in this article extend and improve many related recent results in this direction in the literature.
EN
We consider a Robin problem driven by the p-Laplacian and with a reaction which is gradient dependent (convection). Using truncations and perturbations, we show that the problem has at least one positive smooth solution.
EN
The paper considers some control problems for the systems described by the evolution, as well as the stationary hemivariational inequalities (HVIs for short). First, basing on surjectivity theorems for pseudo-monotone operators we formulate some existence results for the solutions of the HVIs and investigate some properties of the solution set (like sensitivity; i.e. its dependence on data and operators). Next we quote some existence theorems for optimal solutions for various classes of optimal control like distributed control (e.g. Bolza problem), identification of parameters, or optimal shape design for systems described by HVIs. Finally, we discuss some common features in getting the existence of optimal solutions as well as some "well-posedness" problems.
first rewind previous Strona / 1 next fast forward last
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.