Optimality conditions and duality analysis via generalized subdifferentials for -quasi solutions of vector optimization problems
From MaRDI portal
Publication:6576415
Recommendations
- Optimality conditions for \(\epsilon \)-quasi solutions of optimization problems via \(\epsilon \)-upper convexificators with applications
- Optimality and duality in nondifferentiable minimax programming problems involving \(\epsilon\)-quasi solutions
- Optimality Conditions for Weakly ϵ-Efficient Solutions of Vector Optimization Problems with Applications
- Optimality analysis for \(\epsilon\)-quasi solutions of optimization problems via \(\epsilon\)-upper convexificators: a dual approach
- Optimality conditions and duality theorems for \(\varepsilon\)-quasi weakly efficient solutions in semi-convex multi-objective optimization problems
Cites work
- scientific article; zbMATH DE number 3856842 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- A duality theorem for non-linear programming
- A finite dimensional extension of Lyusternik theorem with applications to multiobjective optimization
- A generalized derivative for calm and stable functions
- About contingent epiderivatives
- Approximate quasi efficient solutions in multiobjective optimization
- Characterizations of nonemptiness and compactness of the set of weakly efficient solutions for convex vector optimization and applications
- Convex Analysis
- Efficient solutions and optimality conditions for vector equilibrium problems
- First order optimality conditions in vector optimization involving stable functions
- First-order necessary conditions in locally Lipschitz multiobjective optimization
- Higher-order weakly generalized adjacent epiderivatives and applications to duality of set-valued optimization
- Necessary and sufficient optimality conditions for constrained vector equilibrium problems using contingent hypoderivatives
- Necessary conditions for efficiency in terms of the Michel--Penot subdifferentials
- Necessary conditions for weak efficiency for nonsmooth degenerate multiobjective optimization problems
- Necessary conditions for weak minima and for strict minima of order two in nonsmooth constrained multiobjective optimization
- On generalised convex nonsmooth functions
- Optimality and duality for nonsmooth mathematical programming problems with equilibrium constraints
- Optimality and duality in constrained interval-valued optimization
- Optimality conditions and duality for nonsmooth vector equilibrium problems with constraints
- Optimality conditions for \(\epsilon \)-quasi solutions of optimization problems via \(\epsilon \)-upper convexificators with applications
- Optimality conditions for mildly nonsmooth constrained optimization
- Optimization and nonsmooth analysis
- Robust optimality conditions and duality for nonsmooth multiobjective fractional semi-infinite programming problems with uncertain data
- Set-valued analysis
- Variational characterization of the contingent epiderivative
- \(\epsilon\)-duality of nondifferentiable nonconvex multiobjective programming
Cited in
(2)
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)
