Work

A Hybrid Steepest Descent Method for Bilevel Variational Inequality Problems With the Fixed Point Set

Year: 2024

Type: article

Abstract: In this paper, we present a new hybrid steepest decent algorithm to solve the bilevel variational inequality problems, where the feasible set is the intersection of a variational inequality problem and the fixed point set of a nonexpansive mapping in a real Hilbert space. An iterative algorithm is introduced by using the hybrid steepest descent method and fixed-point formulation techniques. The strong convergence of the iterative sequences generated by the algorithm is shown under some suitable assumptions. In addition, the efficiency of our suggested algorithm is established by a numerical example.

Source: Journal of Inequalities and Special Functions

DOI: 10.54379/jiasf-2024-3-1

Authors: TIRTH RAM, MOHD IQBAL, ZEENAT BHAGAT

Institution: University of Jammu

Language: English

Topic: Optimization and Variational Analysis

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: bronze

OpenAlex ID: W4407687758

FWCI:

Cites:

Cited by:

Related to: 10