Optimality and duality theorems in nonsmooth multiobjective optimization
From MaRDI portal
Recommendations
- Optimality and duality for nonsmooth multiobjective optimization problems
- Sufficient optimality conditions and duality for nonsmooth multiobjective optimization problems via higher order strong convexity
- Optimality conditions and duality in nonsmooth multiobjective optimization
- Optimality conditions and duality in nonsmooth multiobjective programs
- Optimality and duality for a class of nonsmooth optimization problems
Cites work
- scientific article; zbMATH DE number 4010155 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- Characterizations of strict local minima and necessary conditions for weak sharp minima
- Efficiency and generalized convex duality for nondifferentiable multiobjective programs
- FIRST AND SECOND ORDER SUFFICIENT CONDITIONS FOR STRICT MINIMALITY IN MULTIOBJECTIVE PROGRAMMING
- First and second order sufficient conditions for strict minimality in nonsmooth vector optimization.
- Generalizations of the Nash equilibrium theorem in the KKM theory
- Generalized equilibrium problems and generalized complementarity problems
- Necessary and Sufficient Conditions for Isolated Local Minima of Nonsmooth Functions
- Optimality and mixed saddle point criteria in multiobjective optimization
- Optimality conditions and duality for a class of nondifferentiable multiobjective programming problems
- Optimality conditions and duality in nonsmooth multiobjective programs
- Optimization and nonsmooth analysis
- Regularity Conditions and Optimality in Vector Optimization
- Remarks on equilibria for \(g\)-monotone maps on generalized convex spaces
- Some exact penalty results for nonlinear programs and mathematical programs with equilibrium constraints
- Stability in Mathematical Programming with Nondifferentiable Data
- Strict efficiency in vector optimization
- Strong and Weak Convexity of Sets and Functions
Cited in
(11)- Optimality conditions and duality theorems for non-Lipschitz optimization problems
- Sufficiency and duality in nondifferentiable multiobjective programming involving higher order strong invexity
- scientific article; zbMATH DE number 1159218 (Why is no real title available?)
- scientific article; zbMATH DE number 1159287 (Why is no real title available?)
- A finite dimensional extension of Lyusternik theorem with applications to multiobjective optimization
- Asymptotic sign-solvability, multiple objective linear programming, and the nonsubstitution theorem
- Optimality and duality for a class of nonsmooth optimization problems
- Optimality and duality for nonsmooth multiobjective optimization problems
- Multiobjective program with support functions under \((G,C,\rho)\)-convexity assumptions
- Correction: Optimality and duality theorems in nonsmooth multiobjective optimization
- Sufficient optimality conditions and duality for nonsmooth multiobjective optimization problems via higher order strong convexity
This page was built for publication: Optimality and duality theorems in nonsmooth multiobjective optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q362418)