The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Masakazu Kojima: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  21. Exploiting Structured Sparsity in Large Scale Semidefinite Programming Problems. [Citation Graph (, )][DBLP]


Search in 0.002secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002