Sci Math | A projection algorithm for solving pseudomonotone equilibrium problems and its application to a class of bilevel equilibria

Sci Math

Article Contents

1. Titles

2. Authors

A projection algorithm for solving pseudomonotone equilibrium problems and its application to a class of bilevel equilibria

Authors: Lê Dũng Mưu, Bùi Văn Định,

https://doi.org/10.1080/02331934.2013.773329

Publisher, magazine: ,

Publication year: 2015

Lưu Trích dẫn

Abstract

We propose a projection algorithm for solving an equilibrium problem (EP) where the bifunction is pseudomonotone with respect to its solution set. The algorithm is further combined with a cutting technique for minimizing the norm over the solution set of an EP whose bifunction is pseudomonotone with respect to the solution set.

Tags: pseudomonotone equilibria, Ky Fan inequality, auxiliary subproblem principle, projection method, Armijo linesearch, bilevel equilibria

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