Sufficient optimality conditions and duality for nonsmooth multiobjective optimization problems via higher order strong convexity
DOI10.2298/YJOR170119013UzbMath1474.90426OpenAlexW2622946608MaRDI QIDQ4987692
B. B. Upadhyay, N. Priyobarta, Yumnam Rohen
Publication date: 3 May 2021
Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/yjor170119013u
optimality conditionssupport functionsmixed dualitynonsmooth multiobjective programmingstrict minimizers
Multi-objective and goal programming (90C29) Optimality conditions and duality in mathematical programming (90C46) Duality theory (optimization) (49N15)
Related Items (1)
Cites Work
- Unnamed Item
- Optimality and duality theorems in nonsmooth multiobjective optimization
- Some relations between vector variational inequality problems and nonsmooth vector optimization problems using quasi efficiency
- Generalized convexity and vector optimization.
- Efficiency and generalized convex duality for nondifferentiable multiobjective programs
- Optimality conditions and duality in nonsmooth multiobjective programs
- Strong uniqueness: A far-reaching criterion for the convergence analysis of iterative procedures
- Characterizations of strict local minima and necessary conditions for weak sharp minima
- First and second order sufficient conditions for strict minimality in nonsmooth vector optimization.
- Some exact penalty results for nonlinear programs and mathematical programs with equilibrium constraints
- Seven kinds of monotone maps
- Duality for a class of nondifferentiable multiobjective programming problems
- Lagrange multiplier characterizations of solution sets of constrained nonsmooth pseudolinear optimization problems
- Optimality conditions and duality for a class of nondifferentiable multiobjective programming problems
- On the differentiability of the support function
- V-invex functions and vector optimization.
- Optimality and mixed saddle point criteria in multiobjective optimization
- Efficiency and duality in nonsmooth multiobjective fractional programming involving η-pseudolinear functions
- Characterizations of the Solution Sets and Sufficient Optimality Criteria via Higher-Order Strong Convexity
- FIRST AND SECOND ORDER SUFFICIENT CONDITIONS FOR STRICT MINIMALITY IN MULTIOBJECTIVE PROGRAMMING
- Approximate Subdifferentials and Applications. I: The Finite Dimensional Theory
- Stability in Mathematical Programming with Nondifferentiable Data
- Optimization and nonsmooth analysis
- Necessary and Sufficient Conditions for Isolated Local Minima of Nonsmooth Functions
- Regularity Conditions and Optimality in Vector Optimization
- Non differentiable symmetric duality
- Nonsmooth minimax fractional programming involvingη-pseudolinear functions
- Convex Analysis
- Strict efficiency in vector optimization
This page was built for publication: Sufficient optimality conditions and duality for nonsmooth multiobjective optimization problems via higher order strong convexity
