Masakazu Muramatsu
According to our database1,
Masakazu Muramatsu
authored at least 32 papers
between 1995 and 2023.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2023
Shift Quality Classifier Using Deep Neural Networks on Small Data with Dropout and Semi-Supervised Learning.
IEICE Trans. Inf. Syst., December, 2023
A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms.
Math. Program., 2023
2022
Proceedings of the 2022 13th International Congress on Advanced Applied Informatics Winter, 2022
2021
2020
Development of Artificial Intelligence to Classify Quality of Transmission Shift Control Using Deep Convolutional Neural Networks.
IEEE Trans. Veh. Technol., 2020
2019
Approach to problem of minimizing network power consumption based on robust optimization.
Int. J. Commun. Syst., 2019
2018
IEICE Trans. Commun., 2018
2017
2016
Optim. Methods Softw., 2016
Discret. Appl. Math., 2016
2014
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014
2013
J. Optim. Theory Appl., 2013
2012
Efficiency of three forward-pruning techniques in shogi: Futility pruning, null-move pruning, and Late Move Reduction (LMR).
Entertain. Comput., 2012
Strange behaviors of interior-point methods for solving semidefinite programming problems in polynomial optimization.
Comput. Optim. Appl., 2012
2010
Oper. Res. Lett., 2010
2009
Implementation Issues of Second-Order Cone Programming Approaches for Support Vector Machine Learning Problems.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2009
A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones.
Comput. Optim. Appl., 2009
2008
Algorithm 883: SparsePOP - A Sparse Semidefinite Programming Relaxation of Polynomial Optimization Problems.
ACM Trans. Math. Softw., 2008
2007
An Extension of Sums of Squares Relaxations to Polynomial Optimization Problems Over Symmetric Cones.
Math. Program., 2007
2006
Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity.
SIAM J. Optim., 2006
Optim. Methods Softw., 2006
2005
An Efficient Support Vector Machine Learning Method with Second-Order Cone Programming for Large-Scale Problems.
Appl. Intell., 2005
Ann. Oper. Res., 2005
2004
A New Model for Large Margin Classifiers by Second Order Cone Programming.
Proceedings of the International Conference on Artificial Intelligence, 2004
1999
Math. Oper. Res., 1999
1998
1996
Convergence analysis of the projective scaling algorithm based on a long-step homogeneous affine scaling algorithm.
Math. Program., 1996
An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption.
Ann. Oper. Res., 1996
1995
Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems.
SIAM J. Optim., 1995