Second order cone programming relaxation of a positive semidefinite constraint. - Sunyoung Kim; Masakazu Kojima; Makoto Yamashita (Optim. Methods Softw., 2003)

Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0). - Makoto Yamashita; Katsuki Fujisawa; Masakazu Kojima (Optim. Methods Softw., 2003)

SDPARA: SemiDefinite Programming Algorithm paRAllel version. - Makoto Yamashita; Katsuki Fujisawa; Masakazu Kojima (Parallel Comput., 2003)

High Performance Grid and Cluster Computing for Some Optimization Problems. - Katsuki Fujisawa; Masakazu Kojima; Akiko Takeda; Makoto Yamashita (SAINT Workshops, 2004)

Gain Scheduling Controller Design for Two-Rotor Hovering System and its Experimental Verification. - Makoto Yamashita; Masami Saeki; Nobutaka Wada; Izumi Masubuchi (J. Robotics Mechatronics, 2006)

A parallel primal-dual interior-point method for semidefinite programs using positive definite matrix completion. - Kazuhide Nakata; Makoto Yamashita; Katsuki Fujisawa; Masakazu Kojima (Parallel Comput., 2006)

Large-scale semidefinite programs in electronic structure calculation. - Mituhiro Fukuda; Bastiaan J. Braams; Maho Nakata; Michael L. Overton; Jerome K. Percus; Makoto Yamashita; Zhengji Zhao (Math. Program., 2007)

Efficient parallel software for large-scale Semidefinite Programs. - Makoto Yamashita; Katsuki Fujisawa (CACSD, 2010)

Development of a Low-Cost, High-Speed Stereo Vision System Using a CMOS Imager and DSP. - Makoto Yamashita; Noriaki Maru (Int. J. Autom. Technol., 2011)

Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion. - Sunyoung Kim; Masakazu Kojima; Martin Mevissen; Makoto Yamashita (Math. Program., 2011)

High-performance general solver for extremely large-scale semidefinite programming problems. - Katsuki Fujisawa; Hitoshi Sato; Satoshi Matsuoka; Toshio Endo; Makoto Yamashita; Maho Nakata (SC, 2012)

Algorithm 920: SFSDP: A Sparse Version of Full Semidefinite Programming Relaxation for Sensor Network Localization Problems. - Sunyoung Kim; Masakazu Kojima; Hayato Waki; Makoto Yamashita (ACM Trans. Math. Softw., 2012)

Algorithm 925: Parallel Solver for Semidefinite Programming Problem having Sparse Schur Complement Matrix. - Makoto Yamashita; Katsuki Fujisawa; Mituhiro Fukuda; Kazuhide Nakata; Maho Nakata (ACM Trans. Math. Softw., 2012)

Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables. - Tomohiko Mizutani; Makoto Yamashita (J. Glob. Optim., 2013)

Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization. - Masakazu Kojima; Makoto Yamashita (Math. Program., 2013)

Fast implementation for semidefinite programs with positive matrix completion. - Makoto Yamashita; Kazuhide Nakata (Optim. Methods Softw., 2015)

Procedural surgical skill assessment in laparoscopic training environments. - Munenori Uemura; Pierre Jannin; Makoto Yamashita; Morimasa Tomikawa; Tomohiko Akahoshi; Satoshi Obata; Ryota Souzaki; Satoshi Ieiri; Makoto Hashizume (Int. J. Comput. Assist. Radiol. Surg., 2016)

Registration using 3D-printed rigid templates outperforms manually scanned surface matching in image-guided temporal bone surgery. - Makoto Yamashita; Nozomu Matsumoto; Byunghyun Cho; Noritaka Komune; Shinya Onogi; Jongseung Lee; Jordan Bano; Tomohiko Akahoshi; Makoto Hashizume (Int. J. Comput. Assist. Radiol. Surg., 2016)

An efficient second-order cone programming approach for optimal selection in tree breeding. - Makoto Yamashita; Tim J. Mullin; Sena Safarina (Optim. Lett., 2018)

An arc-search $${ mathcal {O}}(nL)$$ O ( n L ) infeasible-interior-point algorithm for linear programming. - Yaguang Yang; Makoto Yamashita (Optim. Lett., 2018)

On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems. - Hikaru Komeiji; Sunyoung Kim; Makoto Yamashita (Comput. Optim. Appl., 2019)

Sparsity Exploitation of Accelerated Modulus-Based Gauss-Seidel Method for Interactive Rigid Body Simulations. - Shugo Miyamoto; Makoto Yamashita (CoRR, 2019)

Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods. - Masaki Kimizuka; Sunyoung Kim; Makoto Yamashita (J. Glob. Optim., 2019)

A dual spectral projected gradient method for log-determinant semidefinite problems. - Takashi Nakagaki; Mituhiro Fukuda; Sunyoung Kim; Makoto Yamashita (Comput. Optim. Appl., 2020)

Conic relaxation approaches for equal deployment problems. - Sena Safarina; Satoko Moriguchi; Tim J. Mullin; Makoto Yamashita (Discret. Appl. Math., 2020)

Logarithmic Regret for Distributed Online Subgradient Method over Unbalanced Directed Networks. - Makoto Yamashita; Naoki Hayashi; Takeshi Hatanaka; Shigemasa Takai (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021)

Dynamic Regret Analysis for Event-Triggered Distributed Online Optimization Algorithm. - Makoto Yamashita; Naoki Hayashi; Shigemasa Takai (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021)

Exact SDP relaxations of quadratically constrained quadratic programs with forest structures. - Godai Azuma; Mituhiro Fukuda; Sunyoung Kim; Makoto Yamashita (J. Glob. Optim., 2022)

An infeasible interior-point arc-search algorithm for nonlinear constrained optimization. - Makoto Yamashita; Einosuke Iida; Yaguang Yang (Numer. Algorithms, 2022)

Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems. - Heejune Sheen; Makoto Yamashita (Optim. Methods Softw., 2022)

Exact SDP relaxations for quadratic programs with bipartite graph structures. - Godai Azuma; Mituhiro Fukuda; Sunyoung Kim; Makoto Yamashita (J. Glob. Optim., 2023)

An inexact infeasible arc-search interior-point method for linear programming problems. - Einosuke Iida; Makoto Yamashita (CoRR, 2024)

An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems. - Einosuke Iida; Makoto Yamashita (Comput. Optim. Appl., 2024)

T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization. - Hiroki Marumo; Sunyoung Kim; Makoto Yamashita (Comput. Optim. Appl., 2024)

Rank-one matrix completion via high-rank matrices in sum-of-squares relaxations. - Godai Azuma; Sunyoung Kim; Makoto Yamashita (J. Glob. Optim., 2025)