Second-order efficiency conditions for $C^{1,1}$-vector equilibrium problems in terms of contingent derivatives and applications
From MaRDI portal
Publication:5244152
DOI10.23952/jnva.3.2019.3.07zbMath1425.90108OpenAlexW4245455937MaRDI QIDQ5244152
Publication date: 20 November 2019
Published in: Journal of Nonlinear and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.23952/jnva.3.2019.3.07
constraint qualificationsecond-order optimality conditionsvector equilibrium problemsecond-order contingent derivatives
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52)
Related Items
Higher-order efficiency conditions for constrained vector equilibrium problems ⋮ Unnamed Item ⋮ Studniarski's derivatives and efficiency conditions for constrained vector equilibrium problems with applications ⋮ Optimality conditions and duality in terms of convexificators for multiobjective bilevel programming problem with equilibrium constraints ⋮ Second-order optimality conditions for efficiency in \(C^{1,1}\)-smooth quasiconvex multiobjective programming problem
Cites Work
- Metric regularity, tangent sets, and second-order optimality conditions
- On second-order Fritz John type optimality conditions in nonsmooth multiobjective programming
- Second-order optimality conditions with the envelope-like effect for set-valued optimization
- First and second order sufficient conditions for strict minimality in nonsmooth vector optimization.
- Optimality conditions for \(C^{1,1}\) constrained multiobjective problems
- Second order necessary conditions in set constrained differentiable vector optimization
- Second-order necessary efficiency conditions for nonsmooth vector equilibrium problems
- First order optimality conditions in vector optimization involving stable functions
- Higher-order necessary and sufficient conditions for strict local pareto minima in terms of Studniarski's derivatives
- On second-order sufficient optimality conditions for c 1,1-optimization problems
- Second-Order Conditions for Optimization Problems with Constraints
- On the notion of tangent cone in mathematical programming
- Higher-order optimality conditions for a minimax
- Taylor’s Formula for $C^{k,1} $ Functions
- Set-valued analysis
- Optimality conditions for \(C^{1,1}\) vector optimization problems
