Levitin---Polyak well-posedness of constrained vector optimization problems

Authors:
X. X. Huang;X. Q. Yang
Affiliations:
School of Management, Fudan University, Shanghai, China 200433;Department of Applied Mathematics, The Hong Kong Polytechnic University, Kowloon, Hong Kong
Venue:
Journal of Global Optimization
Year:
2007

Citing 5
Cited 5

Metrically well-set minimization problems

Applied Mathematics and Optimization
Extended well-posedness of optimization problems

Journal of Optimization Theory and Applications
Error bounds in mathematical programming

Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
Extended well-posedness properties of vector optimization problems

Journal of Optimization Theory and Applications
Duality and exact penalization for vector optimization via augmented Lagrangian

Journal of Optimization Theory and Applications

Levitin---Polyak well-posedness of variational inequality problems with functional constraints

Journal of Global Optimization
Metric characterizations of α-well-posedness for symmetric quasi-equilibrium problems

Journal of Global Optimization
Levitin-Polyak well-posedness of generalized vector quasi-equilibrium problems with functional constraints

Journal of Global Optimization
Characterizations of the nonemptiness and compactness for solution sets of convex set-valued optimization problems

Journal of Global Optimization
Levitin---Polyak well-posedness for constrained quasiconvex vector optimization problems

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we consider Levitin---Polyak type well-posedness for a general constrained vector optimization problem. We introduce several types of (generalized) Levitin---Polyak well-posednesses. Criteria and characterizations for these types of well-posednesses are given. Relations among these types of well-posedness are investigated. Finally, we consider convergence of a class of penalty methods under the assumption of a type of generalized Levitin---Polyak well-posedness.