dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Masakazu Kojima Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2011
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSunyoung Kim, Masakazu Kojima, Martin Mevissen, Makoto Yamashita: Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion. Math. Program. 129(1): 33-68 (2011)
2010
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMasakazu Kojima: Exploiting Structured Sparsity in Large Scale Semidefinite Programming Problems. ICMS 2010: 4-9
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMartin Mevissen, Masakazu Kojima: Sdp Relaxations for Quadratic Optimization Problems Derived from Polynomial Optimization Problems. APJOR 27(1): 15-38 (2010)
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSunyoung Kim, Masakazu Kojima: Solving polynomial least squares problems via semidefinite programming relaxations. J. Global Optimization 46(1): 1-23 (2010)
2009
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSunyoung Kim, Masakazu Kojima, Philippe L. Toint: Recognizing underlying sparsity in optimization. Math. Program. 119(2): 273-303 (2009)
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSunyoung Kim, Masakazu Kojima, Hayato Waki: Exploiting Sparsity in SDP Relaxation for Sensor Network Localization. SIAM Journal on Optimization 20(1): 192-215 (2009)
2008
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHayato 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
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTomohiko Mizutani, Akiko Takeda, Masakazu Kojima: Dynamic Enumeration of All Mixed Cells. Discrete & Computational Geometry 37(3): 351-367 (2007)
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMasakazu 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
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKazuhide 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)
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHayato Waki, Sunyoung Kim, Masakazu Kojima, Masakazu Muramatsu: Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity. SIAM Journal on Optimization 17(1): 218-242 (2006)
2005
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMasakazu Kojima, Sunyoung Kim, Hayato Waki: Sparsity in sums of squares of polynomials. Math. Program. 103(1): 45-62 (2005)
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSunyoung Kim, Masakazu Kojima, Hayato Waki: Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems. SIAM Journal on Optimization 15(3): 697-719 (2005)
2004
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKatsuki Fujisawa, Masakazu Kojima, Akiko Takeda, Makoto Yamashita: High Performance Grid and Cluster Computing for Some Optimization Problems. SAINT Workshops 2004: 612-615
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTakayuki 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
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMakoto Yamashita, Katsuki Fujisawa, Masakazu Kojima: SDPARA: SemiDefinite Programming Algorithm paRAllel version. Parallel Computing 29(8): 1053-1067 (2003)
2002
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMasakazu Kojima, Levent Tunçel: On the finite convergence of successive SDP relaxation methods. European Journal of Operational Research 143(2): 325-341 (2002)
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKim-Chuan Toh, Masakazu Kojima: Solving Some Large Scale Semidefinite Programs via the Conjugate Residual Method. SIAM Journal on Optimization 12(3): 669-691 (2002)
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMituhiro Fukuda, Masakazu Kojima, Masayuki Shida: Lagrangian Dual Interior-Point Methods for Semidefinite Programs. SIAM Journal on Optimization 12(4): 1007-1031 (2002)
2001
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMasakazu Kojima, Akiko Takeda: Complexity Analysis of Successive Convex Relaxation Methods for Nonconvex Sets. Math. Oper. Res. 26(3): 519-542 (2001)
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMituhiro Fukuda, Masakazu Kojima, Kazuo Murota, Kazuhide Nakata: Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework. SIAM Journal on Optimization 11(3): 647-674 (2001)
2000
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMasakazu Kojima, Levent Tunçel: Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets. SIAM Journal on Optimization 10(3): 750-778 (2000)
1998
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMasakazu 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
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKatsuki Fujisawa, Masakazu Kojima, Kazuhide Nakata: Exploiting sparsity in primal-dual interior-point methods for semidefinite programming. Math. Program. 79: 235-253 (1997)
1994
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMasakazu Kojima, Toshihito Noma, Akiko Yoshise: Global convergence in infeasible-interior-point algorithms. Math. Program. 65: 43-72 (1994)
1993
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMasakazu Kojima, Nimrod Megiddo, Shinji Mizuno: Theoretical convergence of large-step primal-dual interior point algorithms for linear programming. Math. Program. 59: 1-21 (1993)
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMasakazu Kojima, Shinji Mizuno, Akiko Yoshise: A little theorem of the big Mu in interior point algorithms. Math. Program. 59: 361-375 (1993)
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMasakazu Kojima, Nimrod Megiddo, Shinji Mizuno: A primal-dual infeasible-interior-point algorithm for linear programming. Math. Program. 61: 263-280 (1993)
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTohru Ishihara, Masakazu Kojima: On the big Mu in the affine scaling algorithm. Math. Program. 62: 85-93 (1993)
1992
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMasakazu Kojima, Nimrod Megiddo, Yinyu Ye: An interior point potential reduction algorithm for the linear complementarity problem. Math. Program. 54: 267-279 (1992)
1991
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMasakazu Kojima, Nimrod Megiddo, Toshihito Noma, Akiko Yoshise: A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems Springer 1991
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMasakazu 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
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMasakazu 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
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMasakazu Kojima: Determining Basic Variables of Optimal Solutions in Karmarkar's New LP Algorithm. Algorithmica 1(4): 499-515 (1986)

Coauthor Index

1Katsuki Fujisawa [11] [19] [20] [21] [25]
2Mituhiro Fukuda [14] [16]
3Takayuki Gunji [20]
4Tohru Ishihara [6]
5Sunyoung Kim [20] [22] [23] [24] [28] [29] [30] [31] [34]
6Nimrod Megiddo [4] [5] [7] [9]
7Martin Mevissen [32] [34]
8Shinji Mizuno [2] [3] [7] [8] [9]
9Tomohiko Mizutani [20] [27]
10Masakazu Muramatsu [24] [26] [28]
11Kazuo Murota [14]
12Kazuhide Nakata [11] [14] [25]
13Toshihito Noma [4] [10]
14Masayuki Shida [12] [16]
15Susumu Shindoh [12]
16Hiroshi Sugimoto [28]
17Akiko Takeda [15] [20] [21] [27]
18Kim-Chuan Toh [17]
19Philippe L. Toint [30]
20Levent Tunçel [13] [18]
21Hayato Waki [22] [23] [24] [28] [29]
22Makoto Yamashita [19] [21] [25] [34]
23Yinyu Ye [5]
24Akiko Yoshise [2] [3] [4] [8] [10]

Colors in the list of coauthors

Last update Fri Jun 1 15:44:53 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page