Some Algorithms for Finding Fixed Points and Solutions of Variational Inequalities
Jong Soo Jung
Abstract
Open-access reader
Jong Soo Jung
Abstract
Open-access reader
We introduce new implicit and explicit algorithms for finding the fixed point of a k‐strictly pseudocontractive mapping and for solving variational inequalities related to the Lipschitzian and strongly monotone operator in Hilbert spaces. We establish results on the strong convergence of the sequences generated by the proposed algorithms to a fixed point of a k‐strictly pseudocontractive mapping. Such a point is also a solution of a variational inequality defined on the set of fixed points. As direct consequences, we obtain the unique minimum‐norm fixed point of a k‐strictly pseudocontractive mapping.
OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
We introduce new implicit and explicit algorithms for finding the fixed point of a k‐strictly pseudocontractive mapping and for solving variational inequalities related to the Lipschitzian and strongly monotone operator in Hilbert spaces. We establish results on the strong convergence of the sequences generated by the proposed algorithms to a fixed point of a k‐strictly pseudocontractive mapping. Such a point is also a solution of a variational inequality defined on the set of fixed points. As direct consequences, we obtain the unique minimum‐norm fixed point of a k‐strictly pseudocontractive mapping.
Key concepts: Variational inequality, Mathematics, Fixed point, Monotone polygon, Hilbert space, Convergence (economics), Norm (philosophy), Operator (biology)