2004 Symposium on Applications and the Internet-Workshops (SAINT 2004 Workshops)
High Performance Grid and Cluster Computing for Some Optimization Problems
Tokyo, Japan
January 26-January 30
ISBN: 0-7695-2050-2
The aim of this short article is to show that grid and cluster computing provides tremendous power to optimization methods. The methods that the article picks up are a successive convex relaxation method for quadratic optimization problems, a polyhedral homotopy method for polynomial systems of equations and a primal-dual interior-point method for semidefinite programming problems. Their parallel implementations on grids and clusters together with numerical results are reported.
Citation:
Katsuki Fujisawa, Masakazu Kojima, Akiko Takeda, Makoto Yamashita, "High Performance Grid and Cluster Computing for Some Optimization Problems," saint-w, pp.612, 2004 Symposium on Applications and the Internet-Workshops (SAINT 2004 Workshops), 2004