Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems. - Takashi Tsuchiya; Masakazu Muramatsu (SIAM J. Optim., 1995)

An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption. - Masakazu Muramatsu; Takashi Tsuchiya (Ann. Oper. Res., 1996)

Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm. - Masakazu Muramatsu; Takashi Tsuchiya (Math. Program., 1996)

Affine scaling algorithm fails for semidefinite programming. - Masakazu Muramatsu (Math. Program., 1998)

Primal-Dual Affine-Scaling Algorithms Fail for Semidefinite Programming. - Masakazu Muramatsu; Robert J. Vanderbei (Math. Oper. Res., 1999)

A New Model for Large Margin Classifiers by Second Order Cone Programming. - Rameswar Debnath; Masakazu Muramatsu; Haruhisa Takahashi (IC-AI, 2004)

The support vector machine learning using the second order cone programming. - Rameswar Debnath; Masakazu Muramatsu; Haruhisa Takahashi (IJCNN, 2004)

A Unified Class of Directly Solvable Semidefinite Programming Problems. - Masakazu Muramatsu (Ann. Oper. Res., 2005)

An Efficient Support Vector Machine Learning Method with Second-Order Cone Programming for Large-Scale Problems. - Rameswar Debnath; Masakazu Muramatsu; Haruhisa Takahashi (Appl. Intell., 2005)

A pivoting procedure for a class of second-order cone programming. - Masakazu Muramatsu (Optim. Methods Softw., 2006)

Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity. - Hayato Waki; Sunyoung Kim; Masakazu Kojima; Masakazu Muramatsu (SIAM J. Optim., 2006)

An Extension of Sums of Squares Relaxations to Polynomial Optimization Problems Over Symmetric Cones. - Masakazu Kojima; Masakazu Muramatsu (Math. Program., 2007)

Algorithm 883: SparsePOP - A Sparse Semidefinite Programming Relaxation of Polynomial Optimization Problems. - Hayato Waki; Sunyoung Kim; Masakazu Kojima; Masakazu Muramatsu; Hiroshi Sugimoto (ACM Trans. Math. Softw., 2008)

A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones. - Masakazu Kojima; Masakazu Muramatsu (Comput. Optim. Appl., 2009)

Implementation Issues of Second-Order Cone Programming Approaches for Support Vector Machine Learning Problems. - Rameswar Debnath; Masakazu Muramatsu; Haruhisa Takahashi (IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009)

A facial reduction algorithm for finding sparse SOS representations. - Hayato Waki; Masakazu Muramatsu (Oper. Res. Lett., 2010)

Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization. - Hayato Waki; Maho Nakata; Masakazu Muramatsu (Comput. Optim. Appl., 2012)

Efficiency of three forward-pruning techniques in shogi: Futility pruning, null-move pruning, and Late Move Reduction (LMR). - Kunihito Hoki; Masakazu Muramatsu (Entertain. Comput., 2012)

Facial Reduction Algorithms for Conic Optimization Problems. - Hayato Waki; Masakazu Muramatsu (J. Optim. Theory Appl., 2013)

Monte-Carlo Simulation Adjusting. - Nobuo Araki; Masakazu Muramatsu; Kunihito Hoki; Satoshi Takahashi (AAAI, 2014)

Pure Nash equilibria of competitive diffusion process on toroidal grid graphs. - Yuki Sukenari; Kunihito Hoki; Satoshi Takahashi; Masakazu Muramatsu (Discret. Appl. Math., 2016)

Weak infeasibility in second order cone programming. - Bruno F. Lourenço; Masakazu Muramatsu; Takashi Tsuchiya (Optim. Lett., 2016)

Perturbed sums-of-squares theorem for polynomial optimization and its applications. - Masakazu Muramatsu; Hayato Waki; Levent Tunçel (Optim. Methods Softw., 2016)

Improved simulation adjusting. - Nobuo Araki; Kunihito Hoki; Satoshi Takahashi; Masakazu Muramatsu (J. Int. Comput. Games Assoc., 2017)

Network Congestion Minimization Models Based on Robust Optimization. - Bimal Chandra Das; Satoshi Takahashi; Eiji Oki; Masakazu Muramatsu (IEICE Trans. Commun., 2018)

Facial Reduction and Partial Polyhedrality. - Bruno F. Lourenço; Masakazu Muramatsu; Takashi Tsuchiya (SIAM J. Optim., 2018)

Approach to problem of minimizing network power consumption based on robust optimization. - Bimal Chandra Das; Satoshi Takahashi; Eiji Oki; Masakazu Muramatsu (Int. J. Commun. Syst., 2019)

An extension of Chubanov's algorithm to symmetric cones. - Bruno F. Lourenço; Tomonari Kitahara; Masakazu Muramatsu; Takashi Tsuchiya (Math. Program., 2019)

Development of Artificial Intelligence to Classify Quality of Transmission Shift Control Using Deep Convolutional Neural Networks. - Takefumi Kawakami; Takanori Ide; Eiji Moriyama; Kunihito Hoki; Masakazu Muramatsu (IEEE Trans. Veh. Technol., 2020)

Solving SDP completely with an interior point oracle. - Bruno F. Lourenço; Masakazu Muramatsu; Takashi Tsuchiya (Optim. Methods Softw., 2021)

A Variant of Knapsack Problem Efficient for Benders Decomposition. - Kosuke Aratani; Masakazu Muramatsu (IIAI-AAI-Winter, 2022)

A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms. - Takashi Tsuchiya; Bruno F. Lourenço; Masakazu Muramatsu; Takayuki Okuno (Math. Program., 2023)

Shift Quality Classifier Using Deep Neural Networks on Small Data with Dropout and Semi-Supervised Learning. - Takefumi Kawakami; Takanori Ide; Kunihito Hoki; Masakazu Muramatsu (IEICE Trans. Inf. Syst., 2023)

Closing duality gaps of SDPs completely through perturbation when singularity degree is one. - Takashi Tsuchiya; Bruno F. Lourenço; Masakazu Muramatsu; Takayuki Okuno (Optim. Methods Softw., 2024)