Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Powiadomienia systemowe

Sesja wygasła!
Sesja wygasła!

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: algorytm proksymalny

Sortuj według:

Ogranicz wyniki do:

On solving pseudomonotone equilibrium problems via two new extragradient-type methods under convex constraints

Khunpanuk Chainarong, Pakkaranang Nuttapol, Pholasa Nattawut

Demonstratio Mathematica

2022

Vol. 55, nr 1

297--314

The primary objective of this study is to develop two new proximal-type algorithms for solving equilibrium problems in real Hilbert space. Both new algorithms are analogous to the well-known two-step extragradient algorithm for solving the variational inequality problem in Hilbert spaces. The proposed iterative algorithms use a new step size rule based on local bifunction information instead of the line search technique. Two weak convergence theorems for both algorithms are well-established by letting mild conditions. The main results are used to solve the fixed point and variational inequality problems. Finally, we present several computational experiments to demonstrate the efficiency and effectiveness of the proposed algorithms.

Convergence of Toland's critical points for sequences of D.C. functions and application to the resolution of semilinear elliptic problems

Yassine A., Alaa N., Elhilali Alaoui A.

Control and Cybernetics

2001

Vol. 30, no 4

405-417

We prove that if a sequence (fn)n of D.C. functions (Difference of two Convex functions) converges to a D.C. function f in some appropriate way and if un is a critical point of fn, in the sense described by Toland, and is such that (un)n converges to u, then a is a critical point of f, still in Toland's sense. We also build a new algorithm which searches for this critical point u and then apply it in order to compute the solution of a semilinear elliptic equation.