Kojima M.

M. Kojima

Information about the author M. Kojima will soon be added to the site.
Found 6 papers in total
Exploiting sparsity in semidefinite programming via matrix completion II: Implementation and numerical results
Exploiting sparsity in semidefinite programming via matrix completion II: Implementation and numerical results
2003
In Part I of this series of articles, we introduced a general framework of exploiting...
Centers of monotone generalized complementarity problems
Centers of monotone generalized complementarity problems
1997
Let C be a full dimensional, closed, pointed and convex cone in a finite dimensional...
Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization
Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization
2000
Based on the authors' previous work which established theoretical foundations of two,...
Monotonicity of primal–dual interior-point algorithms for semidefinite programming problems
Monotonicity of primal–dual interior-point algorithms for semidefinite programming problems
1998
We present primal–dual interior-point algorithms with polynomial iteration...
Search directions in the SDP and the monotone SDLCP: Generalization and inexact computation
Search directions in the SDP and the monotone SDLCP: Generalization and inexact computation
1999
We propose a family of directions that generalizes many directions proposed so far in...
Optimal numbers of two kinds of kanbans in a JIT production system
Optimal numbers of two kinds of kanbans in a JIT production system
1995
The production-ordering and withdrawal kanbans are used in a Just-in-Time (JIT)...
Papers per page: