Proximal point algorithms for vector DC programming with applications to probabilistic lot sizing with service levels
Summary: We present a new algorithm for solving vector DC programming, where the vector function is a function of the difference of \(C\)-convex functions. Because of the nonconvexity of the objective function, it is difficult to solve this class of problems. We propose several proximal point algorithms to address this class of problems, which make use of the special structure of the problems (i.e., the DC structure). The well-posedness and the global convergence of the proposed algorithms are developed. The efficiency of the proposed algorithm is shown by an application to a multicriteria model stemming from lot sizing problems.
scientific article; zbMATH DE number 6944831