Naoki Ito
- Fast Retailing Co., Ltd.
- E-mail: napinocoatgmail.com (Previous addresses: naoki_ito mist.i.u-tokyo.ac.jp, pico a8.keio.jp)
Employment
- Manager of Data Science
- Fast Retailing Co., Ltd.
- September 2021 - now.
- Data Scientist
- Fast Retailing Co., Ltd.
- April 2018 - August 2021.
- Research Fellow
- Japan Society for the Promotion of Science
- April 2017 - March 2018.
- Research Assistant
- Graduate School of Information Science and Technology, The University of Tokyo
- April 2016 - March 2017.
- Research Assistant
- Optimal Modeling Project of JST CREST
- May 2015 - March 2017.
- Research Member
- Energy Management System Project of JST CREST, Ohmori Team
- Jun 2013 - December 2014.
Education
- Ph.D. in Information Science and Technology
- Graduate School of Information Science and Technology, The University of Tokyo, Japan
- April 2015 - March 2018.
- Research Student
- Institute of Statitical Mathematics, Japan
- April 2017 - March 2018.
- M. Eng.
- Graduate School of Science for Open and Environment Systems, Keio University, Yokohama, Japan
- April 2013 - March 2015.
- Special Research Student
- Graduate School of Information Science and Technology, The University of Tokyo, Japan
- April 2013 - March 2014.
- B. Eng. Summa Cum Laude
- Department of Administration Engineering, Keio University, Yokohama, Japan
- April 2009 - March 2013.
Published works
Software
- BBCPOP: A Sparse Doubly Nonnegative Relaxation of Polynomial Optimization Problems with Binary, Box and Complementarity Constraints, https://sites.google.com/site/bbcpop1/, March 2018.
Refereed Journal Papers
- N. Ito, S. Kim, M. Kojima, A. Takeda, and K.-C. Toh: "Algorithm 996: BBCPOP: A Sparse Doubly Nonnegative Relaxation of Polynomial Optimization Problems With Binary, Box, and Complementarity Constraints", ACM Transactions on Mathematical Software, Vol. 45, No. 3, Article 34.
- N. Ito, S. Kim, M. Kojima, A. Takeda, and K.-C. Toh: "Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems", Journal of Global Optimization, 2018.
- N. Ito, A. Takeda, and K.-C. Toh: "A Unified Formulation and Fast Accelerated Proximal Gradient Method for Classification", Journal of Machine Learning Research, 18(16):1-49, 2017.
- S. Sakaue, A. Takeda, S. Kim, and N. Ito: "Exact SDP Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems", SIAM Journal on Optimization, 27(1):565-582, 2017.
Refereed Conference Proceedings
- N. Ito, A. Takeda, and T. Namerikawa: "Convex Hull Pricing for Demand Response in Electricity Markets", Proceedings in the 4th IEEE International Conference on Smart Grid Communications (SmartGridComm), Vancouver, Canada, October, 2013.
Preprints/Technical Reports
- K. Fujii, N. Ito, S. Kim, M. Kojima, H.D. Mittelmann, Y. Shinano, and K.-C. Toh: "MatQapNB User Guide: A branch-and-bound program for QAPs in Matlab with the Newton-Bracketing method", http://www.optimization-online.org/DB_HTML/2021/06/8467.html, June 2021.
- K. Fujii, N. Ito, S. Kim, M. Kojima, Y. Shinano, and K.-C. Toh: "Solving Challenging Large Scale QAPs", ZIB-Report urn:nbn:de:0297-zib-81303, Zuse Institute Berlin, January 2021.
- N. Ito, S. Kim, M. Kojima, A. Takeda, and K.-C. Toh: "BBCPOP: A Sparse Doubly Nonnegative Relaxation of Polynomial Optimization Problems with Binary, Box and Complementarity Constraints", https://arxiv.org/abs/1804.00761, April 2018.
- N. Ito, S. Kim, M. Kojima, A. Takeda, and K.-C. Toh: "Equivalences and Differences in Conic Relaxations of Combinatorial Quadratic Optimization Problems", http://www.optimization-online.org/DB_HTML/2017/07/6134.html, July 2017. (Detailed numerical results on QAP are available here.)
- S. Sakaue, A. Takeda, S. Kim, and N. Ito: "Exact SDP Relaxations with Truncated Moment Matrix for Binary Polynomial Optimization Problems", Mathematical Engineering Technical Reports, University of Tokyo, METR 2016-01, January 2016.
- N. Ito, A. Takeda, and K.-C. Toh: "A Fast Unified Classification Algorithm Based on Accelerated Proximal Gradient Method", Mathematical Engineering Technical Reports, University of Tokyo, METR 2015-18, May 2015.
- N. Ito, A. Takeda, and T. Namerikawa, "A New Dynamic Pricing Model based on Convex Hull Pricing", arXiv.org e-Print archive, arxiv:1310.4962, 2013.
Talks
- N. Ito, S. Kim, M. Kojima, A. Takeda, and K.-C. Toh: "A Stable Lagrangian DNN Relaxation Method for Polynomial Optimization Problems," SIAM Conference on Optimization, Vancouver, Canada, May 2017.
- N. Ito, A. Takeda, and K.-C. Toh: "Fast Accelerated Proximal Gradient Method and Its Application to Unified Binary Classification," the Fifth International Conference on Continuous Optimization (ICCOPT 2016), Roppongi, Tokyo, Japan, August 2016.
- N. Ito, A. Takeda, and K.-C. Toh: "Unified Binary Classification Algorithm based on Practical Accelerated Proximal Gradient Methods," the 22nd International Symposium on Mathematical Programming (ISMP 2015), Pittsburgh, Pennsylvania, U.S., July 2015.
- N. Ito, A. Takeda, and T. Namerikawa: "Convex Hull Pricing for Demand Response in Electricity Markets," Proceedings in the 4th IEEE International Conference on Smart Grid Communications (SmartGridComm), Vancouver, Canada, October, 2013.
- and talks in Japanese.
Honors and Awards
- Award for Research Excellence - Graduate School of Science for Open and Environment Systems, Keio University, March 2015
- Graduating summa cum laude - Keio University, March 2013