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)
PublisherIEEE Computer Society
Pages612-615
Number of pages4
ISBN (Print)0769520502, 9780769520506
DOIs
Publication statusPublished - 2004
Externally publishedYes
EventProceedings - 2004 International Symposium on Applications and the Internet Workshops (Saint 2004Workshop) - Tokyo, Japan
Duration: Jan 26 2004Jan 30 2004

Publication series

NameProceedings - International Symposium on Applications and the Internet Workshops

Other

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

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Fingerprint Dive into the research topics of 'High performance grid and cluster computing for some optimization problems'. Together they form a unique fingerprint.

Cite this