Sufficient optimality conditions and duality for nonsmooth multiobjective optimization problems via higher order strong convexity
From MaRDI portal
Publication:4987692
Recommendations
- Optimality and duality theorems in nonsmooth multiobjective optimization
- Optimality and duality for nonsmooth multiobjective optimization problems
- scientific article; zbMATH DE number 5150864
- Optimality conditions and duality in nonsmooth multiobjective optimization
- Sufficiency and duality in nonsmooth multiobjective optimization involving generalized \((F,\alpha,\rho,d)\)-type I functions
Cites work
- scientific article; zbMATH DE number 3905307 (Why is no real title available?)
- Approximate Subdifferentials and Applications. I: The Finite Dimensional Theory
- Characterizations of strict local minima and necessary conditions for weak sharp minima
- Characterizations of the solution sets and sufficient optimality criteria via higher-order strong convexity
- Convex Analysis
- Duality for a class of nondifferentiable multiobjective programming problems
- Efficiency and duality in nonsmooth multiobjective fractional programming involving -pseudolinear functions
- 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.
- Generalized convexity and vector optimization.
- Lagrange multiplier characterizations of solution sets of constrained nonsmooth pseudolinear optimization problems
- Necessary and Sufficient Conditions for Isolated Local Minima of Nonsmooth Functions
- Non differentiable symmetric duality
- Nonsmooth minimax fractional programming involving {\(\eta\)}-pseudolinear functions
- On the differentiability of the support function
- Optimality and duality theorems in nonsmooth multiobjective optimization
- 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
- Seven kinds of monotone maps
- Some exact penalty results for nonlinear programs and mathematical programs with equilibrium constraints
- Some relations between vector variational inequality problems and nonsmooth vector optimization problems using quasi efficiency
- Stability in Mathematical Programming with Nondifferentiable Data
- Strict efficiency in vector optimization
- Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
- V-invex functions and vector optimization.
Cited in
(9)- Optimality and duality theorems in nonsmooth multiobjective optimization
- Strict global minimizers and higher-order generalized strong invexity in multiobjective optimization
- scientific article; zbMATH DE number 5150864 (Why is no real title available?)
- Higher order strong convexity and global strict minimizers in multiobjective optimization
- Optimality and duality in multiobjective programming involving higher order semilocally strong convexity
- Optimality and duality for nonsmooth multiobjective optimization problems
- scientific article; zbMATH DE number 5878887 (Why is no real title available?)
- Characterizations of the solution sets and sufficient optimality criteria via higher-order strong convexity
- Higher-order duality results for a new class of nonconvex nonsmooth multiobjective programming problems
This page was built for publication: Sufficient optimality conditions and duality for nonsmooth multiobjective optimization problems via higher order strong convexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4987692)
