Levitin-Polyak well-posedness for lexicographic vector equilibrium problems
From MaRDI portal
Publication:4631855
DOI10.22436/jnsa.010.02.02zbMath1413.90294OpenAlexW2585990031MaRDI QIDQ4631855
Thanatporn Bantaojai, Rabian Wangkeeree
Publication date: 23 April 2019
Published in: The Journal of Nonlinear Sciences and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.22436/jnsa.010.02.02
Sensitivity, stability, well-posedness (49K40) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Levitin-Polyak well-posedness for parametric quasivariational inequality problem of the Minty type
- Well-posedness under relaxed semicontinuity for bilevel equilibrium and optimization problems with equilibrium constraints
- Levitin-Polyak well-posedness of generalized vector quasi-equilibrium problems with functional constraints
- On constructing total orders and solving vector optimization problems with total orders
- Existence of solutions of generalized vector equilibrium problems in reflexive Banach spaces
- Generalized extensive measurement for lexicographic orders
- Existence of solutions to some equilibrium problems
- Descent methods for monotone equilibrium problems in Banach spaces
- Well-posed Ky Fan's point, quasi-variational inequality and Nash equilibrium problems
- Well-posedness of mixed variational inequalities, inclusion problems and fixed point problems
- Levitin-Polyak well-posedness for equilibrium problems with functional constraints
- Existence of solutions to general quasiequilibrium problems and applications
- Well-posedness for mixed quasivariational-like inequalities
- Lexicographic and sequential equilibrium problems
- Well posedness in vector optimization problems and vector variational inequalities
- Well-posedness for parametric vector equilibrium problems with applications
- Levitin-polyak well-posedness of vector equilibrium problems
- Well-posedness for equilibrium problems and for optimization problems with equilibrium constraints
- \(\epsilon\)-solutions in vector minimization problems
- Pseudocontinuity in optimization and nonzero-sum games
- Levitin-Polyak well-posedness by perturbations for systems of set-valued vector quasi-equilibrium problems
- Lexicographically-ordered constraint satisfaction problems
- Generalized Levitin-Polyak well-posedness of vector equilibrium problems
- Well-posedness for vector quasiequilibria
- Well-posedness and \(L\)-well-posedness for quasivariational inequalities
- Existence Theorems for Generalized Noncoercive Equilibrium Problems: The Quasi-Convex Case
- A characterization of tyhonov well-posedness for minimum problems, with applications to variational inequalities(∗)
- Constrained convex optimization problems-well-posedness and stability*
- Hadamard and Strong Well-Posedness for Convex Programs
- A New Approach To Tikhonov Well-Posedness For Nash Equilibria∗
- Well-posedness criteria in optimization with application to the calculus of variations
- Lexicographic variational inequalities with applications
- On the stability of the functional optimization problem
- Almost Every Convex or Quadratic Programming Problem Is Well Posed
- Well-Posedness for Lexicographic Vector Equilibrium Problems
- Set-valued analysis
- Well-posedness and optimization under perturbations
This page was built for publication: Levitin-Polyak well-posedness for lexicographic vector equilibrium problems
