A projected subgradient algorithm for bilevel equilibrium problems and applications
DOI10.1007/s10957-017-1176-2zbMath1382.65182OpenAlexW2764267352MaRDI QIDQ1686664
Publication date: 15 December 2017
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-017-1176-2
algorithmconvergencestrong monotonicitynumerical experimentssubgradient methodprojection methodbilevel equilibrium problemspseudoparamonotonicity
Numerical mathematical programming methods (65K05) Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Parallel hybrid iterative methods for variational inequalities, equilibrium problems, and common fixed point problems
- Parallel hybrid extragradient methods for pseudomonotone equilibrium problems and nonexpansive mappings
- Fixed point optimization algorithm and its application to power control in CDMA data networks
- An algorithm for a class of split feasibility problems: application to a model in electricity production
- An inexact subgradient algorithm for equilibrium problems
- Application of the proximal point method to nonmonotone equilibrium problems
- Dual extragradient algorithms extended to equilibrium problems
- The interior proximal extragradient method for solving equilibrium problems
- On ergodic algorithms for equilibrium problems
- Parallel algorithms for variational inequalities over the Cartesian product of the intersections of the fixed point sets of nonexpansive mappings
- Projected subgradient techniques and viscosity methods for optimization with variational inequality constraints
- Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization
- Iterative algorithms for finding common solutions of variational inequalities and systems of equilibrium problems and fixed points of families and semigroups of nonexpansive mappings
- Regularization algorithms for solving monotone Ky Fan inequalities with application to a Nash-Cournot equilibrium model
- Foundations of bilevel programming
- Two new splitting algorithms for equilibrium problems
- Projected viscosity subgradient methods for variational inequalities with equilibrium problem constraints in Hilbert spaces
- Modified hybrid projection methods for finding common solutions to variational inequality problems
- An iterative method for finding common solutions of equilibrium and fixed point problems
- A hybrid subgradient algorithm for nonexpansive mappings and equilibrium problems
- Optimization over equilibrium sets∗
- A new iterative algorithm for the variational inequality problem over the fixed point set of a firmly nonexpansive mapping
- A splitting algorithm for a class of bilevel equilibrium problems involving nonexpansive mappings
- A subgradient-type method for the equilibrium problem over the fixed point set and its applications
- A Use of Conjugate Gradient Direction for the Convex Optimization Problem over the Fixed Point Set of a Nonexpansive Mapping
- Convergence of an adaptive penalty scheme for finding constrained equilibria
- Modified Projection-Type Methods for Monotone Variational Inequalities
- Annotated Bibliography on Bilevel Programming and Mathematical Programs with Equilibrium Constraints
- Methods for Variational Inequality Problem Over the Intersection of Fixed Point Sets of Quasi-Nonexpansive Operators
- Bilevel Optimization as a Regularization Approach to Pseudomonotone Equilibrium Problems
- Extragradient algorithms extended to equilibrium problems¶
- Optimality conditions for bilevel programming problems
This page was built for publication: A projected subgradient algorithm for bilevel equilibrium problems and applications