2008 |
22 | EE | Hayato Waki,
Sunyoung Kim,
Masakazu Kojima,
Masakazu Muramatsu,
Hiroshi Sugimoto:
Algorithm 883: SparsePOP---A Sparse Semidefinite Programming Relaxation of Polynomial Optimization Problems.
ACM Trans. Math. Softw. 35(2): (2008) |
2007 |
21 | EE | Tomohiko Mizutani,
Akiko Takeda,
Masakazu Kojima:
Dynamic Enumeration of All Mixed Cells.
Discrete & Computational Geometry 37(3): 351-367 (2007) |
20 | EE | Masakazu Kojima,
Masakazu Muramatsu:
An Extension of Sums of Squares Relaxations to Polynomial Optimization Problems Over Symmetric Cones.
Math. Program. 110(2): 315-336 (2007) |
2006 |
19 | EE | Kazuhide Nakata,
Makoto Yamashita,
Katsuki Fujisawa,
Masakazu Kojima:
A parallel primal-dual interior-point method for semidefinite programs using positive definite matrix completion.
Parallel Computing 32(1): 24-43 (2006) |
2005 |
18 | EE | Masakazu Kojima,
Sunyoung Kim,
Hayato Waki:
Sparsity in sums of squares of polynomials.
Math. Program. 103(1): 45-62 (2005) |
2004 |
17 | EE | Katsuki Fujisawa,
Masakazu Kojima,
Akiko Takeda,
Makoto Yamashita:
High Performance Grid and Cluster Computing for Some Optimization Problems.
SAINT Workshops 2004: 612-615 |
16 | EE | Takayuki Gunji,
Sunyoung Kim,
Masakazu Kojima,
Akiko Takeda,
Katsuki Fujisawa,
Tomohiko Mizutani:
PHoM - a Polyhedral Homotopy Continuation Method for Polynomial Systems.
Computing 73(1): 57-77 (2004) |
2003 |
15 | EE | Makoto Yamashita,
Katsuki Fujisawa,
Masakazu Kojima:
SDPARA: SemiDefinite Programming Algorithm paRAllel version.
Parallel Computing 29(8): 1053-1067 (2003) |
2002 |
14 | EE | Masakazu Kojima,
Levent Tunçel:
On the finite convergence of successive SDP relaxation methods.
European Journal of Operational Research 143(2): 325-341 (2002) |
2001 |
13 | EE | Masakazu Kojima,
Akiko Takeda:
Complexity Analysis of Successive Convex Relaxation Methods for Nonconvex Sets.
Math. Oper. Res. 26(3): 519-542 (2001) |
1998 |
12 | | Masakazu Kojima,
Masayuki Shida,
Susumu Shindoh:
Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs.
Math. Program. 80: 129-160 (1998) |
1997 |
11 | | Katsuki Fujisawa,
Masakazu Kojima,
Kazuhide Nakata:
Exploiting sparsity in primal-dual interior-point methods for semidefinite programming.
Math. Program. 79: 235-253 (1997) |
1994 |
10 | | Masakazu Kojima,
Toshihito Noma,
Akiko Yoshise:
Global convergence in infeasible-interior-point algorithms.
Math. Program. 65: 43-72 (1994) |
1993 |
9 | | Masakazu Kojima,
Nimrod Megiddo,
Shinji Mizuno:
Theoretical convergence of large-step primal-dual interior point algorithms for linear programming.
Math. Program. 59: 1-21 (1993) |
8 | | Masakazu Kojima,
Shinji Mizuno,
Akiko Yoshise:
A little theorem of the big Mu in interior point algorithms.
Math. Program. 59: 361-375 (1993) |
7 | | Masakazu Kojima,
Nimrod Megiddo,
Shinji Mizuno:
A primal-dual infeasible-interior-point algorithm for linear programming.
Math. Program. 61: 263-280 (1993) |
6 | | Tohru Ishihara,
Masakazu Kojima:
On the big Mu in the affine scaling algorithm.
Math. Program. 62: 85-93 (1993) |
1992 |
5 | | Masakazu Kojima,
Nimrod Megiddo,
Yinyu Ye:
An interior point potential reduction algorithm for the linear complementarity problem.
Math. Program. 54: 267-279 (1992) |
1991 |
4 | | Masakazu Kojima,
Nimrod Megiddo,
Toshihito Noma,
Akiko Yoshise:
A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems
Springer 1991 |
3 | | Masakazu Kojima,
Shinji Mizuno,
Akiko Yoshise:
An O(square root(n) * L) iteration potential reduction algorithm for linear complementarity problems.
Math. Program. 50: 331-342 (1991) |
1990 |
2 | | Masakazu Kojima,
Shinji Mizuno,
Akiko Yoshise:
Ellipsoids that Contain All the Solutions of a Positive Semi-Definite Linear Complementarity Problem.
Math. Program. 48: 415-435 (1990) |
1986 |
1 | | Masakazu Kojima:
Determining Basic Variables of Optimal Solutions in Karmarkar's New LP Algorithm.
Algorithmica 1(4): 499-515 (1986) |