Auxiliary problem principle extended to variational inequalities
Journal of Optimization Theory and Applications
Mathematical Programming: Series A and B
Mathematical Programming: Series A and B
An extended descent framework for variational inequalities
Journal of Optimization Theory and Applications
Unconstrained optimization reformulations of variational inequality problems
Journal of Optimization Theory and Applications
Equilibrium programming using proximal-like algorithms
Mathematical Programming: Series A and B
Iterative solution of nonlinear equations in several variables
Iterative solution of nonlinear equations in several variables
Convex analysis and variational problems
Convex analysis and variational problems
Journal of Global Optimization
Gap functions for a system of generalized vector quasi-equilibrium problems with set-valued mappings
Journal of Global Optimization
SC1 optimization reformulations of the generalized Nash equilibrium problem
Optimization Methods & Software
An algorithm based on the generalized D-gap function for equilibrium problems
Journal of Computational and Applied Mathematics
Computational Optimization and Applications
Metric characterizations of α-well-posedness for symmetric quasi-equilibrium problems
Journal of Global Optimization
Duality and optimality conditions for generalized equilibrium problems involving DC functions
Journal of Global Optimization
Outer approximation algorithms for pseudomonotone equilibrium problems
Computers & Mathematics with Applications
Dual extragradient algorithms extended to equilibrium problems
Journal of Global Optimization
Iterative methods for solving monotone equilibrium problems via dual gap functions
Computational Optimization and Applications
Gap functions and penalization for solving equilibrium problems with nonlinear constraints
Computational Optimization and Applications
Hi-index | 0.00 |
The theory of gap functions, developed in the literature for variational inequalities, is extended to a general equilibrium problem. Descent methods, with exact an inexact line-search rules, are proposed. It is shown that these methods are a generalization of the gap function algorithms for variational inequalities and optimization problems.