Correspondence between a new class of generalized cone convexity and higher order duality
DOI10.1007/s12597-021-00526-4OpenAlexW3167446269MaRDI QIDQ2085466
Mahesh K. Sharma, Arshpreet Kaur
Publication date: 18 October 2022
Published in: Opsearch (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12597-021-00526-4
vector optimization problemsupport functionhigher order dualityhigher order \(K - (C, \alpha, \gamma, \rho, d)\)higher order cone convex function
Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Fractional programming (90C32) Operations research and management science (90Bxx)
Cites Work
- The strong convergence theorems for split common fixed point problem of asymptotically nonexpansive mappings in Hilbert spaces
- Higher-order duality for multiobjective optimization problems containing support functions over cones
- Higher-order duality in vector optimization over cones
- Second- and higher-order duality in nonlinear programming
- Higher-order generalized invexity and duality in nondifferentiable mathematical programming
- Nondifferentiable minimax fractional programming problems with \((C, \alpha, \rho, d)\)-convexity
- On fractional vector optimization over cones with support functions
- Weak minimization and duality
- Second Order Duality in Multiobjective Programming Involving Generalized Type I Functions
- Second-Order Duality for Nondifferentiable Multiobjective Programming Problems
- Optimality conditions and duality for a class of nonlinear fractional programming problems.
This page was built for publication: Correspondence between a new class of generalized cone convexity and higher order duality
