The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Masakazu Kojima" ( http://dblp.L3S.de/Authors/Masakazu_Kojima )

  Author page on DBLP  Author page in RDF  Community of Masakazu Kojima in ASPL-2

Publication years (Num. hits)
1986-2001 (15) 2002-2009 (15) 2010-2011 (4)
Publication types (Num. hits)
article(31) book(1) inproceedings(2)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 14 occurrences of 11 keywords

Results
Found 34 publication records. Showing 34 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Sunyoung Kim, Masakazu Kojima, Martin Mevissen, Makoto Yamashita Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion. Search on Bibsonomy Math. Program. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Sunyoung Kim, Masakazu Kojima Solving polynomial least squares problems via semidefinite programming relaxations. Search on Bibsonomy J. Global Optimization The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Martin Mevissen, Masakazu Kojima Sdp Relaxations for Quadratic Optimization Problems Derived from Polynomial Optimization Problems. Search on Bibsonomy APJOR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Masakazu Kojima Exploiting Structured Sparsity in Large Scale Semidefinite Programming Problems. Search on Bibsonomy ICMS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Sunyoung Kim, Masakazu Kojima, Hayato Waki Exploiting Sparsity in SDP Relaxation for Sensor Network Localization. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Sunyoung Kim, Masakazu Kojima, Philippe L. Toint Recognizing underlying sparsity in optimization. Search on Bibsonomy Math. Program. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Mathematics Subject Classification (2000) 90C30, 65K05, 90C22
1Hayato Waki, Sunyoung Kim, Masakazu Kojima, Masakazu Muramatsu, Hiroshi Sugimoto Algorithm 883: SparsePOP---A Sparse Semidefinite Programming Relaxation of Polynomial Optimization Problems. Search on Bibsonomy ACM Trans. Math. Softw. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Matlab software package, polynomial optimization problem, semidefinite programming relaxation, sums-of-squares optimization, Global optimization, sparsity
1Tomohiko Mizutani, Akiko Takeda, Masakazu Kojima Dynamic Enumeration of All Mixed Cells. Search on Bibsonomy Discrete & Computational Geometry The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Masakazu Kojima, Masakazu Muramatsu An Extension of Sums of Squares Relaxations to Polynomial Optimization Problems Over Symmetric Cones. Search on Bibsonomy Math. Program. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF Polynomial optimization problem, Symmetric cone, Euclidean Jordan algebra, Global optimization, Semidefinite program, Sum of squares, Conic program
1Hayato Waki, Sunyoung Kim, Masakazu Kojima, Masakazu Muramatsu Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Kazuhide Nakata, Makoto Yamashita, Katsuki Fujisawa, Masakazu Kojima A parallel primal-dual interior-point method for semidefinite programs using positive definite matrix completion. Search on Bibsonomy Parallel Computing The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Sunyoung Kim, Masakazu Kojima, Hayato Waki Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Masakazu Kojima, Sunyoung Kim, Hayato Waki Sparsity in sums of squares of polynomials. Search on Bibsonomy Math. Program. The full citation details ... 2005 DBLP  DOI  BibTeX  RDF Sums of squares of polynomial, Polynomial optimization problem, Semidefinite program, Sparsity
1Takayuki Gunji, Sunyoung Kim, Masakazu Kojima, Akiko Takeda, Katsuki Fujisawa, Tomohiko Mizutani PHoM - a Polyhedral Homotopy Continuation Method for Polynomial Systems. Search on Bibsonomy Computing The full citation details ... 2004 DBLP  DOI  BibTeX  RDF homotopy continuation method, polyhedral homotopy, Polynomial, software package, equation, numerical experiment
1Katsuki Fujisawa, Masakazu Kojima, Akiko Takeda, Makoto Yamashita High Performance Grid and Cluster Computing for Some Optimization Problems. Search on Bibsonomy SAINT Workshops The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Makoto Yamashita, Katsuki Fujisawa, Masakazu Kojima SDPARA: SemiDefinite Programming Algorithm paRAllel version. Search on Bibsonomy Parallel Computing The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Kim-Chuan Toh, Masakazu Kojima Solving Some Large Scale Semidefinite Programs via the Conjugate Residual Method. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Mituhiro Fukuda, Masakazu Kojima, Masayuki Shida Lagrangian Dual Interior-Point Methods for Semidefinite Programs. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Masakazu Kojima, Levent Tunçel On the finite convergence of successive SDP relaxation methods. Search on Bibsonomy European Journal of Operational Research The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Mituhiro Fukuda, Masakazu Kojima, Kazuo Murota, Kazuhide Nakata Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Masakazu Kojima, Akiko Takeda Complexity Analysis of Successive Convex Relaxation Methods for Nonconvex Sets. Search on Bibsonomy Math. Oper. Res. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Masakazu Kojima, Levent Tunçel Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets. Search on Bibsonomy SIAM Journal on Optimization The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Masakazu Kojima, Masayuki Shida, Susumu Shindoh Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs. Search on Bibsonomy Math. Program. The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Katsuki Fujisawa, Masakazu Kojima, Kazuhide Nakata Exploiting sparsity in primal-dual interior-point methods for semidefinite programming. Search on Bibsonomy Math. Program. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Masakazu Kojima, Toshihito Noma, Akiko Yoshise Global convergence in infeasible-interior-point algorithms. Search on Bibsonomy Math. Program. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Masakazu Kojima, Shinji Mizuno, Akiko Yoshise A little theorem of the big Mu in interior point algorithms. Search on Bibsonomy Math. Program. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Masakazu Kojima, Nimrod Megiddo, Shinji Mizuno Theoretical convergence of large-step primal-dual interior point algorithms for linear programming. Search on Bibsonomy Math. Program. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Tohru Ishihara, Masakazu Kojima On the big Mu in the affine scaling algorithm. Search on Bibsonomy Math. Program. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Masakazu Kojima, Nimrod Megiddo, Shinji Mizuno A primal-dual infeasible-interior-point algorithm for linear programming. Search on Bibsonomy Math. Program. The full citation details ... 1993 DBLP  DOI  BibTeX  RDF
1Masakazu Kojima, Nimrod Megiddo, Yinyu Ye An interior point potential reduction algorithm for the linear complementarity problem. Search on Bibsonomy Math. Program. The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Masakazu Kojima, Shinji Mizuno, Akiko Yoshise An O(square root(n) * L) iteration potential reduction algorithm for linear complementarity problems. Search on Bibsonomy Math. Program. The full citation details ... 1991 DBLP  DOI  BibTeX  RDF
1Masakazu Kojima, Nimrod Megiddo, Toshihito Noma, Akiko Yoshise A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems Search on Bibsonomy 1991   DOI  RDF
1Masakazu Kojima, Shinji Mizuno, Akiko Yoshise Ellipsoids that Contain All the Solutions of a Positive Semi-Definite Linear Complementarity Problem. Search on Bibsonomy Math. Program. The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1Masakazu Kojima Determining Basic Variables of Optimal Solutions in Karmarkar's New LP Algorithm. Search on Bibsonomy Algorithmica The full citation details ... 1986 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #34 of 34 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.