logo-site
Sci Math

Article Contents

1. Titles

2. Authors

3. DOI

4. Publisher

5. Publication year

6. Abstract

A projection-fixed point method for a class of bilevel variational inequalities with split fixed point constraints

Authors: Lê Dũng Mưu, Tran Viet Anh,

https://doi.org/10.1080/02331934.2015.1101599

Publisher, magazine: ,

Publication year: 2016

  Lưu        Trích dẫn         Chia sẻ

Abstract

We propose a method for solving bilevel split variational inequalities involving strongly monotone operators in the leader problems and nonexpansive mappings in the follower ones. The proposed method is a combination between the projection method for variational inequality and the Krasnoselskii–Mann scheme for fixed points of nonexpansive mappings. Strong convergence of the iterative process is proved. Special cases are considered.

Tags: split feasibility problem, bilevel variational inequality, Krasnoselskii–Mann scheme, projection method, nonexpansive mapping

Trở lại

Các bài viết liên quan đến tác giả Lê Dũng Mưu

Coupling the Banach contraction mapping principle and the proximal point algorithm for solving monotone variational inequalities

Implementable quadratic regularization methods for solving pseudomonotone equilibrium prob\-lems.

Bilinear programming approach to optimization over the efficient set of a vector affine fractional problem

On the construction of initial polyhedral convex set for optimization problems over the efficient set and bilevel linear programs

Biconvex programming approach to optimization over the weakly efficient set of a multiple objective affine fractional problem

Using the Banach contraction principle to implement the proximal point method for multivalued monotone variational inequalities

Lagrangian duality algorithms for finding a global optimal solution to mathematical programs with affine equilibrium constraints

A convex-concave programming method for optimizing over the efficient set

Simplicially-constrained DC optimization over efficient and weakly efficient sets

Branch-and-bound variant of an outcome-based algorithm for optimizing over the efficient set of a bicriteria linear programming problem