On the convergence of efficient solutions to semi-infinite set-optimization problems
From MaRDI portal
In this paper, a semi-infinite set optimization problem is studied, regarding the stability of its efficient solutions under perturbations of both objective and constraint maps. First, it is shown that the constraint map is continuous and compact-valued, under suitable assumptions. Then this result is used to study convergence conditions for the semi-infinite problem.
Recommendations
- Stability of efficient solutions for semi-infinite vector optimization problems
- On the stability of solutions for semi-infinite vector optimization problems
- Stability of efficient solutions to set optimization problems
- Stability in unified semi-infinite vector optimization
- On global well-posedness of semi-infinite set optimization problems
Cites work
- A note on semicontinuity of the solution mapping for parametric set optimization problems
- About asymptotic analysis and set optimization
- Application of general semi-infinite programming to lapidary cutting problems
- Bi-level strategies in semi-infinite programming.
- Computing lower bounds on basket option prices by discretizing semi-infinite linear programming
- Continuity of approximate weak efficient solution set map in parametric set optimization
- Continuity of solution maps of parametric quasiequilibrium problems
- Continuity properties of solution maps of parametric lexicographic equilibrium problems
- Convergence of solutions of a set optimization problem in the image space
- Convergence of solutions to set optimization problems with the set less order relation
- Convexity and global well-posedness in set-optimization
- Existence theorems for set optimization problems
- External and internal stability in set optimization
- External and internal stability in set optimization using gamma convergence
- Feasible method for semi-infinite programs
- Generalized semi-infinite programming: a tutorial
- Global optimization of generalized semi-infinite programs using disjunctive programming
- Global solution of semi-infinite programs with existence constraints
- How to solve a semi-infinite optimization problem
- scientific article; zbMATH DE number 1377943 (Why is no real title available?)
- Levitin-Polyak well-posedness for equilibrium problems with the lexicographic order
- Levitin-Polyak well-posedness in set optimization concerning Pareto efficiency
- New order relations in set optimization
- Normal regularity for the feasible set of semi-infinite multiobjective optimization problems with applications
- On duality in multiobjective semi-infinite optimization
- On the solution continuity of parametric set optimization problems
- On the stability of solutions for semi-infinite vector optimization problems
- Painlevé-Kuratowski convergences of the solution sets for vector optimization problems with free disposal sets
- Recent advances in nonconvex semi-infinite programming: applications and algorithms
- Recent contributions to linear semi-infinite optimization: an update
- Regularization of vector equilibrium problems
- Robust efficiency and well-posedness in uncertain vector optimization problems
- Stability and scalarization for a unified vector optimization problem
- Stability of efficient solutions to set optimization problems
- The Tikhonov regularization for vector equilibrium problems
- Tykhonov well-posedness for lexicographic equilibrium problems
- Vector Optimization
- Well-posedness for the optimistic counterpart of uncertain vector optimization problems
Cited in
(2)
This page was built for publication: On the convergence of efficient solutions to semi-infinite set-optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6621978)
