Makoto Yamashita
Orcid: 0000-0002-8409-036X
According to our database1,
Makoto Yamashita
authored at least 33 papers
between 2003 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
An inexact infeasible arc-search interior-point method for linear programming problems.
CoRR, 2024
2023
J. Glob. Optim., July, 2023
An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems.
CoRR, 2023
2022
Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems.
Optim. Methods Softw., 2022
An infeasible interior-point arc-search algorithm for nonlinear constrained optimization.
Numer. Algorithms, 2022
Exact SDP relaxations of quadratically constrained quadratic programs with forest structures.
J. Glob. Optim., 2022
2021
Dynamic Regret Analysis for Event-Triggered Distributed Online Optimization Algorithm.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021
Logarithmic Regret for Distributed Online Subgradient Method over Unbalanced Directed Networks.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2021
2020
Discret. Appl. Math., 2020
Comput. Optim. Appl., 2020
2019
Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods.
J. Glob. Optim., 2019
Sparsity Exploitation of Accelerated Modulus-Based Gauss-Seidel Method for Interactive Rigid Body Simulations.
CoRR, 2019
On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems.
Comput. Optim. Appl., 2019
2018
An arc-search $${\mathcal {O}}(nL)$$ O ( n L ) infeasible-interior-point algorithm for linear programming.
Optim. Lett., 2018
An efficient second-order cone programming approach for optimal selection in tree breeding.
Optim. Lett., 2018
2016
Registration using 3D-printed rigid templates outperforms manually scanned surface matching in image-guided temporal bone surgery.
Int. J. Comput. Assist. Radiol. Surg., 2016
Int. J. Comput. Assist. Radiol. Surg., 2016
2015
Optim. Methods Softw., 2015
2013
Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization.
Math. Program., 2013
Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables.
J. Glob. Optim., 2013
2012
Algorithm 925: Parallel Solver for Semidefinite Programming Problem having Sparse Schur Complement Matrix.
ACM Trans. Math. Softw., 2012
Algorithm 920: SFSDP: A Sparse Version of Full Semidefinite Programming Relaxation for Sensor Network Localization Problems.
ACM Trans. Math. Softw., 2012
High-performance general solver for extremely large-scale semidefinite programming problems.
Proceedings of the SC Conference on High Performance Computing Networking, 2012
2011
Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion.
Math. Program., 2011
Development of a Low-Cost, High-Speed Stereo Vision System Using a CMOS Imager and DSP.
Int. J. Autom. Technol., 2011
2010
Proceedings of the 2010 IEEE International Symposium on Computer-Aided Control System Design, 2010
2007
Math. Program., 2007
2006
A parallel primal-dual interior-point method for semidefinite programs using positive definite matrix completion.
Parallel Comput., 2006
Gain Scheduling Controller Design for Two-Rotor Hovering System and its Experimental Verification.
J. Robotics Mechatronics, 2006
2004
Proceedings of the 2004 Symposium on Applications and the Internet Workshops (SAINT 2004 Workshops), 2004
2003
Optim. Methods Softw., 2003
Optim. Methods Softw., 2003