Discrete convexity;
Quasi convex function;
Minimization;
SCALING ALGORITHMS;
D O I:
10.1007/s13160-023-00633-3
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
For a class of discrete quasi convex functions called semi-strictly quasi M-#-convex functions, we investigate fundamental issues relating to minimization, such as optimality condition by local optimality, minimizer cut property, geodesic property, and proximity property. Emphasis is put on comparisons with (usual) M-#-convex functions. The same optimality condition and a weaker form of the minimizer cut property hold for semi-strictly quasi M-#-convex functions, while geodesic property and proximity property fail.