Levitin–Polyak well-posedness of vector equilibrium problems
SJ Li, MH Li - Mathematical Methods of Operations Research, 2009 - Springer
SJ Li, MH Li
Mathematical Methods of Operations Research, 2009•SpringerIn this paper, two types of Levitin–Polyak well-posedness of vector equilibrium problems
with variable domination structures are investigated. Criteria and characterizations for two
types of Levitin–Polyak well-posedness of vector equilibrium problems are shown.
Moreover, by virtue of a gap function for vector equilibrium problems, the equivalent
relations between the Levitin–Polyak well-posedness for an optimization problem and the
Levitin–Polyak well-posedness for a vector equilibrium problem are obtained.
with variable domination structures are investigated. Criteria and characterizations for two
types of Levitin–Polyak well-posedness of vector equilibrium problems are shown.
Moreover, by virtue of a gap function for vector equilibrium problems, the equivalent
relations between the Levitin–Polyak well-posedness for an optimization problem and the
Levitin–Polyak well-posedness for a vector equilibrium problem are obtained.
Abstract
In this paper, two types of Levitin–Polyak well-posedness of vector equilibrium problems with variable domination structures are investigated. Criteria and characterizations for two types of Levitin–Polyak well-posedness of vector equilibrium problems are shown. Moreover, by virtue of a gap function for vector equilibrium problems, the equivalent relations between the Levitin–Polyak well-posedness for an optimization problem and the Levitin–Polyak well-posedness for a vector equilibrium problem are obtained.
Springer
以上显示的是最相近的搜索结果。 查看全部搜索结果