Title :
Algorithms for globally solving DC minimization problems via concave programming
Author :
Liu, Shih-Mim ; Papavassilopoulos, G.P.
Author_Institution :
Dept. of Electr. Eng. Syst., Univ. of Southern California, Los Angeles, CA, USA
Abstract :
Several methods have been proposed for solving a DC (difference of two convex functions) programming problem, but very few have been done on parallel approach. In this paper, three algorithms suitable for parallel implementation are presented to solve a DC problem via solving an equivalent concave minimization problem. To distribute the computation load as evenly as possible, a simplex subdivision process such as bisection, triangulation or other partition procedures of simplices are employed. Some numerical test results are reported and comparison of these algorithms are given
Keywords :
concave programming; constraint theory; convergence of numerical methods; iterative methods; minimisation; DC minimization; bisection; concave programming; equivalent concave minimization; iterative method; linear constraints; simplex subdivision process; triangulation; Approximation algorithms; Approximation methods; Computational modeling; Concurrent computing; Ear; Minimization methods; Parallel programming; Partitioning algorithms; Testing; Upper bound;
Conference_Titel :
American Control Conference, Proceedings of the 1995
Conference_Location :
Seattle, WA
Print_ISBN :
0-7803-2445-5
DOI :
10.1109/ACC.1995.532301