default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTakashi Tsuchiya
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j50]Wataru Namiki
, Daiki Nishioka, Takashi Tsuchiya, Kazuya Terabe:
Fast physical reservoir computing, achieved with nonlinear interfered spin waves. Neuromorph. Comput. Eng. 4(2): 24015 (2024)- [j49]Takashi Tsuchiya, Bruno F. Lourenço, Masakazu Muramatsu, Takayuki Okuno:
Closing duality gaps of SDPs completely through perturbation when singularity degree is one. Optim. Methods Softw. 39(5): 1040-1067 (2024) - 2023
- [j48]Tomoki Wada, Daiki Nishioka, Wataru Namiki, Takashi Tsuchiya, Tohru Higuchi, Kazuya Terabe:
A Redox-Based Ion-Gating Reservoir, Utilizing Double Reservoir States in Drain and Gate Nonlinear Responses. Adv. Intell. Syst. 5(9) (2023) - [j47]Wataru Namiki, Daiki Nishioka, Yu Yamaguchi, Takashi Tsuchiya, Tohru Higuchi, Kazuya Terabe:
Experimental Demonstration of High-Performance Physical Reservoir Computing with Nonlinear Interfered Spin Wave Multidetection. Adv. Intell. Syst. 5(12) (2023) - [j46]Wataru Namiki, Daiki Nishioka, Yu Yamaguchi, Takashi Tsuchiya, Tohru Higuchi, Kazuya Terabe:
Experimental Demonstration of High-Performance Physical Reservoir Computing with Nonlinear Interfered Spin Wave Multidetection. Adv. Intell. Syst. 5(12) (2023) - [j45]Takashi Tsuchiya, Bruno F. Lourenço, Masakazu Muramatsu, Takayuki Okuno:
A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms. Math. Program. 200(1): 531-568 (2023) - [j44]Daiki Nishioka, Takashi Tsuchiya, Tohru Higuchi, Kazuya Terabe:
Enhanced synaptic characteristics of H x WO3-based neuromorphic devices, achieved by current pulse control, for artificial neural networks. Neuromorph. Comput. Eng. 3(3): 34008 (2023) - [i4]Sumie Ueda, Takashi Tsuchiya, Yoshiaki Itoh:
Computational Dating for the Nuzi Cuneiform Archive: The Least Squares Constrained by Family Trees and Synchronisms. CoRR abs/2308.12883 (2023) - [i3]Daiki Nishioka, Takashi Tsuchiya, Masataka Imura, Yasuo Koide, Tohru Higuchi, Kazuya Terabe:
A high-performance deep reservoir computing experimentally demonstrated with ion-gating reservoirs. CoRR abs/2309.03028 (2023) - 2022
- [i2]Daiki Nishioka, Takashi Tsuchiya, Wataru Namiki, Makoto Takayanagi, Masataka Imura, Yasuo Koide, Tohru Higuchi, Kazuya Terabe:
Edge-Of-Chaos Learning Achieved by Ion-Electron Coupled Dynamics in an Ion-Gating Reservoir. CoRR abs/2207.02573 (2022) - [i1]Wataru Namiki, Daiki Nishioka, Yu Yamaguchi, Takashi Tsuchiya, Tohru Higuchi, Kazuya Terabe:
Experimental Demonstration of High-Performance Physical Reservoir Computing with Nonlinear Interfered Spin Wave Multi-Detection. CoRR abs/2207.03216 (2022) - 2021
- [j43]Takashi Tsuchiya, Kokichi Sugihara:
Preface. Optim. Methods Softw. 36(2-3): 259-261 (2021) - [j42]Bruno F. Lourenço, Masakazu Muramatsu, Takashi Tsuchiya:
Solving SDP completely with an interior point oracle. Optim. Methods Softw. 36(2-3): 425-471 (2021) - 2020
- [j41]Takashi Nakada, Hiroyuki Yanagihashi, Kunimaro Imai, Hiroshi Ueki, Takashi Tsuchiya, Masanori Hayashikoshi, Hiroshi Nakamura:
An Energy-Efficient Task Scheduling for Near Real-Time Systems on Heterogeneous Multicore Processors. IEICE Trans. Inf. Syst. 103-D(2): 329-338 (2020) - [c7]Koki Mukaihira, Yasuyoshi Jinno, Takashi Tsuchiya, Tetsushi Ohki, Kenta Takahashi, Wakaha Ogata, Masakatsu Nishigaki:
Communication Protocol Between Humans and Bank Server Secure Against Man-in-the-Browser Attacks. IHSI 2020: 503-509
2010 – 2019
- 2019
- [j40]Yiran Cui, Keiichi Morikuni, Takashi Tsuchiya, Ken Hayami:
Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning. Comput. Optim. Appl. 74(1): 143-176 (2019) - [j39]Bruno F. Lourenço, Tomonari Kitahara, Masakazu Muramatsu, Takashi Tsuchiya:
An extension of Chubanov's algorithm to symmetric cones. Math. Program. 173(1-2): 117-149 (2019) - 2018
- [j38]Tomonari Kitahara, Takashi Tsuchiya:
An extension of Chubanov's polynomial-time linear programming algorithm to second-order cone programming. Optim. Methods Softw. 33(1): 1-25 (2018) - [j37]Bruno F. Lourenço, Masakazu Muramatsu, Takashi Tsuchiya:
Facial Reduction and Partial Polyhedrality. SIAM J. Optim. 28(3): 2304-2326 (2018) - 2017
- [j36]Leonid Faybusovich, Takashi Tsuchiya:
Matrix monotonicity and self-concordance: how to handle quantum entropy in optimization problems. Optim. Lett. 11(8): 1513-1526 (2017) - [c6]Takashi Nakada, Hiroyuki Yanagihashi, Hiroshi Nakamura, Kunimaro Imai, Hiroshi Ueki, Takashi Tsuchiya, Masanori Hayashikoshi:
Energy-aware task scheduling for near real-time periodic tasks on heterogeneous multicore processors. VLSI-SoC 2017: 1-6 - 2016
- [j35]Bruno F. Lourenço, Masakazu Muramatsu, Takashi Tsuchiya:
Weak infeasibility in second order cone programming. Optim. Lett. 10(8): 1743-1755 (2016) - [j34]Fei Liu, Ryan C. Loxton, Takashi Tsuchiya:
Preface. Optim. Methods Softw. 31(6): 1239 (2016) - [c5]Takashi Tsuchiya, Masahiro Fujita, Kenta Takahashi, Takehisa Kato, Fumihiko Magata, Yoshimi Teshigawara, Ryôichi Sasaki, Masakatsu Nishigaki:
Secure Communication Protocol Between a Human and a Bank Server for Preventing Man-in-the-Browser Attacks. HCI (20) 2016: 77-88 - 2015
- [c4]Takashi Nakada, Hiroyuki Yanagihashi, Hiroshi Ueki, Takashi Tsuchiya, Masanori Hayashikoshi, Hiroshi Nakamura:
Energy-Efficient Continuous Task Scheduling for Near Real-Time Periodic Tasks. DSDIS 2015: 675-681 - 2014
- [j33]Satoshi Kakihara, Atsumi Ohara, Takashi Tsuchiya:
Curvature integrals and iteration complexities in SDP and symmetric cone programs. Comput. Optim. Appl. 57(3): 623-665 (2014) - 2013
- [j32]Satoshi Kakihara, Atsumi Ohara, Takashi Tsuchiya:
Information Geometry and Interior-Point Algorithms in Semidefinite Programs and Symmetric Cone Programs. J. Optim. Theory Appl. 157(3): 749-780 (2013) - [j31]Tomonari Kitahara, Takashi Tsuchiya:
A Simple Variant of the Mizuno-Todd-Ye Predictor-Corrector Algorithm and Its Objective-Function-Free Complexity. SIAM J. Optim. 23(3): 1890-1903 (2013) - [c3]Satoshi Kakihara, Atsumi Ohara, Takashi Tsuchiya:
Information Geometry and Interior-Point Algorithms. GSI 2013: 777-784
2000 – 2009
- 2009
- [j30]Guanghui Lan, Renato D. C. Monteiro, Takashi Tsuchiya:
A Polynomial Predictor-Corrector Trust-Region Algorithm for Linear Programming. SIAM J. Optim. 19(4): 1918-1946 (2009) - [j29]Tomonari Kitahara, Takashi Tsuchiya:
Proximity of Weighted and Layered Least Squares Solutions. SIAM J. Matrix Anal. Appl. 31(3): 1172-1186 (2009) - 2008
- [j28]Leonid Faybusovich, Thanasak Mouktonglang, Takashi Tsuchiya:
Numerical experiments with universal barrier functions for cones of Chebyshev systems. Comput. Optim. Appl. 41(2): 205-223 (2008) - [j27]Renato D. C. Monteiro, Takashi Tsuchiya:
A strong bound on the integral of the central path curvature and its relationship with the iteration-complexity of primal-dual path-following LP algorithms. Math. Program. 115(1): 105-149 (2008) - 2007
- [j26]Kazuyuki Nakamura, Takashi Tsuchiya:
A Recursive Recomputation Approach for Smoothing in Nonlinear State-Space Modeling: An Attempt for Reducing Space Complexity. IEEE Trans. Signal Process. 55(11): 5167-5178 (2007) - 2006
- [j25]Tadayoshi Fushiki, Shingo Horiuchi, Takashi Tsuchiya:
A Maximum Likelihood Approach to Density Estimation with Semidefinite Programming. Neural Comput. 18(11): 2777-2812 (2006) - [j24]Leonid Faybusovich, Thanasak Mouktonglang, Takashi Tsuchiya:
Implementation of infinite-dimensional interior-point method for solving multi-criteria linear-quadratic control problem. Optim. Methods Softw. 21(2): 315-341 (2006) - 2005
- [j23]Renato D. C. Monteiro, Takashi Tsuchiya:
A New Iteration-Complexity Bound for the MTY Predictor-Corrector Algorithm. SIAM J. Optim. 15(2): 319-347 (2005) - 2004
- [j22]Renato D. C. Monteiro, Jerome W. O'Neal, Takashi Tsuchiya:
Uniform Boundedness of a Preconditioned Normal Matrix Used in Interior-Point Methods. SIAM J. Optim. 15(1): 96-100 (2004) - 2003
- [j21]Hiroshi Konno, Takashi Tsuchiya:
Preface. Math. Program. 97(3): 449-450 (2003) - [j20]Leonid Faybusovich, Takashi Tsuchiya:
Primal-dual algorithms and infinite-dimensional Jordan algebras of finite rank. Math. Program. 97(3): 471-493 (2003) - [j19]Renato D. C. Monteiro, Takashi Tsuchiya:
A Variant of the Vavasis--Ye Layered-Step Interior-Point Algorithm for Linear Programming. SIAM J. Optim. 13(4): 1054-1079 (2003) - [j18]Takashi Sasakawa, Takashi Tsuchiya:
Optimal Magnetic Shield Design with Second-Order Cone Programming. SIAM J. Sci. Comput. 24(6): 1930-1950 (2003) - 2002
- [c2]Genta Ueno, Nagatomo Nakamura, Tomoyuki Higuchi, Takashi Tsuchiya, Shinobu Machida, Tohru Araki:
Application of Multivariate Maxwellian Mixture Model to Plasma Velocity Distribution. Progress in Discovery Science 2002: 372-383 - 2001
- [j17]Masami Ogata, Takashi Tsuchiya, Takeshi Kubozono, Kazuhiko Ueda:
Dynamic range compression based on illumination compensation. IEEE Trans. Consumer Electron. 47(3): 548-558 (2001) - 2000
- [j16]Renato D. C. Monteiro, Takashi Tsuchiya:
Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions. Math. Program. 88(1): 61-83 (2000) - [c1]Genta Ueno, Nagamoto Nakamura, Tomoyuchi Higuchi, Takashi Tsuchiya, Shinobu Machida, Tohru Araki:
Application of Multivariate Maxwellian Mixture Model to Plasma Velocity Distribution Function. Discovery Science 2000: 197-211
1990 – 1999
- 1999
- [j15]Renato D. C. Monteiro, Takashi Tsuchiya:
Polynomiality of primal-dual algorithms for semidefinite linear complementarity problems based on the Kojima-Shindoh-Hara family of directions. Math. Program. 84(1): 39-53 (1999) - [j14]Renato D. C. Monteiro, Takashi Tsuchiya:
Polynomial Convergence of a New Family of Primal-Dual Algorithms for Semidefinite Programming. SIAM J. Optim. 9(3): 551-577 (1999) - 1998
- [j13]Nimrod Megiddo, Shinji Mizuno, Takashi Tsuchiya:
A modified layered-step interior-point algorithm for linear programming. Math. Program. 82: 339-355 (1998) - [j12]Renato D. C. Monteiro, Takashi Tsuchiya:
Global Convergence of the Affine Scaling Algorithm for Convex Quadratic Programming. SIAM J. Optim. 8(1): 26-58 (1998) - [j11]Masanari Taniguchi, Takashi Tsuchiya, Tasuku Takagi:
Basic study on the application of parametric spline functions to the holographic pattern measuring system. IEEE Trans. Instrum. Meas. 47(1): 153-157 (1998) - 1996
- [j10]Masakazu Muramatsu, Takashi Tsuchiya:
An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption. Ann. Oper. Res. 62(1): 325-355 (1996) - [j9]Shinji Mizuno, Nimrod Megiddo, Takashi Tsuchiya:
A Linear Programming Instance with Many Crossover Events. J. Complex. 12(4): 474-479 (1996) - [j8]Masakazu Muramatsu, Takashi Tsuchiya:
Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm. Math. Program. 72: 291-305 (1996) - [j7]Takashi Tsuchiya, Renato D. C. Monteiro:
Superlinear convergence of the affine scaling algorithm. Math. Program. 75: 77-110 (1996) - 1995
- [j6]Takashi Tsuchiya, Masakazu Muramatsu:
Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems. SIAM J. Optim. 5(3): 525-551 (1995) - 1993
- [j5]Osman Güler, Dick den Hertog, Cornelis Roos, Tamás Terlaky, Takashi Tsuchiya:
Degeneracy in interior point methods for linear programming: a survey. Ann. Oper. Res. 46-47(1): 107-138 (1993) - [j4]Renato D. C. Monteiro, Takashi Tsuchiya, Y. Wang:
A simplified global convergence proof of the affine scaling algorithm. Ann. Oper. Res. 46-47(2): 443-482 (1993) - [j3]Takashi Tsuchiya:
Global convergence of the affine scaling algorithm for primal degenerate strictly convex quadratic programming problems. Ann. Oper. Res. 46-47(2): 509-539 (1993) - 1992
- [j2]Takashi Tsuchiya:
Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems. Math. Oper. Res. 17(3): 527-557 (1992) - 1991
- [j1]Takashi Tsuchiya:
Global convergence of the affine scaling methods for degenerate linear programming problems. Math. Program. 52: 377-404 (1991)
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 2025-01-21 00:16 CET 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:
