Generalized Proximal Distances for Bilevel Equilibrium Problems
From MaRDI portal
Publication:2796800
DOI10.1137/140975589zbMath1333.90134OpenAlexW2308004722MaRDI QIDQ2796800
Antoine Soubeyran, P. A. jun. Soares, João Xavier da Cruz Neto, Jurandir O. Lopes, Glaydston C. Bento
Publication date: 30 March 2016
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://hal-amu.archives-ouvertes.fr/hal-01690192/file/Bento%20et%20al_Generalized%20Proximal%20Distances%20for%20Bilevel%20Equilibrium%20Problems_2016.pdf
Numerical mathematical programming methods (65K05) Iterative procedures involving nonlinear operators (47J25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Cognitive psychology (91E10)
Related Items
A proximal point method for quasi-equilibrium problems in Hilbert spaces ⋮ Levitin-Polyak well-posedness for strong bilevel vector equilibrium problems and applications to traffic network problems with equilibrium constraints ⋮ A generalized proximal linearized algorithm for DC functions with application to the optimal size of the firm problem ⋮ Abstract regularized equilibria: application to Becker's household behavior theory ⋮ Well-posedness for bilevel vector equilibrium problems with variable domination structures ⋮ Ekeland, Takahashi and Caristi principles in preordered quasi-metric spaces ⋮ Unnamed Item ⋮ Noncoercive mixed equilibrium problems under pseudomonotone perturbations and applications to nonlinear evolution equations with lack of coercivity ⋮ Auxiliary principle technique for hierarchical equilibrium problems ⋮ Inexact stochastic subgradient projection method for stochastic equilibrium problems with nonmonotone bifunctions: application to expected risk minimization in machine learning ⋮ New explicit extragradient methods for solving a class of bilevel equilibrium problems ⋮ Extragradient subgradient methods for solving bilevel equilibrium problems ⋮ An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels ⋮ Existence of equilibrium for generalized games in choice form and applications ⋮ New subgradient extragradient methods for solving monotone bilevel equilibrium problems ⋮ Ekeland, Takahashi and Caristi principles in quasi-pseudometric spaces ⋮ Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The existence of solutions and well-posedness for bilevel mixed equilibrium problems in Banach spaces
- On penalty and gap function methods for bilevel equilibrium problems
- Well-posedness under relaxed semicontinuity for bilevel equilibrium and optimization problems with equilibrium constraints
- Auxiliary principle and algorithm for mixed equilibrium problems and bilevel mixed equilibrium problems in Banach spaces
- Is bilevel programming a special case of a mathematical program with complementarity constraints?
- On the convergence of the exponential multiplier method for convex programming
- On a generalized proximal point method for solving equilibrium problems in Banach spaces
- Multiplicative iterative algorithms for convex programming
- On certain conditions for the existence of solutions of equilibrium problems
- Proximal methods for a class of bilevel monotone equilibrium problems
- Multilevel optimization: algorithms and applications
- Equilibrium problems with generalized monotone bifunctions and applications to variational inequalities
- Coercivity conditions for equilibrium problems
- Weak and strong convergence of prox-penalization and splitting algorithms for bilevel equilibrium problems
- VI-constrained hemivariational inequalities: distributed algorithms and power control in ad-hoc networks
- Double-regularization proximal methods, with complementarity applications
- Prox-Penalization and Splitting Methods for Constrained Variational Problems
- Inexact Proximal Point Methods for Variational Inequality Problems
- Coupling Forward-Backward with Penalty Schemes and Parallel Splitting for Constrained Variational Inequalities
- Convergence of an adaptive penalty scheme for finding constrained equilibria
- Entropy-Like Proximal Methods in Convex Programming
- Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
- Proximal Point Algorithm Controlled by a Slowly Vanishing Term: Applications to Hierarchical Minimization
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Convex Analysis
- Mathematical Programs with Optimization Problems in the Constraints
- Dual convergence of the proximal point method with Bregman distances for linear programming
- Mathematical Programs with Equilibrium Constraints
