Mituhiro Fukuda, Bastiaan J. Braams, Katsuki Fujisawa, Maho Nakata, Jerome K. Percus, Makoto Yamashita, ...
We are interested in realizing the variational
Solving Large Scale Optimization Problems via Grid and Cluster Computing ∗ (2008)
Katsuki Fujisawa, Masakazu Kojima, Akiko Takeda, Makoto Yamashita
Abstract. Solving large scale optimization problems requires a huge amount of computational power. The size of optimization problems that can be solved on a few CPUs has been limited due to a lack of...
Katsuki Fujisawa, Yukinobu Hamuro, Naoki Katoh, Takeshi Tokuyama, Katsutoshi Yada
. We consider the problem of finding two-dimensional association rules for categorical attributes. Suppose we have two conditional attributes A and B both of whose domains are categorical, and one...
Symmetricity Of The Solution Of Semidefinite Program (2007)
Yoshihiro Kanno, Makoto Ohsaki, Katsuki Fujisawa, Naoki Katoh
. Symmetricity of an optimal solution of SemiDefinite Program (SDP) with certain symmetricity is discussed based on symmetry property of the central path that is traced by a primaldual interior-point...
this paper is to explain the implementation of SDPA (SemiDefinite Programming Algorithm) [4] for semidefinite programs and report some numerical experiments of SDPA. Besides SDPA, there are some...
Akiko Takeda, Katsuki Fujisawa, Yusuke Fukaya, Masakazu Kojima
Abstract. As computing resources continue to improve, global solutions for larger size quadraticallyconstrained optimization problems become more achievable. In this paper, we focus on larger size...
Akiko Takeda, Katsuki Fujisawa, Yusuke Fukaya, Masakazu Kojima
Abstract. As computing resources continue to improve, global solutions for larger size quadraticallyconstrained optimization problems become more achievable. In this paper, we focus on larger size...
Takayuki Gunji, Sunyoung Kim, Katsuki Fujisawa, Masakazu Kojima
The polyhedral homotopy continuation method is known to be a successful method for finding all isolated solutions of a system of polynomial equations. PHoM, an implementation of the method in C++,...
Takayuki Gunji, Sunyoung Kim, Masakazu Kojima, Takayuki Gunji, Sunyoung Kim, Katsuki Fujisawa, ...
Abstract. The polyhedral homotopy continuation method is known to be a successful method for finding all isolated solutions of a system of polynomial equations. PHoM, implementation of the method in...
Makoto Yamashita, Katsuki Fujisawa, Mituhiro Fukuda, Masakazu Kojima, Kazuhide Nakata, Makoto Yamashita, ...
Abstract. The Semidefinite Program (SDP) is a fundamental problem in mathematical programming. It covers a wide range of applications, such as combinatorial optimization, control theory, polynomial...
PREPROCESSING SPARSE SEMIDEFINITE PROGRAMS VIA MATRIX COMPLETION By (2004)
Katsuki Fujisawa, Mituhiro Fukuda, Kazuhide Nakata, Mituhiro Fukuda, Kazuhide Nakata
Preprocessing sparse semidefinite programs via matrix completion ∗
PHoM – a polyhedral homotopy continuation method for polynomial systems (2004)
Takayuki Gunji, Sunyoung Kim, Masakazu Kojima, Akiko Takeda, Katsuki Fujisawa, Tomohiko Mizutani
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...
Katsuki Fujisawa, Katsuki Fujisawa, Mituhiro Fukuda, Mituhiro Fukuda, Masakazu Kojima, Kazuhide Nakata, ...
The SDPA-C (SemiDefinite Programming Algorithm -- Completion method) is a software package designed for solving large scale sparse SDPs (semidefinite programming problems). In particular, the SDPA-C...
Research Reports on Mathematical and Computing Sciences (2004)
Series Operations Research, Katsuki Fujisawa, Mituhiro Fukuda, Kazuhide Nakata
Considering that preprocessing is an important phase in linear programming, it should be systematically more incorporated in semidefinite programming solvers. The conversion method proposed by the...
Katsuki Fujisawa, Mituhiro Fukuda, Kazuhide Nakata, Makoto Yamashita, Katsuki Fujisawa, Mituhiro Fukuda, ...
Abstract. The SDPA-C (SemiDefinite Programming Algorithm – Completion method) is a software package designed for solving large scale sparse SDPs (semidefinite programming problems). In particular,...
SDPARA: SemiDefinite Programming Algorithm PARAllel version (2003)
Makoto Yamashita, Katsuki Fujisawa, Masakazu Kojima
Abstract The SDPA (SemiDefinite Programming Algorithm) is known as e#cient computer software based on primal-dual interior-point method for solving SDPs (Semidefinite Programs). In many applications,...
Kazuhide Nakata, Katsuki Fujisawa, Mituhiro Fukuda, Masakazu Kojima, Kazuo Murota
Abstract 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...
High Performance Grid and Cluster Computing for Some Optimization Problems (2003)
Masakazu Kojima, Akiko Takeda, Makoto Yamashita, Katsuki Fujisawa, Katsuki Fujisawa
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...
Solving Large Scale Optimization Problems via Grid and Cluster Computing (2003)
K. Fujisawa, Katsuki Fujisawa, Masakazu Kojima, Akiko Takeda, Makoto Yamashita
Solving large scale optimization problems requires a huge amount of computational power. The size of optimization problems that can be solved on a few CPUs has been limited due to a lack of...
High Performance Grid and Cluster Computing for Some Optimization Problems (2003)
Katsuki Fujisawa, Masakazu Kojima, Akiko Takeda, Makoto Yamashita
Solving large scale optimization problems requires a huge amount of computational power. The size of optimization problems that can be solved on a few CPUs has been limited due to a lack of...
Kazuhide Nakata, Makoto Yamashita, Katsuki Fujisawa, Masakazu Kojima
Abstract. A parallel computational method SDPARA-C is presented for SDPs (semidefinite programs). It combines two methods SDPARA and SDPA-C proposed by the authors who developed a software package...
SDPARA: SemiDefinite Programming Algorithm PARAllel version (2003)
Makoto Yamashita, Katsuki Fujisawa, Masakazu Kojima
Abstract The SDPA (SemiDefinite Programming Algorithm) is known as efficient computer software based on the primal-dual interior-point method for solving SDPs (Semidefinite Programs). In many...
Kazuhide Nakata, Makoto Yamashita, Katsuki Fujisawa, Masakazu Kojima
Abstract. A parallel computational method SDPARA-C is presented for SDPs (semidefinite programs). It combines two methods SDPARA and SDPA-C proposed by the authors who developed a software package...
Implementation and Evaluation of SDPA 6.0 (SemiDefinite Programming Algorithm 6.0 (2002)
Makoto Yamashita, Katsuki Fujisawa, Masakazu Kojima
Abstract 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...
Kento Aida Tokyo, Kento Aida, Mitsuhiro Fukuda, Masakazu Kojima, Katsuki Fujisawa
Introduction Grid computing[1] is one of distributed computing methods, in which computational and data resources in a wide area network are transparently employed to solve large-scale problems....
Akiko Takeda, Masakazu Kojima, Katsuki Fujisawa
Abstract An interesting combinatorial (enumeration) problem arises in the initial phase of the polyhedral homotopy continuation method for computing all solutions of a polynomial equation system in...
Akiko Takeda, Masakazu Kojima, Katsuki Fujisawa
Abstract An interesting combinatorial (enumeration) problem arises in the initial phase of the polyhedral homotopy continuation method for computing all solutions of a polynomial equation system in...
Akiko Takeda, Masakazu Kojima, Katsuki Fujisawa
Abstract An interesting combinatorial (enumeration) problem arises in the initial phase of the polyhedral homotopy continuation method for computing all solutions of a polynomial equation system in...
SDPA-M (SemiDefinite Programming Algorithm in MATLAB) User's Manual - Version 1.00 (2000)
Satoshi Matsuyama, Satoshi Nakamura, Katsuki Fujisawa, Kazuhide Nakata, Masakazu Kojima
. The SDPA-M (Semidfinite Programming Algorithm in MATLAB) is a MATLAB interface version of the SDPA[11] which is known as a fast and numerically stable solver for SDPs (semidefinite programs). The...
Katsuki Fujisawa, Yukinobu Hamuro, Naoki Katoh, Takeshi Tokuyama, Katsutoshi Yada
Abstract. We consider the problem of finding two-dimensional association rules for categorical attributes. Suppose we have two conditional attributes A and B both of whose domains are categorical,...
SDPA (SemiDefinite Programming Algorithm) (1999)
Katsuki Fujisawa, Masakazu Kojima, Kazuhide Nakata
6K$a$FFq$7$$$,Hs>o$K <BMQ>e=EMW$J) HsFL:GE,2=LdBj$r07$($k2DG=@-$r;}$C$F$$$k [1]. $^$?, Cx<T$i$,3+H/$7$?%=%U %H%&%'%" SDPA (SemiDefinite Programming Algorithm) [2] 1...
SDPA (SemiDefinite Programming Algorithm) User's Manual - Version 5.00 (1999)
Katsuki Fujisawa, Masakazu Kojima, Kazuhide Nakata
. The SDPA (SemiDefinite Programming Algorithm) is a software package for solving semidefinite program (SDP). It is based on a Mehrotra-type predictor-corrector infeasible primal-dual interior-point...
SDPA (SemiDefinite Programming Algorithm) User's Manual - Version 4.10 (1998)
Katsuki Fujisawa, Masakazu Kojima, Kazuhide Nakata
. The SDPA (SemiDefinite Programming Algorithm) is a software package for solving semidefinite program (SDP). It is based on a Mehrotra-type predictor-corrector infeasible primal-dual interior-point...
Numerical Evaluation of SDPA (SemiDefinite Programming Algorithm). (1998)
Katsuki Fujisawa, Mituhiro Fukuda, Masakazu Kojima, Kazuhide Nakata
. SDPA (SemiDefinite Programming Algorithm) is a C++ implementation of a Mehrotra-type primal-dual predictor-corrector interior-point method for solving the standard form semidefinite program and its...
Numerical Evaluation of SDPA (SemiDefinite Programming Algorithm). (1998)
Katsuki Fujisawa, Mituhiro Fukuda, Masakazu Kojima, Kazuhide Nakata
. SDPA (SemiDefinite Programming Algorithm) is a C++ implementation of a Mehrotra-type primal-dual predictor-corrector interior-point method for solving the standard form semidefinite program and its...
Exploiting Sparsity in Primal-Dual Interior-Point Methods for Semidefinite Programming (1997)
Katsuki Fujisawa, Masakazu Kojima, Kazuhide Nakata
Abstract. 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...
Exploiting Sparsity in Primal-Dual Interior-Point Methods for Semidefinite Programming. (1997)
Semidefinite Programming, M. Kojima, K. Nakata, Katsuki Fujisawa, Masakazu Kojima, Kazuhide Nakata
. 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...
The Life Span Method - A New Variant of Local Search - (1997)
this paper, we present a variant of local search, namely the Life Span Method (LSM), for generic combinatorial optimization problems. The LSM can be seen as a variation of tabu search introduced by...
Experimental Analyses of the Life Span Method for the Maximum Stable Set Problem (1995)
An efficient algorithm for the approximate solution of the maximum cardinality stable set problem is presented. The algorithm is based on a variant of tabu search which we call the life span method....
Experimental Analyses of the Life Span Method for the Quadratic Assignment Problem (1995)
In this paper, we report an application of the life span method (LSM), a variant of tabu search introduced by the authors, to the quadratic assignment problem which has applications on facility...
SDPA (SemiDefinite Programming Algorithm) User's Manual . . . (1995)
K. Fujisawa, Katsuki Fujisawa, Masakazu Kojima, Kazuhide Nakata, Makoto Yamashita
The SDPA (SemiDefinite Programming Algorithm) is a software package for solving semidefinite program (SDP). It is based on a Mehrotra-type predictor-corrector infeasible primal-dual interior-point...
SDPA (Semidefinite Programming Algorithm) -- User's Manual (1995)
Katsuki Fujisawa, Mituhiro Fukuda, Masakazu Kojima, Kazuhide Nakata, Maho Nakata, Makoto Yamashita, ...
Abstract. The SDPA (SemiDefinite Programming Algorithm) [5] is a software package for solving semidefinite programs (SDPs). It is based on a Mehrotra-type predictor-corrector infeasible primal-dual...
The Life Span Method -- A New Variant of Local Search -- (1993)
this paper, we present a variant of local search, namely the Life Span Method (LSM), for generic combinatorial optimization problems. The LSM can be seen as a variation of tabu search introduced by...