Katsuki Fujisawa
Kyushu University
91 Papers
408 Citations
Katsuki Fujisawa is an academic researcher from Kyushu University. The author has contributed to research in topics: Semidefinite programming & Computer science. The author has an hindex of 20, co-authored 87 publications. Previous affiliations of Katsuki Fujisawa include Tokyo Denki University & Chuo University.
Chat about Author
Papers
Semidefinite programming for optimal power flow problems
TL;DR: In this article, the optimal power flow problems (OPF) were reformulated into a semidefinite programming (SDP) model and developed an algorithm of interior point method (IPM) for SDP.
709
Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
TL;DR: The purpose of this paper is to present a brief description of the latest version of the SDPA and its high performance for large scale problems through numerical experiments and comparisons with some other major software packages for general SDPs.
218
Exploiting sparsity in semidefinite programming via matrix completion II: implementation and numerical results
TL;DR: New techniques to deal with the sparsity through a clique tree in the former method and through new computational formulae in the latter one are introduced andumerical results show that these methods can be very efficient for some problems.
218
A high-performance software package for semidefinite programs: SDPA 7
Makoto Yamashita,Katsuki Fujisawa,Kazuhide Nakata,Maho Nakata,Mituhiro Fukuda,Kazuhiro Kobayashi,Kazushige Goto +6 more
- 01 Jan 2010
TL;DR: SDPA Ver. 7 can eciently solve SDPs arising from various fields with shorter time and less memory than Ver. 6 and other software packages and with the help of multiple precision libraries, SDPA-GMP, -QD and -DD are implemented based on SDPA to execute the primal-dual interior-point method with very accurate and stable computations.
111
Performance characteristics of Graph500 on large-scale distributed environment
Toyotaro Suzumura,Koji Ueno,Hitoshi Sato,Katsuki Fujisawa,Satoshi Matsuoka +4 more
- 06 Nov 2011
TL;DR: This is the first report of a performance evaluation and analysis for Graph500 on a commodity-processor-based distributed-memory supercomputer and finds that the reference implementation “replicated-csr” based on distributed level-synchronized breadth-first search solves a large free graph problem in 3.09 seconds.
65