Minimizing increasing convex along rays functions based on abstract convexity

Author(s):

Nemat Ghafari *

Message:
Article Type:
Research/Original Article (دارای رتبه معتبر)
Abstract:
In this paper, a problem whose cost function and constraints are increasing convex along rays is considered. For solving such problems, an algorithm is presented that is inspired by the generalized Cutting Angle Method. A set that contains the optimal solution of the mentioned problem is defined. Some numerical examples are presented to confirm the validity and accuracy of the algorithm.
Keywords:

abstract convexity , Convex Along Rays , Min-type function , Subgradient Method , Cutting Angle Method

Language:
English
Published:
Wavelets and Linear Algebra, Volume:9 Issue: 1, Spring and Summer 2022
Pages:
15 to 29
https://www.magiran.com/p2541876