Optimality conditions for strict minimizers of higher-order in semi-infinite multi-objective optimization
From MaRDI portal
Publication:338876
DOI10.1186/s13660-016-1209-7zbMath1348.90587OpenAlexW2537974334WikidataQ59468757 ScholiaQ59468757MaRDI QIDQ338876
Publication date: 7 November 2016
Published in: Journal of Inequalities and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1186/s13660-016-1209-7
multi-objective optimizationoptimality conditionssemi-infinite optimizationstrict minimizer of higher-order
Nonsmooth analysis (49J52) Semi-infinite programming (90C34) Markov and semi-Markov decision processes (90C40)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Density of stable convex semi-infinite vector optimization problems
- Lower semi-continuity of the Pareto solution map in quasiconvex semi-infinite vector optimization
- Stability of semi-infinite vector optimization problems under functional perturbations
- Pseudo-Lipschitz property of linear semi-infinite vector optimization problems
- Sufficient conditions for pseudo-Lipschitz property in convex semi-infinite vector optimization problems
- On constraint qualification in multiobjective optimization problems: Semidifferentiable case
- Constrained qualifications in multiobjective optimization problems: Differentiable case
- Characterizations of strict local minima and necessary conditions for weak sharp minima
- Some exact penalty results for nonlinear programs and mathematical programs with equilibrium constraints
- Nonsmooth semi-infinite multiobjective optimization problems
- Global semiparametric sufficient efficiency conditions for semiinfinite multiobjective fractional programming problems containing generalized \((\alpha, \eta,\rho)\)-V-invex functions
- Lipschitz behavior of solutions to nonconvex semi-infinite vector optimization problems
- Optimality conditions for nonsmooth semi-infinite multiobjective programming
- Optimality and mixed saddle point criteria in multiobjective optimization
- Stability in Mathematical Programming with Nondifferentiable Data
- Optimization and nonsmooth analysis
- Strict efficiency in vector optimization
