Levitin-Polyak well-posedness for equilibrium problems with the lexicographic order
type: Item
instance of: scholarly article
title: Levitin-Polyak well-posedness for equilibrium problems with the lexicographic order
zbMATH Open document ID: 1481.90296
author: L. Q. Anh
author: T. Q. Duy
author: Phan Quoc Khanh
published in: Positivity
publication date: 2021-12-01T00:00:00Z
Mathematics Subject Classification ID: 90C31
Mathematics Subject Classification ID: 91B50
zbMATH DE Number: 7436689
zbMATH Keywords: lexicographic equilibrium problem
zbMATH Keywords: optimization problem with lexicographic equilibrium constraints
zbMATH Keywords: Levitin-Polyak well-posedness
zbMATH Keywords: potential game
zbMATH Keywords: nontransitive consumer
MaRDI profile type: Publication
full work available at URL: s11117-021-00818-5
OpenAlex ID: W3130343963
cites work: Tykhonov well-posedness for lexicographic equilibrium problems
cites work: On penalty method for equilibrium problems in lexicographic order
cites work: Continuity properties of solution maps of parametric lexicographic equilibrium problems
cites work: Well-Posedness for Lexicographic Vector Equilibrium Problems
cites work: Lexicographic variational inequalities with applications
cites work: Lexicographic and sequential equilibrium problems
cites work: A note on equilibrium problems with properly quasimonotone bifunctions
cites work: Generalized monotone bifunctions and equilibrium problems
cites work: Uniqueness of Nash equilibrium in continuous two-player weighted potential games
cites work: Extended well-posedness of quasiconvex vector optimization problems
cites work: Conditions ensuring the applicability of cutting-plane methods for solving variational inequalities
cites work: Levitin–Polyak Well-Posedness of Strong Parametric Vector Quasi-equilibrium Problems
cites work: Foundations of bilevel programming
cites work: Well-posedness for equilibrium problems and for optimization problems with equilibrium constraints
cites work: Pointwise well-posedness in set optimization with cone proper sets
cites work: Implicit Functions and Optimization Problems without Continuous Differentiability of the Data
cites work: Characterizations of Levitin–Polyak well-posedness by perturbations for the split variational inequality problem
cites work: Generalized Levitin--Polyak Well-Posedness in Constrained Optimization
cites work: Typical convex program is very well posed
cites work: Vector Optimization
cites work: The concave nontransitive consumer
cites work: Scalarization of Levitin–Polyak well-posed set optimization problems
cites work: Well-posedness for parametric vector equilibrium problems with applications
cites work: On lexicographic vector equilibrium problems
cites work: Duality for equilibrium problems under generalized monotonicity
cites work: On constructing total orders and solving vector optimization problems with total orders
cites work: Levitin-Polyak well-posedness for parametric quasivariational inequality problem of the Minty type
cites work: Levitin-Polyak well-posedness for constrained quasiconvex vector optimization problems
cites work: Q5545684
cites work: Levitin-polyak well-posedness of vector equilibrium problems
cites work: Well-posedness for optimization problems with constraints defined by variational inequalities having a unique solution
cites work: On maximal element theorems, variants of Ekeland's variational principle and their applications
cites work: On cone characterizations of strong and Lexicographic optimality in convex multiobjective optimization
cites work: Q4902563
cites work: Q5852070
cites work: Well-posedness and convexity in vector optimization
cites work: Well-posedness and scalarization in vector optimization
cites work: Potential games
cites work: New results on value functions and applications to MaxSup and MaxInf problems
cites work: Pseudocontinuity in optimization and nonzero-sum games
cites work: Discontinuous but Well‐Posed Optimization Problems
cites work: The Nontransitive Consumer
cites work: On the stability of the functional optimization problem
cites work: On Levitin–Polyak α-well-posedness of perturbed variational-hemivariational inequality
cites work: Levitin-Polyak well-posedness for optimization problems with generalized equilibrium constraints
cites work: Levitin-Polyak well-posedness for lexicographic vector equilibrium problems
cites work: Well-posedness for lexicographic vector quasiequilibrium problems with lexicographic equilibrium constraints
cites work: Well-posedness criteria in optimization with application to the calculus of variations
DOI: 10.1007/S11117-021-00818-5
description: scientific article; zbMATH DE number 7436689