Levitin-Polyak well-posedness for equilibrium problems with the lexicographic order
From MaRDI portal
Publication:2055385
DOI10.1007/s11117-021-00818-5zbMath1481.90296OpenAlexW3130343963MaRDI QIDQ2055385
T. Q. Duy, Phan Quoc Khanh, Lam Quoc Anh
Publication date: 1 December 2021
Published in: Positivity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11117-021-00818-5
nontransitive consumerpotential gameLevitin-Polyak well-posednesslexicographic equilibrium problemoptimization problem with lexicographic equilibrium constraints
Related Items (4)
Levitin-Polyak well-posedness for vector optimization problems in linear spaces ⋮ Robust efficiency and well-posedness in uncertain vector optimization problems ⋮ Existence and well-posedness for excess demand equilibrium problems ⋮ Regularization of vector equilibrium problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Continuity properties of solution maps of parametric lexicographic equilibrium problems
- Well-posedness for lexicographic vector quasiequilibrium problems with lexicographic equilibrium constraints
- Levitin-Polyak well-posedness for parametric quasivariational inequality problem of the Minty type
- Pointwise well-posedness in set optimization with cone proper sets
- Levitin-Polyak well-posedness for optimization problems with generalized equilibrium constraints
- On constructing total orders and solving vector optimization problems with total orders
- On lexicographic vector equilibrium problems
- On cone characterizations of strong and Lexicographic optimality in convex multiobjective optimization
- Well-posedness and scalarization in vector optimization
- Lexicographic and sequential equilibrium problems
- Well-posedness for parametric vector equilibrium problems with applications
- Levitin-polyak well-posedness of vector equilibrium problems
- Extended well-posedness of quasiconvex vector optimization problems
- Well-posedness for equilibrium problems and for optimization problems with equilibrium constraints
- Pseudocontinuity in optimization and nonzero-sum games
- Duality for equilibrium problems under generalized monotonicity
- Well-posedness for optimization problems with constraints defined by variational inequalities having a unique solution
- Conditions ensuring the applicability of cutting-plane methods for solving variational inequalities
- Foundations of bilevel programming
- Uniqueness of Nash equilibrium in continuous two-player weighted potential games
- On penalty method for equilibrium problems in lexicographic order
- New results on value functions and applications to MaxSup and MaxInf problems
- Potential games
- Well-posedness and convexity in vector optimization
- Levitin-Polyak well-posedness for constrained quasiconvex vector optimization problems
- On maximal element theorems, variants of Ekeland's variational principle and their applications
- Generalized monotone bifunctions and equilibrium problems
- Typical convex program is very well posed
- Characterizations of Levitin–Polyak well-posedness by perturbations for the split variational inequality problem
- Tykhonov well-posedness for lexicographic equilibrium problems
- Scalarization of Levitin–Polyak well-posed set optimization problems
- Vector Optimization
- The Nontransitive Consumer
- Levitin-Polyak well-posedness for lexicographic vector equilibrium problems
- Well-posedness criteria in optimization with application to the calculus of variations
- On Levitin–Polyak α-well-posedness of perturbed variational-hemivariational inequality
- Levitin–Polyak Well-Posedness of Strong Parametric Vector Quasi-equilibrium Problems
- Lexicographic variational inequalities with applications
- Generalized Levitin--Polyak Well-Posedness in Constrained Optimization
- On the stability of the functional optimization problem
- Implicit Functions and Optimization Problems without Continuous Differentiability of the Data
- Well-Posedness for Lexicographic Vector Equilibrium Problems
- Discontinuous but Well‐Posed Optimization Problems
- A note on equilibrium problems with properly quasimonotone bifunctions
- The concave nontransitive consumer
This page was built for publication: Levitin-Polyak well-posedness for equilibrium problems with the lexicographic order
