Sufficient conditions for pseudo-Lipschitz property in convex semi-infinite vector optimization problems
From MaRDI portal
Publication:1044514
DOI10.1016/j.na.2009.06.038zbMath1188.49022OpenAlexW2064106379MaRDI QIDQ1044514
Jen-Chih Yao, Thai Doan Chuong
Publication date: 18 December 2009
Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.na.2009.06.038
Slater conditionefficient solution mapfunctional perturbationsconvex semi-infinite vector optimizationpseudo-Lipschitz
Sensitivity, stability, well-posedness (49K40) Multi-objective and goal programming (90C29) Sensitivity, stability, parametric optimization (90C31) Applications of functional analysis in optimization, convex analysis, mathematical programming, economics (46N10) Optimality conditions for free problems in two or more independent variables (49K10)
Related Items
Solving vector interval-valued optimization problems with infinite interval constraints via integral-type penalty function, Optimality conditions for strict minimizers of higher-order in semi-infinite multi-objective optimization, Lipschitz behavior of solutions to nonconvex semi-infinite vector optimization problems, Normal subdifferentials of efficient point multifunctions in parametric vector optimization, Stability analysis for vector quasiequilibrium problems, Clarke coderivatives of efficient point multifunctions in parametric vector optimization, Fréchet subdifferentials of efficient point multifunctions in parametric vector optimization, Necessary conditions for nonsmooth multiobjective semi-infinite problems using Michel-penot subdifferential, Stability of semi-infinite vector optimization problems without compact constraints, Derivatives of the efficient point multifunction in parametric vector optimization problems, Lipschitz-like property of an implicit multifunction and its applications, Optimality conditions for nonsmooth semi-infinite multiobjective programming, Isolated and proper efficiencies in semi-infinite vector optimization problems, Calmness of efficient solution maps in parametric vector optimization, Lower semi-continuity of the Pareto solution map in quasiconvex semi-infinite vector optimization, On strong KKT optimality conditions for multiobjective semi-infinite programming problems with Lipschitzian data, Nonsmooth semi-infinite multiobjective optimization problems, Generalized Clarke epiderivatives of parametric vector optimization problems, Semicontinuity and convergence for vector optimization problems with approximate equilibrium constraints, Sensitivity Analysis for Vector Equilibrium Problems under Functional Perturbations, Lower semicontinuity of the efficient solution mapping in semi-infinite vector optimization
Cites Work
- Sensitivity analysis in linear semi-infinite programming: perturbing cost and right-hand-side coefficients
- Sufficient conditions for total ill-posedness in linear semi-infinite optimization
- On the Lipschitz modulus of the argmin mapping in linear semi-infinite optimization
- Stability of semi-infinite vector optimization problems under functional perturbations
- Stability in multicriteria optimization
- Semi-infinite quadratic programming
- Convex vector functions and their subdifferential
- Kuratowksi convergence of the efficient sets in the parametric linear vector semi-infinite optimization
- Lipschitz-continuity of Pareto-optimal extreme points
- Unicity results for general linear semi-infinite optimization problems using a new concept of active constraints
- Recent contributions to linear semi-infinite optimization
- Metric regularity of semi-infinite constraint systems
- Parametric semi-infinite linear programming I. continuity of the feasible set and of the optimal value
- Metric Regularity in Convex Semi-Infinite Optimization under Canonical Perturbations
- Continuity properties in semi-infinite parametric linear optimization
- Stability and Well-Posedness in Linear Semi-Infinite Programming
- Lipschitz Continuity of the Optimal Value via Bounds on the Optimal Set in Linear Semi-Infinite Optimization
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
