Optimality conditions and duality analysis via generalized subdifferentials for \(\epsilon\)-quasi solutions of vector optimization problems
DOI10.1007/S40314-024-02830-3MaRDI QIDQ6576415
Publication date: 22 July 2024
Published in: Computational and Applied Mathematics (Search for Journal in Brave)
regularity conditionsgeneralized subdifferentialsKKT-type optimality conditions\(\epsilon\)-pseudoconvexity\(\epsilon\)-quasi efficient solutionsconstrained vector optimization problems
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Nonsmooth analysis (49J52) General equilibrium theory (91B50)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Necessary and sufficient optimality conditions for constrained vector equilibrium problems using contingent hypoderivatives
- About contingent epiderivatives
- Higher-order weakly generalized adjacent epiderivatives and applications to duality of set-valued optimization
- A generalized derivative for calm and stable functions
- A finite dimensional extension of Lyusternik theorem with applications to multiobjective optimization
- Optimality and duality in constrained interval-valued optimization
- Necessary conditions for weak minima and for strict minima of order two in nonsmooth constrained multiobjective optimization
- Necessary conditions for weak efficiency for nonsmooth degenerate multiobjective optimization problems
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
- Optimality conditions for \(\epsilon \)-quasi solutions of optimization problems via \(\epsilon \)-upper convexificators with applications
- Efficient solutions and optimality conditions for vector equilibrium problems
- Variational characterization of the contingent epiderivative
- Optimality and duality for nonsmooth mathematical programming problems with equilibrium constraints
- Optimality conditions and duality for nonsmooth vector equilibrium problems with constraints
- Necessary conditions for efficiency in terms of the Michel–Penot subdifferentials
- First order optimality conditions in vector optimization involving stable functions
- Optimization and nonsmooth analysis
- A duality theorem for non-linear programming
- On generalised convex nonsmooth functions
- Optimality conditions for mildly nonsmooth constrained optimization
- First-order necessary conditions in locally Lipschitz multiobjective optimization
- Convex Analysis
- Set-valued analysis
- Characterizations of nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications
- Robust optimality conditions and duality for nonsmooth multiobjective fractional semi-infinite programming problems with uncertain data
This page was built for publication: Optimality conditions and duality analysis via generalized subdifferentials for \(\epsilon\)-quasi solutions of vector optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6576415)
