Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Kazuo Murota is active.

Publication


Featured researches published by Kazuo Murota.


Siam Journal on Optimization | 2000

Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework

Mituhiro Fukuda; Masakazu Kojima; Kazuo Murota; Kazuhide Nakata

A critical disadvantage of primal-dual interior-point methods compared to dual interior-point methods for large scale semidefinite programs (SDPs) has been that the primal positive semidefinite matrix variable becomes fully dense in general even when all data matrices are sparse. Based on some fundamental results about positive semidefinite matrix completion, this article proposes a general method of exploiting the aggregate sparsity pattern over all data matrices to overcome this disadvantage. Our method is used in two ways. One is a conversion of a sparse SDP having a large scale positive semidefinite matrix variable into an SDP having multiple but smaller positive semidefinite matrix variables to which we can effectively apply any interior-point method for SDPs employing a standard block-diagonal matrix data structure. The other way is an incorporation of our method into primal-dual interior-point methods which we can apply directly to a given SDP. In Part II of this article, we will investigate an implementation of such a primal-dual interior-point method based on positive definite matrix completion, and report some numerical results.


SIAM Journal on Computing | 1985

Voronoi Diagram in the Laguerre Geometry and Its Applications

Hiroshi Imai; Masao Iri; Kazuo Murota

We extend the concept of Voronoi diagram in the ordinary Euclidean geometry for n points to the one in the Laguerre geometry for n circles in the plane, where the distance between a circle and a point is defined by the length of the tangent line, and show that there is an


Mathematics of Operations Research | 1999

M-Convex Function on Generalized Polymatroid

Kazuo Murota; Akiyoshi Shioura

O(n\log n)


Archive | 1987

Systems Analysis by Graphs and Matroids

Kazuo Murota

algorithm for this extended case. The Voronoi diagram in the Laguerre geometry may be applied to solving effectively a number of geometrical problems such as those of determining whether or not a point belongs to the union of n circles, of finding the connected components of n circles, and of finding the contour of the union of n circles. As in the case with ordinary Voronoi diagrams, the algorithms proposed here for those problems are optimal to within a constant factor. Some extensions of the problem and the algorithm from different viewpoints are also suggested.


Mathematical Programming | 2003

Exploiting sparsity in semidefinite programming via matrix completion II: Implementation and numerical results

Kazuhide Nakata; Katsuki Fujisawa; Mituhiro Fukuda; Masakazu Kojima; Kazuo Murota

The concept of M-convex function, introduced by Murota 1996, is a quantitative generalization of the set of integral points in an integral base polyhedron as well as an extension of valuated matroid of Dress and Wenzel 1990. In this paper, we extend this concept to functions on generalized polymatroids with a view to providing a unified framework for efficiently solvable nonlinear discrete optimization problems.


Mathematical Social Sciences | 2001

Discrete convexity and equilibria in economies with indivisible goods and money

Vladimir I. Danilov; Gleb A. Koshevoy; Kazuo Murota

As known, adventure and experience about lesson, entertainment, and knowledge can be gained by only reading a book. Even it is not directly done, you can know more about this life, about the world. We offer you this proper and easy way to gain those all. We offer many book collections from fictions to science at all. One of them is this systems analysis by graphs and matroids that can be your partner.


Mathematical Programming | 2000

Notes on L-/M-convex functions and the separation theorems

Satoru Fujishige; Kazuo Murota

Abstract. In Part I of this series of articles, we introduced a general framework of exploiting the aggregate sparsity pattern over all data matrices of large scale and sparse semidefinite programs (SDPs) when solving them by primal-dual interior-point methods. This framework is based on some results about positive semidefinite matrix completion, and it can be embodied in two different ways. One is by a conversion of a given sparse SDP having a large scale positive semidefinite matrix variable into an SDP having multiple but smaller positive semidefinite matrix variables. The other is by incorporating a positive definite matrix completion itself in a primal-dual interior-point method. The current article presents the details of their implementations. We introduce new techniques to deal with the sparsity through a clique tree in the former method and through new computational formulae in the latter one. Numerical results over different classes of SDPs show that these methods can be very efficient for some problems.


Machine Intelligence and Pattern Recognition | 1985

Practical use of Bucketing Techniques in Computational Geometry

Takao Asano; Masato Edahiro; Hiroshi Imai; Masao Iri; Kazuo Murota

Abstract We consider a production economy with many indivisible goods and one perfectly divisible good. The aim of the paper is to provide some light on the reasons for which equilibrium exists for such an economy. It turns out, that a main reason for the existence is that supplies and demands of indivisible goods should be sets of a class of discrete convexity. The class of generalized polymatroids provides one of the most interesting classes of discrete convexity.


SIAM Journal on Discrete Mathematics | 1996

Valuated Matroid Intersection I: Optimality Criteria

Kazuo Murota

Abstract.The concepts of L-convex function and M-convex function have recently been introduced by Murota as generalizations of submodular function and base polyhedron, respectively, and discrete separation theorems are established for L-convex/concave functions and for M-convex/concave functions as generalizations of Frank’s discrete separation theorem for submodular/supermodular set functions and Edmonds’ matroid intersection theorem. This paper shows the equivalence between Murota’s L-convex functions and Favati and Tardella’s submodular integrally convex functions, and also gives alternative proofs of the separation theorems that provide a geometric insight by relating them to the ordinary separation theorem in convex analysis.


Applied Mechanics and Engineering | 1991

Bifurcation analysis of symmetric structures using block-diagonalization

Kiyohiro Ikeda; Kazuo Murota

Techniques for using “buckets” to improve the efficiency of several computational-geometrical algorithms are described, together with examples illustrating the practical importance of the bucketing techniques. Specifically, they are applied to the problems of minimum-weight perfect matchings in the plane, two-dimensional Voronoi diagrams, point location and range search in the plane, and shortest paths in networks.

Collaboration


Dive into the Kazuo Murota's collaboration.

Top Co-Authors

Avatar

Kiyohiro Ikeda

Nagaoka University of Technology

View shared research outputs
Top Co-Authors

Avatar

Akiyoshi Shioura

Tokyo Institute of Technology

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Satoko Moriguchi

Tokyo Metropolitan University

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Top Co-Authors

Avatar
Researchain Logo
Decentralizing Knowledge