TY - GEN
T1 - High performance grid and cluster computing for some optimization problems
AU - Fujisawa, Katsuki
AU - Kojima, Masakazu
AU - Takeda, Akiko
AU - Yamashita, Makoto
PY - 2004
Y1 - 2004
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=2642534636&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=2642534636&partnerID=8YFLogxK
U2 - 10.1109/saintw.2004.1268696
DO - 10.1109/saintw.2004.1268696
M3 - Conference contribution
AN - SCOPUS:2642534636
SN - 0769520502
SN - 9780769520506
T3 - Proceedings - International Symposium on Applications and the Internet Workshops
SP - 612
EP - 615
BT - Proceedings - 2004 International Symposium on Applications and the Internet Workshops (Saint 2004Workshops)
PB - IEEE Computer Society
T2 - Proceedings - 2004 International Symposium on Applications and the Internet Workshops (Saint 2004Workshop)
Y2 - 26 January 2004 through 30 January 2004
ER -