| Komei Fukuda | |
| Birth Place: | Japan |
| Fields: | Mathematics |
| Workplaces: | |
| Education: | |
| Thesis Title: | Oriented matroid programming |
| Thesis Year: | 1982 |
| Thesis Url: | https://people.inf.ethz.ch/fukudak/Doc_pub/fukuda1982thesis.pdf |
| Doctoral Advisor: | Jack Edmonds |
Komei Fukuda (ja|福田 公明, born 1951)[1] is a Japanese mathematician known for his contributions to optimization,polyhedral computation and oriented matroid theory. Fukuda is a professor in optimization and computational geometryin the Department of Mathematics and in the Institute of Theoretical Computer Science at ETH Zurich.
Fukuda studied administration engineering at Keio University, graduating in 1974 and earning a master's degree in 1976. He began doctoral work in the same field, but in 1976 transferred to the University of Waterloo to their PhD program in combinatorics and optimization.[2] He completed his PhD in 1982, with Jack Edmonds as his doctoral advisor.
After completing his PhD, he returned to Japan as an assistant professor at the Tokyo Institute of Technology. He moved to the University of Tsukuba as an associate professor in 1989. After visiting the École Polytechnique Fédérale de Lausanne and ETH Zurich in 1993–1994 and 1995–1996 respectively, as an invited professor, he took a joint position as a professor in the departments of mathematics at both universities in 1996. He also held a tenured professorship at McGill University in 2002–2003. In 2008 he gave up his position at the École Polytechnique Fédérale de Lausanne, becoming affiliated only with ETH Zurich, and since 2012 he has held a joint appointment in mathematics and computer science at ETH Zurich.[2]
Fukuda has studied finite pivot algorithms in various settings, including linear programming, linear complementarity and their combinatorial abstractions in oriented matroids. With Tamás Terlaky, Fukuda worked on a particular class of pivot algorithms, known asthe criss-cross method.[3]
With David Avis, Fukuda proposed a reverse-search algorithm for thevertex enumeration problem