High performance grid and cluster computing for some optimization problems

Katsuki Fujisawa, Masakazu Kojima, Akiko Takeda, Makoto Yamashita

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - 2004 International Symposium on Applications and the Internet Workshops (Saint 2004Workshops)
Pages612-615
Number of pages4
Publication statusPublished - Jun 14 2004
Externally publishedYes
EventProceedings - 2004 International Symposium on Applications and the Internet Workshops (Saint 2004Workshop) - Tokyo, Japan
Duration: Jan 26 2004Jan 30 2004

Other

OtherProceedings - 2004 International Symposium on Applications and the Internet Workshops (Saint 2004Workshop)
CountryJapan
CityTokyo
Period1/26/041/30/04

Fingerprint

Cluster computing
Grid computing
Polynomials

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

Fujisawa, K., Kojima, M., Takeda, A., & Yamashita, M. (2004). High performance grid and cluster computing for some optimization problems. In Proceedings - 2004 International Symposium on Applications and the Internet Workshops (Saint 2004Workshops) (pp. 612-615)

High performance grid and cluster computing for some optimization problems. / Fujisawa, Katsuki; Kojima, Masakazu; Takeda, Akiko; Yamashita, Makoto.

Proceedings - 2004 International Symposium on Applications and the Internet Workshops (Saint 2004Workshops). 2004. p. 612-615.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Fujisawa, K, Kojima, M, Takeda, A & Yamashita, M 2004, High performance grid and cluster computing for some optimization problems. in Proceedings - 2004 International Symposium on Applications and the Internet Workshops (Saint 2004Workshops). pp. 612-615, Proceedings - 2004 International Symposium on Applications and the Internet Workshops (Saint 2004Workshop), Tokyo, Japan, 1/26/04.
Fujisawa K, Kojima M, Takeda A, Yamashita M. High performance grid and cluster computing for some optimization problems. In Proceedings - 2004 International Symposium on Applications and the Internet Workshops (Saint 2004Workshops). 2004. p. 612-615
Fujisawa, Katsuki ; Kojima, Masakazu ; Takeda, Akiko ; Yamashita, Makoto. / High performance grid and cluster computing for some optimization problems. Proceedings - 2004 International Symposium on Applications and the Internet Workshops (Saint 2004Workshops). 2004. pp. 612-615
@inproceedings{67057d3855f44bce97e00cff749dce30,
title = "High performance grid and cluster computing for some optimization problems",
abstract = "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.",
author = "Katsuki Fujisawa and Masakazu Kojima and Akiko Takeda and Makoto Yamashita",
year = "2004",
month = "6",
day = "14",
language = "English",
isbn = "0769520502",
pages = "612--615",
booktitle = "Proceedings - 2004 International Symposium on Applications and the Internet Workshops (Saint 2004Workshops)",

}

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/6/14

Y1 - 2004/6/14

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

M3 - Conference contribution

AN - SCOPUS:2642534636

SN - 0769520502

SP - 612

EP - 615

BT - Proceedings - 2004 International Symposium on Applications and the Internet Workshops (Saint 2004Workshops)

ER -