2024/11/28 by Vũ Thị Thu Hương, Huong, Vu Thi, Duong Thi Kim Huyen +3 · 1 citation
Engineering · Computer Science · #Optimization and Packing Problems #Scheduling and Optimization Algorithms #Interconnection Networks and Systems
paper · pdf · doi:10.48550/arxiv.2411.19272
The problem of minimizing the difference of two lower semicontinuous, proper, convex functions (a DC function) on a nonempty closed convex set in a locally convex Hausdorff topological vector space is studied in this paper. The focus is made on the situations where either the second component of the objective function is a generalized polyhedral convex function or the first component of the objective function is a generalized polyhedral convex function and the constraint set is generalized polyhedral convex. Various results on optimality conditions, the local solution set, the global solution set, and solution algorithms via duality are obtained. Useful illustrative examples are considered.