


default search action
Masakazu Muramatsu
2020 – today
- 2024
- [j30]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
- [j29]Takefumi Kawakami
, Takanori Ide, Kunihito Hoki, Masakazu Muramatsu:
Shift Quality Classifier Using Deep Neural Networks on Small Data with Dropout and Semi-Supervised Learning. IEICE Trans. Inf. Syst. 106(12): 2078-2084 (2023) - [j28]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) - 2022
- [c4]Kosuke Aratani, Masakazu Muramatsu:
A Variant of Knapsack Problem Efficient for Benders Decomposition. IIAI-AAI-Winter 2022: 152-157 - 2021
- [j27]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
- [j26]Takefumi Kawakami
, Takanori Ide, Eiji Moriyama, Kunihito Hoki
, Masakazu Muramatsu:
Development of Artificial Intelligence to Classify Quality of Transmission Shift Control Using Deep Convolutional Neural Networks. IEEE Trans. Veh. Technol. 69(12): 16168-16172 (2020)
2010 – 2019
- 2019
- [j25]Bimal Chandra Das
, Satoshi Takahashi, Eiji Oki, Masakazu Muramatsu:
Approach to problem of minimizing network power consumption based on robust optimization. Int. J. Commun. Syst. 32(5) (2019) - [j24]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
- [j23]Bimal Chandra Das, Satoshi Takahashi, Eiji Oki, Masakazu Muramatsu:
Network Congestion Minimization Models Based on Robust Optimization. IEICE Trans. Commun. 101-B(3): 772-784 (2018) - [j22]Bruno F. Lourenço, Masakazu Muramatsu, Takashi Tsuchiya:
Facial Reduction and Partial Polyhedrality. SIAM J. Optim. 28(3): 2304-2326 (2018) - 2017
- [j21]Nobuo Araki, Kunihito Hoki, Satoshi Takahashi, Masakazu Muramatsu:
Improved simulation adjusting. J. Int. Comput. Games Assoc. 39(3-4): 195-204 (2017) - 2016
- [j20]Yuki Sukenari, Kunihito Hoki, Satoshi Takahashi, Masakazu Muramatsu:
Pure Nash equilibria of competitive diffusion process on toroidal grid graphs. Discret. Appl. Math. 215: 31-40 (2016) - [j19]Bruno F. Lourenço, Masakazu Muramatsu, Takashi Tsuchiya:
Weak infeasibility in second order cone programming. Optim. Lett. 10(8): 1743-1755 (2016) - [j18]Masakazu Muramatsu, Hayato Waki
, Levent Tunçel
:
Perturbed sums-of-squares theorem for polynomial optimization and its applications. Optim. Methods Softw. 31(1): 134-156 (2016) - 2014
- [c3]Nobuo Araki, Masakazu Muramatsu, Kunihito Hoki, Satoshi Takahashi:
Monte-Carlo Simulation Adjusting. AAAI 2014: 3094-3095 - 2013
- [j17]Hayato Waki
, Masakazu Muramatsu:
Facial Reduction Algorithms for Conic Optimization Problems. J. Optim. Theory Appl. 158(1): 188-215 (2013) - 2012
- [j16]Hayato Waki
, Maho Nakata, Masakazu Muramatsu:
Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization. Comput. Optim. Appl. 53(3): 823-844 (2012) - [j15]Kunihito Hoki, Masakazu Muramatsu:
Efficiency of three forward-pruning techniques in shogi: Futility pruning, null-move pruning, and Late Move Reduction (LMR). Entertain. Comput. 3(3): 51-57 (2012) - 2010
- [j14]Hayato Waki
, Masakazu Muramatsu:
A facial reduction algorithm for finding sparse SOS representations. Oper. Res. Lett. 38(5): 361-365 (2010)
2000 – 2009
- 2009
- [j13]Masakazu Kojima, Masakazu Muramatsu:
A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones. Comput. Optim. Appl. 42(1): 31-41 (2009) - [j12]Rameswar Debnath
, Masakazu Muramatsu, Haruhisa Takahashi:
Implementation Issues of Second-Order Cone Programming Approaches for Support Vector Machine Learning Problems. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 92-A(4): 1209-1222 (2009) - 2008
- [j11]Hayato Waki
, Sunyoung Kim, Masakazu Kojima, Masakazu Muramatsu, Hiroshi Sugimoto:
Algorithm 883: SparsePOP - A Sparse Semidefinite Programming Relaxation of Polynomial Optimization Problems. ACM Trans. Math. Softw. 35(2): 15:1-15:13 (2008) - 2007
- [j10]Masakazu Kojima, Masakazu Muramatsu:
An Extension of Sums of Squares Relaxations to Polynomial Optimization Problems Over Symmetric Cones. Math. Program. 110(2): 315-336 (2007) - 2006
- [j9]Masakazu Muramatsu:
A pivoting procedure for a class of second-order cone programming. Optim. Methods Softw. 21(2): 295-315 (2006) - [j8]Hayato Waki, Sunyoung Kim, Masakazu Kojima, Masakazu Muramatsu:
Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity. SIAM J. Optim. 17(1): 218-242 (2006) - 2005
- [j7]Masakazu Muramatsu:
A Unified Class of Directly Solvable Semidefinite Programming Problems. Ann. Oper. Res. 133(1-4): 85-97 (2005) - [j6]Rameswar Debnath
, Masakazu Muramatsu, Haruhisa Takahashi:
An Efficient Support Vector Machine Learning Method with Second-Order Cone Programming for Large-Scale Problems. Appl. Intell. 23(3): 219-239 (2005) - 2004
- [c2]Rameswar Debnath, Masakazu Muramatsu, Haruhisa Takahashi:
A New Model for Large Margin Classifiers by Second Order Cone Programming. IC-AI 2004: 877-882 - [c1]Rameswar Debnath, Masakazu Muramatsu, Haruhisa Takahashi:
The support vector machine learning using the second order cone programming. IJCNN 2004: 2991-2996
1990 – 1999
- 1999
- [j5]Masakazu Muramatsu, Robert J. Vanderbei:
Primal-Dual Affine-Scaling Algorithms Fail for Semidefinite Programming. Math. Oper. Res. 24(1): 149-175 (1999) - 1998
- [j4]Masakazu Muramatsu:
Affine scaling algorithm fails for semidefinite programming. Math. Program. 83: 393-406 (1998) - 1996
- [j3]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) - [j2]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) - 1995
- [j1]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)

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.
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.
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.
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-28 22:34 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
