• Technical Reports
• Proceeding
• etc.
  

Technical Reports

• Makoto Yamashita, Kazuhide Nakata,
  Fast implementation for semidefinite programs with positive matrix completion
  Technical Report B-474,
  Department of Mathematical and Computing Sciences, Tokyo Institute of Technology (2013).
  
  
• Mirai Tanaka, Kazuhide Nakata,
  Successive projection method for well-conditioned matrix approximation problems, Technical Report 2013-12, Department of Industrial Engineering and Management, Tokyo Institute of Technology (2013).
  
  
• Mirai Tanaka, Kazuhide Nakata, and Hayato Waki,
  Numerical reduction method for doubly nonnegative optimization problems,
  Technical Report 2013-2, Department of Industrial Engineering and Management, Tokyo Institute of Technology (2013).
  
  
• Tanaka Mirai, and Nakata Kazuhide,
  Positive definite matrix approximation with condition number constraint,
  Technical Report 2012-6, Department of Industrial Engineering and Management, Tokyo Institute of Technology (2012).
  
  
• Tanaka Mirai, Nakata Kazuhide and Waki Hayato,
  Application of a facial reduction algorithm and an inexact primal-dual interior-point method for doubly nonnegative relaxation for mixed binary nonconvex quadratic optimization problems,
  Technical Report 2011-11, Department of Industrial Engineering and Management, Tokyo Institute of Technology (2011).
  
  
• 中田和秀,
  半正定値計画の問題記述＆解決能力,
  オペレーションズ・リサーチ, 55巻 (2010), 387-392.
  
  
• Katsuki Fujisawa, Mituhiro Fukuda, Kazuhiro Kobayashi, Kazuhide Nakata, Maho Nakata, Makoto Yamashita,
  Parallel solver for SemiDefinite Programming having sparse Schur complement matrix
  Technical Report B-463,
  Department of Mathematical and Computing Sciences, Tokyo Institute of Technology (2010).
  
  
• Makoto Yamashita, Katsuki Fujisawa, Kazuhide Nakata, Maho Nakata, Mituhiro Fukuda, Kazuhiro Kobayashi, and Kazushige Goto,
  A high-performance software package for semidefinite programs: SDPA 7
  Technical Report B-460,
  Department of Mathematical and Computing Sciences, Tokyo Institute of Technology (2010).
  
  
• Katsuki Fujisawa, Mituhiro Fukuda, Kazuhiro Kobayashi, Masakazu Kojima, Kazuhide Nakata, Maho Nakata, and Makoto Yamashita,
  SDPA (SemiDefinite Programming Algorithm) User's Manual --- Version 7.0.5,
  Technical Report B-448,
  Department of Mathematical and Computing Sciences, Tokyo Institute of Technology (2008).
  
  
• Kazuhiro Kobayashi, Kazuhide Nakata and Masakazu Kojima,
  A Conversion of an SDP Having Free Variables into the Standard Form SDP,
  Technical Report B-416,
  Department of Mathematical and Computing Sciences, Tokyo Institute of Technology (2005).
  
  
• Makoto Yamashita, Katsuki Fujisawa, Kazuhide Nakata and Masakazu Kojima,
  Parallel Primal-Dual Interior-Point Methods for SemiDefinite Programs,
  Technical Report B-415,
  Department of Mathematical and Computing Sciences, Tokyo Institute of Technology (2005).
  
  
• Katsuki Fujisawa, Mituhiro Fukuda, Masakazu Kojima, Kazuhide Nakata, and Makoto Yamashita,
  SDPA-C (SemiDefinite Programming Algorithm -- Completion method) User's Manual --- Version 6.10,
  Technical Report B-409,
  Department of Mathematical and Computing Sciences, Tokyo Institute of Technology (2004).
  
  
• 稲場広記, 水野眞治, 中田和秀,
  2次錘計画問題によるロバスト・トラッキングエラー最小化,
  CRAFT Preprint Series 2004-9,
  Center for Research in Advanced Financial Technology. Tokyo Institute of Technology (2004).
  
  
• Katsuki Fujisawa, Mituhiro Fukuda, and Kazuhide Nakata,
  Preprocessing Sparse Semidefinite Programs via Matrix Completion,
  Technical Report B-401,
  Department of Mathematical and Computing Sciences, Tokyo Institute of Technology (2004).
  
  
• Kazuhide Nakata, Makoto Yamashita, Katsuki Fujisawa, and Masakazu Kojima,
  A Parallel Primal-Dual Interior-Point Method for Semidefinite Programs using Positive Definite Matrix Completion,
  Technical Report B-398,
  Department of Mathematical and Computing Sciences, Tokyo Institute of Technology (2003).
  
  
• Kazuhide Nakata, Katsuki Fujisawa, Mituhiro Fukuda, Masakazu Kojima, and Kazuo Murota,
  Exploiting Sparsity in Semidefinite Programming via Matrix Completion II: Implementation and Numerical Results,
  Technical Report B-368,
  Department of Mathematical and Computing Sciences, Tokyo Institute of Technology (2001).
  
  
• Satoshi Matsuyama, Satoshi Nakamura, Katsuki Fujisawa, Kazuhide Nakata and Masakazu Kojima,
  SDPA-M (SemiDefinite Programming Algorithm in MATLAB) User's Manual Version 1.00,
  Technical Report B-359,
  Department of Mathematical and Computing Sciences, Tokyo Institute of Technology (2000).
  
  
• Mituhiro Fukuda, Masakazu Kojima, Kazuo Murota and Kazuhide Nakata,
  Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework,
  Technical Report B-358,
  Department of Mathematical and Computing Sciences, Tokyo Institute of Technology (1999).
  
  
• Katsuki Fujisawa, Masakazu Kojima and Kazuhide Nakata,
  Using the Conjugate Gradient Method in Interior-Points Methods for Semidefinite Programs (in Japanese),
  Technical Report B-339,
  Department of Mathematical and Computing Sciences, Tokyo Institute of Technology (1998, Revised 1998).
  
  
• Katsuki Fujisawa, Masakazu Kojima and Kazuhide Nakata,
  Numerical Evaluation of the SDPA (Semidefinite Programming Algorithm),
  Technical Report B-330,
  Department of Mathematical and Computing Sciences, Tokyo Institute of Technology (1997, Revised 1998).
  
  
• Katsuki Fujisawa, Masakazu Kojima and Kazuhide Nakata,
  Exploiting Sparsity in Primal-Dual Interior-Point Methods for Semidefinite Programming,
  Technical Report B-328,
  Department of Mathematical and Computing Sciences, Tokyo Institute of Technology (1997).
  
  
• Katsuki Fujisawa, Masakazu Kojima and Kazuhide Nakata,
  SDPA (Semidefinite Programming Algorithm) - User's Manual -,
  Technical Report B-308,
  Department of Mathematical and Computing Sciences, Tokyo Institute of Technology (1995, Revised 1996, Revised 1999).
  

Proceedings

• 小林健, 高野祐一, 宮代隆平, 中田和秀,
  多重共線性を考慮した回帰式の変数選択--混合整数半正定値計画法を用いた解法--,
  京都大学数理解析研究所講究録 1931 最適化アルゴリズムの進展・理論・応用・実装, 169--183 (2014).
  
  
• Ahmed Karam, Amr Eltawil, T. Mizutani, K. Nakata, N. A. Harraz,
  Quay crane allocation problem with the internal truck capacity constraint in container terminals,
  京都大学数理解析研究所講究録 1931 最適化アルゴリズムの進展・理論・応用・実装, 94--106 (2014).
  
  
• 田中未来, 中田和秀,
  条件数制約つき正定値行列近似問題について,
  京都大学数理解析研究所講究録 1829 最適化手法の理論と応用の繋がり (2013).
  
  
• 田中未来, 中田和秀, 脇隼人,
  0-1 整数変数を含む非凸 2 次最適化問題の非負半正定値緩和に対する面的縮小と効率的解法,
  京都大学数理解析研究所講究録 1773 最適化手法の深化と広がり, (2012) 186--197.
  
  
• 中田 和秀,
  大規模な半正定値計画問題の解法,
  第17回RAMPシンポジウム論文集，139-153,２００５年１０月.
  
  
• 中田 和秀,
  大規模線形方程式を解くためのクリロフ部分空間法の前処理,
  数理解析研究所講究録 １２２８「産業上の非線形問題と数値シュミレーションと領域分割法」 52-64, ２００２年９月.
  
  
• 中田 和秀, 張 紹良,
  半正定値計画問題に対するクリロフ部分空間法の適用,
  情報処理学会研究報告 2001-HPC-87, 13-18, ２００１年７月.
  
  
• Kazuhide Nakata, Katsuki Fujisawa, Mituhiro Fukuda, Masakazu Kojima and Kazuo Murota,
  Matrix Completion and Semidefinite Programming,
  統計数理研究所共同研究レポート１３５ 「最適化：モデリングとアルゴリズム１４」,  223-237,２０００年１２月.
  
  
• Kazuhide Nakata, Katsuki Fujisawa, Mituhiro Fukuda, Masakazu Kojima and Kazuo Murota,
  Solving Sparse Semidefinite Programs by Matrix Completion (part II),
  数理解析研究所講究録１１７４ 「最適化の数理科学」 130-137, ２０００年１０月.
  
  
• 中田 和秀, 張 紹良, 小島 政和,
  半正定値計画問題での大規模線形方程式系に対する前処理付き共役勾配法,
  数理解析研究所講究録１１１４ 「最適化のための連続と離散数理」, 172-183, １９９９年１１月.
  
  
• 中田 和秀, 藤沢 克樹, 小島 政和,
  Semidefinite Programming with the Conjugate Gradient Method,
  統計数理研究所共同研究レポート１１３ 「最適化：モデリングとアルゴリズム１２」, 224-247,１９９８年１１月

Etc.

• 中田 和秀, 梅谷俊治,
  第23回企業事例交流会ルポ,
  オペレーションズ・リサーチ, 54 (2009) 504-505.
  
  
• 山下 真, 中田 和秀, 後藤 順哉, 井床 利生,
  平成17年度春季研究発表会ルポ,
  オペレーションズ・リサーチ, 50 (2005) 500-504.
  
  
• 中田 和秀, 下平 英寿, 武田 朗子, 小林 和博,
  第１５回RAMPシンポジウムルポ,
  オペレーションズ・リサーチ, 49 (2004) 256-257.