#### Filter Results:

- Full text PDF available (19)

#### Publication Year

1993

2018

- This year (1)
- Last 5 years (17)
- Last 10 years (22)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Makoto Yamashita, Katsuki Fujisawa, Masakazu Kojima
- Optimization Methods and Software
- 2003

The SDPA (SemiDefinite Programming Algorithm) is a software package for solving general SDPs (SemiDefinite Programs). It is written in C++ with the help of LAPACK for numerical linear algebra forâ€¦ (More)

- Kazuhide Nakata, Katsuki Fujisawa, Mituhiro Fukuda
- Math. Program.
- 2003

In Part I of this series of articles, we introduced a general framework of exploiting the aggregate sparsity pattern over all data matrices of large scale and sparse semidefinite programs (SDPs) whenâ€¦ (More)

- Takayuki Gunji, Sunyoung Kim, Masakazu Kojima, Akiko Takeda, Katsuki Fujisawa, Tomohiko Mizutani
- Computing
- 2003

PHoM is a software package in C++ for finding all isolated solutions of polynomial systems using a polyhedral homotopy continuation method. Among three modules constituting the package, the firstâ€¦ (More)

- Makoto Yamashita, Katsuki Fujisawa, Masakazu Kojima
- Parallel Computing
- 2003

The SDPA (SemiDefinite Programming Algorithm) is known as efficient computer software based on primal-dual interior-point method for solving SDPs (Semidefinite Programs). In many applications,â€¦ (More)

- Yuichiro Yasui, Katsuki Fujisawa
- 2015 International Conference on High Performanceâ€¦
- 2015

The breadth-first search (BFS) is one of the most centric kernels in graph processing. Beamer's direction-optimizing BFS algorithm, which selects one of two traversal directions at each level, canâ€¦ (More)

- Katsuki Fujisawa, Masakazu Kojima, Kazuhide Nakata
- Math. Program.
- 1997

The Helmberg-Rendl-Vanderbei-Wolkowicz/Kojima-Shindoh-Hara/Monteiro and the Nesterov-Todd search directions have been used in many primal-dual interior-point methods for semidefinite programs. Thisâ€¦ (More)

Topology optimization problem of trusses for specified eigenvalue of vibration is formulated as Semi-Definite Programming (SDP), and an algorithm is presented based on the Semi-Definite Programmingâ€¦ (More)

- Yuichiro Yasui, Katsuki Fujisawa, Kazushige Goto
- 2013 IEEE International Conference on Big Data
- 2013

The breadth-first search (BFS) is one of the most important kernels in graph theory. The Graph500 benchmark measures the performance of any supercomputer performing a BFS in terms of traversed edgesâ€¦ (More)

- Toyotaro Suzumura, Koji Ueno, Hitoshi Sato, Katsuki Fujisawa, Satoshi Matsuoka
- 2011 IEEE International Symposium on Workloadâ€¦
- 2011

Graph500 is a new benchmark for supercomputers based on large-scale graph analysis, which is becoming an important form of analysis in many real-world applications. Graph algorithms run well onâ€¦ (More)