Optimization · 2013 · 10 citations · 16 references
ComputingComputer ScienceAlgorithmsComputational GeometryOptimizationConvergence AnalysisConvex AnalysisConvex OptimizationNonlinear ProgrammingOptimization TheoryQuasiconvex Functions
In this paper, we discuss the stability of the sets of (weak) minimal points and (weak) efficient points of vector optimization problems. Assuming that the objective functions are (strictly) properly quasi convex, and the data ofthe approximate problems converges to the data of the original problems in the sense of Painlevé–Kuratowski, we establish the Painlevé–Kuratowski set convergence of the sets of (weak) minimal points and (weak) efficient points of the approximate problems to the corresponding ones of original problem. Our main results improve and extend the results of the recent papers.
16
Stability for convex vector optimization problems
Roberto Lucchetti, Enrico Miglierina · Optimization · 2004 · 69 citations