Urmăriți
Masakazu Kojima
Masakazu Kojima
Tokyo Institute of Technology, Chuo University
Adresă de e-mail confirmată pe is.titech.ac.jp - Pagina de pornire
Titlu
Citat de
Citat de
Anul
A primal-dual interior point algo-rithm for linear programming
M Kojima
Progress in mathematical programming: Interior point and related methods …, 1989
9251989
A unified approach to interior point algorithms for linear complementarity problems: A summary
M Kojima, N Megiddo, T Noma, A Yoshise
Operations Research Letters 10 (5), 247-254, 1991
6901991
Interior-point methods for the monotone semidefinite linear complementarity problem in symmetric matrices
M Kojima, S Shindoh, S Hara
SIAM Journal on Optimization 7 (1), 86-125, 1997
6421997
A polynomial-time algorithm for a class of linear complementarity problems
M Kojima, S Mizuno, A Yoshise
Mathematical programming 44, 1-26, 1989
5521989
Sums of squares and semidefinite program relaxations for polynomial optimization problems with structured sparsity
H Waki, S Kim, M Kojima, M Muramatsu
SIAM Journal on Optimization 17 (1), 218-242, 2006
5402006
Strongly stable stationary solutions in nonlinear programs
M Kojima
Analysis and computation of fixed points, 93-138, 1980
4351980
Exploiting sparsity in semidefinite programming via matrix completion I: General framework
M Fukuda, M Kojima, K Murota, K Nakata
SIAM Journal on optimization 11 (3), 647-674, 2001
4322001
A primal—dual infeasible-interior-point algorithm for linear programming
M Kojima, N Megiddo, S Mizuno
Mathematical programming 61 (1), 263-280, 1993
4311993
An iteration potential reduction algorithm for linear complementarity problems
M Kojima, S Mizuno, A Yoshise
Mathematical programming 50 (1), 331-342, 1991
3041991
Implementation and evaluation of SDPA 6.0 (semidefinite programming algorithm 6.0)
M Yamashita, K Fujisawa, M Kojima
Optimization Methods and Software 18 (4), 491-505, 2003
2832003
A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems
M Kojima
Lecture Notes in Computer Science/Springer-Verlag 538, 1991
2701991
Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
K Fujisawa, M Kojima, K Nakata
Mathematical Programming 79, 235-253, 1997
2421997
Exploiting sparsity in semidefinite programming via matrix completion II: Implementation and numerical results
K Nakata, K Fujisawa, M Fukuda, M Kojima, K Murota
Mathematical Programming 95, 303-327, 2003
2382003
Sdpa (semidefinite programming algorithm) user’s manual—version 6.2. 0
K Fujisawa, M Kojima, K Nakata, M Yamashita
Department of Mathematical and Com-puting Sciences, Tokyo Institute of …, 2002
2362002
Extension of Newton and quasi-Newton methods to systems of PC^ 1 equations
M Kojima, S Shindo
Journal of the Operations Research Society of Japan 29 (4), 352-375, 1986
2361986
Semidefinite programming relaxation for nonconvex quadratic programs
T Fujie, M Kojima
Journal of Global optimization 10, 367-380, 1997
2191997
Algorithm 883: SparsePOP---a sparse semidefinite programming relaxation of polynomial optimization problems
H Waki, S Kim, M Kojima, M Muramatsu, H Sugimoto
ACM Transactions on Mathematical Software (TOMS) 35 (2), 1-13, 2008
2162008
Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxations
S Kim, M Kojima
Computational optimization and applications 26, 143-154, 2003
2062003
Second order cone programming relaxation of nonconvex quadratic optimization problems
S Kim, M Kojima
Optimization methods and software 15 (3-4), 201-224, 2001
1792001
Homotopy continuation methods for nonlinear complementarity problems
M Kojima, N Megiddo, T Noma
Mathematics of operations research 16 (4), 754-774, 1991
1721991
Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.
Articole 1–20