default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMakoto Yamashita
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j29]Einosuke Iida
, Makoto Yamashita:
An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems. Comput. Optim. Appl. 88(2): 643-676 (2024)- [j28]Hiroki Marumo, Sunyoung Kim, Makoto Yamashita:
T-semidefinite programming relaxation with third-order tensors for constrained polynomial optimization. Comput. Optim. Appl. 89(1): 183-218 (2024) - [i3]Einosuke Iida, Makoto Yamashita:
An inexact infeasible arc-search interior-point method for linear programming problems. CoRR abs/2403.18155 (2024) - 2023
- [j27]Godai Azuma, Mituhiro Fukuda, Sunyoung Kim, Makoto Yamashita:
Exact SDP relaxations for quadratic programs with bipartite graph structures. J. Glob. Optim. 86(3): 671-691 (2023) - [i2]Einosuke Iida, Makoto Yamashita:
An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems. CoRR abs/2303.01666 (2023) - 2022
- [j26]Godai Azuma, Mituhiro Fukuda, Sunyoung Kim, Makoto Yamashita:
Exact SDP relaxations of quadratically constrained quadratic programs with forest structures. J. Glob. Optim. 82(2): 243-262 (2022) - [j25]Makoto Yamashita, Einosuke Iida, Yaguang Yang:
An infeasible interior-point arc-search algorithm for nonlinear constrained optimization. Numer. Algorithms 89(1): 249-275 (2022) - [j24]Heejune Sheen, Makoto Yamashita:
Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems. Optim. Methods Softw. 37(2): 753-771 (2022) - 2021
- [j23]Makoto Yamashita, Naoki Hayashi, Shigemasa Takai:
Dynamic Regret Analysis for Event-Triggered Distributed Online Optimization Algorithm. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 104-A(2): 430-437 (2021) - [j22]Makoto Yamashita, Naoki Hayashi, Takeshi Hatanaka, Shigemasa Takai:
Logarithmic Regret for Distributed Online Subgradient Method over Unbalanced Directed Networks. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 104-A(8): 1019-1026 (2021) - 2020
- [j21]Takashi Nakagaki, Mituhiro Fukuda, Sunyoung Kim, Makoto Yamashita:
A dual spectral projected gradient method for log-determinant semidefinite problems. Comput. Optim. Appl. 76(1): 33-68 (2020) - [j20]Sena Safarina, Satoko Moriguchi, Tim J. Mullin, Makoto Yamashita:
Conic relaxation approaches for equal deployment problems. Discret. Appl. Math. 275: 111-125 (2020)
2010 – 2019
- 2019
- [j19]Hikaru Komeiji, Sunyoung Kim, Makoto Yamashita:
On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems. Comput. Optim. Appl. 74(2): 317-344 (2019) - [j18]Masaki Kimizuka, Sunyoung Kim, Makoto Yamashita:
Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods. J. Glob. Optim. 75(3): 631-654 (2019) - [i1]Shugo Miyamoto, Makoto Yamashita:
Sparsity Exploitation of Accelerated Modulus-Based Gauss-Seidel Method for Interactive Rigid Body Simulations. CoRR abs/1910.09873 (2019) - 2018
- [j17]Yaguang Yang, Makoto Yamashita:
An arc-search $${\mathcal {O}}(nL)$$ O ( n L ) infeasible-interior-point algorithm for linear programming. Optim. Lett. 12(4): 781-798 (2018) - [j16]Makoto Yamashita, Tim J. Mullin, Sena Safarina:
An efficient second-order cone programming approach for optimal selection in tree breeding. Optim. Lett. 12(7): 1683-1697 (2018) - 2016
- [j15]Munenori Uemura, Pierre Jannin, Makoto Yamashita, Morimasa Tomikawa, Tomohiko Akahoshi, Satoshi Obata, Ryota Souzaki, Satoshi Ieiri, Makoto Hashizume:
Procedural surgical skill assessment in laparoscopic training environments. Int. J. Comput. Assist. Radiol. Surg. 11(4): 543-552 (2016) - [j14]Makoto Yamashita, Nozomu Matsumoto, Byunghyun Cho, Noritaka Komune, Shinya Onogi, Jongseung Lee, Jordan Bano, Tomohiko Akahoshi, Makoto Hashizume:
Registration using 3D-printed rigid templates outperforms manually scanned surface matching in image-guided temporal bone surgery. Int. J. Comput. Assist. Radiol. Surg. 11(11): 2119-2127 (2016) - 2015
- [j13]Makoto Yamashita, Kazuhide Nakata:
Fast implementation for semidefinite programs with positive matrix completion. Optim. Methods Softw. 30(5): 1030-1049 (2015) - 2013
- [j12]Tomohiko Mizutani, Makoto Yamashita:
Correlative sparsity structures and semidefinite relaxations for concave cost transportation problems with change of variables. J. Glob. Optim. 56(3): 1073-1100 (2013) - [j11]Masakazu Kojima, Makoto Yamashita:
Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization. Math. Program. 138(1-2): 333-364 (2013) - 2012
- [j10]Sunyoung Kim, Masakazu Kojima, Hayato Waki, Makoto Yamashita:
Algorithm 920: SFSDP: A Sparse Version of Full Semidefinite Programming Relaxation for Sensor Network Localization Problems. ACM Trans. Math. Softw. 38(4): 27:1-27:19 (2012) - [j9]Makoto Yamashita, Katsuki Fujisawa, Mituhiro Fukuda, Kazuhide Nakata, Maho Nakata:
Algorithm 925: Parallel Solver for Semidefinite Programming Problem having Sparse Schur Complement Matrix. ACM Trans. Math. Softw. 39(1): 6:1-6:22 (2012) - [c3]Katsuki Fujisawa, Hitoshi Sato, Satoshi Matsuoka, Toshio Endo, Makoto Yamashita, Maho Nakata:
High-performance general solver for extremely large-scale semidefinite programming problems. SC 2012: 93 - 2011
- [j8]Makoto Yamashita, Noriaki Maru:
Development of a Low-Cost, High-Speed Stereo Vision System Using a CMOS Imager and DSP. Int. J. Autom. Technol. 5(3): 445-451 (2011) - [j7]Sunyoung Kim, Masakazu Kojima, Martin Mevissen, Makoto Yamashita:
Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion. Math. Program. 129(1): 33-68 (2011) - 2010
- [c2]Makoto Yamashita, Katsuki Fujisawa:
Efficient parallel software for large-scale Semidefinite Programs. CACSD 2010: 1-6
2000 – 2009
- 2007
- [j6]Mituhiro Fukuda, Bastiaan J. Braams, Maho Nakata, Michael L. Overton, Jerome K. Percus, Makoto Yamashita, Zhengji Zhao:
Large-scale semidefinite programs in electronic structure calculation. Math. Program. 109(2-3): 553-580 (2007) - 2006
- [j5]Makoto Yamashita, Masami Saeki, Nobutaka Wada, Izumi Masubuchi:
Gain Scheduling Controller Design for Two-Rotor Hovering System and its Experimental Verification. J. Robotics Mechatronics 18(5): 589-597 (2006) - [j4]Kazuhide Nakata, Makoto Yamashita, Katsuki Fujisawa, Masakazu Kojima:
A parallel primal-dual interior-point method for semidefinite programs using positive definite matrix completion. Parallel Comput. 32(1): 24-43 (2006) - 2004
- [c1]Katsuki Fujisawa, Masakazu Kojima, Akiko Takeda, Makoto Yamashita:
High Performance Grid and Cluster Computing for Some Optimization Problems. SAINT Workshops 2004: 612-615 - 2003
- [j3]Makoto Yamashita, Katsuki Fujisawa, Masakazu Kojima:
Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0). Optim. Methods Softw. 18(4): 491-505 (2003) - [j2]Sunyoung Kim, Masakazu Kojima, Makoto Yamashita:
Second order cone programming relaxation of a positive semidefinite constraint. Optim. Methods Softw. 18(5): 535-541 (2003) - [j1]Makoto Yamashita, Katsuki Fujisawa, Masakazu Kojima:
SDPARA: SemiDefinite Programming Algorithm paRAllel version. Parallel Comput. 29(8): 1053-1067 (2003)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-16 00:38 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
