Optimality conditions for quasiconvex programming in terms of quasiconjugate functions
Minimax theory and its applications, Tome 9 (2024) no. 2
Westudy optimality conditions for quasiconvex programming in terms of quasiconjugate functions. By using Q-conjugate, we show a necessary and sufficient optimality condition for quasiconvex programming. Additionally, by using H-quasiconjugate, O-uasiconjugate, and R-quasiconjugate, we introduce optimality conditions for some kind of evenly quasiconvex objective functions. We investigate evenly convex sets and evenly quasiconvex functions, and continuity of quasiconvex functions.
Mots-clés :
Quasiconvex programming, optimality condition, quasiconjugate function, subdifferen tial
@article{MTA_2024_9_2_a14,
author = {Satoshi Suzuki},
title = {Optimality conditions for quasiconvex programming in terms of quasiconjugate functions},
journal = {Minimax theory and its applications},
year = {2024},
volume = {9},
number = {2},
zbl = {1563.90262},
url = {http://geodesic.mathdoc.fr/item/MTA_2024_9_2_a14/}
}
Satoshi Suzuki. Optimality conditions for quasiconvex programming in terms of quasiconjugate functions. Minimax theory and its applications, Tome 9 (2024) no. 2. http://geodesic.mathdoc.fr/item/MTA_2024_9_2_a14/