Abstract
AbstractWithin the inquiry about work, we explore a parametric set-valued optimization problem, where the objective as well as constraint maps are set-valued. A generalization of cone arcwise associated set-valued maps is presented named ρ-cone arcwise connectedness of set-valued maps. We set up adequate Karush–Kuhn–Tucker optimality conditions for the problem beneath contingent epiderivative and ρ-cone arcwise connectedness presumptions. Assist, Mond–Weir, Wolfe, and blended sorts duality models are examined. We demonstrate the related theorems between the primal and the comparing dual problems beneath the presumption.
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics,Analysis
Reference43 articles.
1. Ioffe, A.D., Tihomirov, V.M.: Theory of Extremal Problems. North-Holland, Amsterdam (1979)
2. Khanh, P.Q.: Proper solutions of vector optimization problems. J. Optim. Theory Appl. 74, 105–130 (1992)
3. Khanh, P.Q.: Invex-convexlike functions and duality. J. Optim. Theory Appl. 87, 141–165 (1995)
4. Mishra, S.K., Chakraborty, S.K., Samei, M.E., Ram, B.: q-Polak–Ribiére–Polyak conjugate gradient algorithm for unconstrained optimization problems. J. Inequal. Appl. 2021, 25 (2021). https://doi.org/10.1186/s13660-021-02554-6
5. Rezapour, S., Zakeri, S.H.: Implicit iterative algorithms for α-inverse strongly accretive operators in Banach spaces. J. Nonlinear Convex Anal. 20(8), 1547–1560 (2019)