Masakazu Kojima

93 papers Journal 89Unranked 3

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	An exceptionally difficult binary quadratic optimization problem with symmetry: a challenge for the largest unsolved QAP instance Tai256c. Optim. Lett. Koichi Fujii, Sunyoung Kim, Masakazu Kojima, Hans D. Mittelmann, Yuji Shinano
2025	J	`jnl`	Equivalent sufficient conditions for global optimality of quadratically constrained quadratic programs. Math. Methods Oper. Res. Sunyoung Kim, Masakazu Kojima
2024	J	`jnl`	Further Development in Convex Conic Reformulation of Geometric Nonconvex Conic Optimization Problems. SIAM J. Optim. Naohiko Arima, Sunyoung Kim, Masakazu Kojima
2022	J	`jnl`	Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints. Math. Program. Sunyoung Kim, Masakazu Kojima, Kim-Chuan Toh
2021	J	`jnl`	A Newton-bracketing method for a simple conic optimization problem. Optim. Methods Softw. Sunyoung Kim, Masakazu Kojima, Kim-Chuan Toh
2020	J	`jnl`	A Geometrical Analysis on Convex Conic Reformulations of Quadratic and Polynomial Optimization Problems. SIAM J. Optim. Sunyoung Kim, Masakazu Kojima, Kim-Chuan Toh
2020	J	`jnl`	Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures. J. Glob. Optim. Sunyoung Kim, Masakazu Kojima, Kim-Chuan Toh
2019	J	`jnl`	Algorithm 996: BBCPOP: A Sparse Doubly Nonnegative Relaxation of Polynomial Optimization Problems With Binary, Box, and Complementarity Constraints. ACM Trans. Math. Softw. Naoki Ito, Sunyoung Kim, Masakazu Kojima, Akiko Takeda, Kim-Chuan Toh
2018	J	`jnl`	Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems. J. Glob. Optim. Naoki Ito, Sunyoung Kim, Masakazu Kojima, Akiko Takeda, Kim-Chuan Toh
2017	J	`jnl`	A robust Lagrangian-DNN method for a class of quadratic optimization problems. Comput. Optim. Appl. Naohiko Arima, Sunyoung Kim, Masakazu Kojima, Kim-Chuan Toh
2017	J	`jnl`	Binary quadratic optimization problems that are difficult to solve by conic relaxations. Discret. Optim. Sunyoung Kim, Masakazu Kojima
2016	J	`jnl`	A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems. Math. Program. Sunyoung Kim, Masakazu Kojima, Kim-Chuan Toh
2016	J	`jnl`	Extension of Completely Positive Cone Relaxation to Moment Cone Relaxation for Polynomial Optimization. J. Optim. Theory Appl. Naohiko Arima, Sunyoung Kim, Masakazu Kojima
2014	J	`jnl`	Faster, but weaker, relaxations for quadratically constrained quadratic programs. Comput. Optim. Appl. Samuel Burer, Sunyoung Kim, Masakazu Kojima
2013	J	`jnl`	A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming. SIAM J. Optim. Naohiko Arima, Sunyoung Kim, Masakazu Kojima
2013	J	`jnl`	Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization. Math. Program. Masakazu Kojima, Makoto Yamashita
2012	J	`jnl`	Algorithm 920: SFSDP: A Sparse Version of Full Semidefinite Programming Relaxation for Sensor Network Localization Problems. ACM Trans. Math. Softw. Sunyoung Kim, Masakazu Kojima, Hayato Waki, Makoto Yamashita
2011	J	`jnl`	Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion. Math. Program. Sunyoung Kim, Masakazu Kojima, Martin Mevissen, Makoto Yamashita
2010	—	`conf`	Exploiting Structured Sparsity in Large Scale Semidefinite Programming Problems. ICMS Masakazu Kojima
2010	J	`jnl`	Sdp Relaxations for Quadratic Optimization Problems Derived from Polynomial Optimization Problems. Asia Pac. J. Oper. Res. Martin Mevissen, Masakazu Kojima
2010	—	`conf`	Semidefinite programming relaxations for sensor network localization. CACSD Sunyoung Kim, Masakazu Kojima
2010	J	`jnl`	Solving polynomial least squares problems via semidefinite programming relaxations. J. Glob. Optim. Sunyoung Kim, Masakazu Kojima
2009	J	`jnl`	A note on sparse SOS and SDP relaxations for polynomial optimization problems over symmetric cones. Comput. Optim. Appl. Masakazu Kojima, Masakazu Muramatsu
2009	J	`jnl`	Exploiting Sparsity in SDP Relaxation for Sensor Network Localization. SIAM J. Optim. Sunyoung Kim, Masakazu Kojima, Hayato Waki
2009	J	`jnl`	Recognizing underlying sparsity in optimization. Math. Program. Sunyoung Kim, Masakazu Kojima, Philippe L. Toint
2008	J	`jnl`	Algorithm 883: SparsePOP - A Sparse Semidefinite Programming Relaxation of Polynomial Optimization Problems. ACM Trans. Math. Softw. Hayato Waki, Sunyoung Kim, Masakazu Kojima, Masakazu Muramatsu, Hiroshi Sugimoto
2007	J	`jnl`	A conversion of an SDP having free variables into the standard form SDP. Comput. Optim. Appl. Kazuhiro Kobayashi, Kazuhide Nakata, Masakazu Kojima
2007	J	`jnl`	An Extension of Sums of Squares Relaxations to Polynomial Optimization Problems Over Symmetric Cones. Math. Program. Masakazu Kojima, Masakazu Muramatsu
2007	J	`jnl`	Dynamic Enumeration of All Mixed Cells. Discret. Comput. Geom. Tomohiko Mizutani, Akiko Takeda, Masakazu Kojima
2006	J	`jnl`	A parallel primal-dual interior-point method for semidefinite programs using positive definite matrix completion. Parallel Comput. Kazuhide Nakata, Makoto Yamashita, Katsuki Fujisawa, Masakazu Kojima
2006	J	`jnl`	PHoMpara - Parallel Implementation of the Polyhedral Homotopy Continuation Method for Polynomial Systems. Computing Takayuki Gunji, Sunyoung Kim, Katsuki Fujisawa, Masakazu Kojima
2006	J	`jnl`	Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity. SIAM J. Optim. Hayato Waki, Sunyoung Kim, Masakazu Kojima, Masakazu Muramatsu
2005	J	`jnl`	Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems. SIAM J. Optim. Sunyoung Kim, Masakazu Kojima, Hayato Waki
2005	J	`jnl`	Sparsity in sums of squares of polynomials. Math. Program. Masakazu Kojima, Sunyoung Kim, Hayato Waki
2004	—	`conf`	High Performance Grid and Cluster Computing for Some Optimization Problems. SAINT Workshops Katsuki Fujisawa, Masakazu Kojima, Akiko Takeda, Makoto Yamashita
2004	J	`jnl`	Numerical Stability of Path Tracing in Polyhedral Homotopy Continuation Methods. Computing Sunyoung Kim, Masakazu Kojima
2004	J	`jnl`	PHoM - a Polyhedral Homotopy Continuation Method for Polynomial Systems. Computing Takayuki Gunji, Sunyoung Kim, Masakazu Kojima, Akiko Takeda, Katsuki Fujisawa, Tomohiko Mizutani
2003	J	`jnl`	Exact Solutions of Some Nonconvex Quadratic Optimization Problems via SDP and SOCP Relaxations. Comput. Optim. Appl. Sunyoung Kim, Masakazu Kojima
2003	J	`jnl`	Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0). Optim. Methods Softw. Makoto Yamashita, Katsuki Fujisawa, Masakazu Kojima
2003	J	`jnl`	SDPARA: SemiDefinite Programming Algorithm paRAllel version. Parallel Comput. Makoto Yamashita, Katsuki Fujisawa, Masakazu Kojima
2003	J	`jnl`	Second order cone programming relaxation of a positive semidefinite constraint. Optim. Methods Softw. Sunyoung Kim, Masakazu Kojima, Makoto Yamashita
2002	J	`jnl`	Lagrangian Dual Interior-Point Methods for Semidefinite Programs. SIAM J. Optim. Mituhiro Fukuda, Masakazu Kojima, Masayuki Shida
2002	J	`jnl`	On the finite convergence of successive SDP relaxation methods. Eur. J. Oper. Res. Masakazu Kojima, Levent Tunçel
2002	J	`jnl`	Parallel Implementation of Successive Convex Relaxation Methods for Quadratic Optimization Problems. J. Glob. Optim. Akiko Takeda, Katsuki Fujisawa, Yusuke Fukaya, Masakazu Kojima
2002	J	`jnl`	Solving Some Large Scale Semidefinite Programs via the Conjugate Residual Method. SIAM J. Optim. Kim-Chuan Toh, Masakazu Kojima
2002	J	`jnl`	Some Fundamental Properties of Successive Convex Relaxation Methods on LCP and Related Problems. J. Glob. Optim. Masakazu Kojima, Levent Tunçel
2001	J	`jnl`	Branch-and-Cut Algorithms for the Bilinear Matrix Inequality Eigenvalue Problem. Comput. Optim. Appl. Mituhiro Fukuda, Masakazu Kojima
2001	J	`jnl`	Complexity Analysis of Successive Convex Relaxation Methods for Nonconvex Sets. Math. Oper. Res. Masakazu Kojima, Akiko Takeda
2001	J	`jnl`	Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework. SIAM J. Optim. Mituhiro Fukuda, Masakazu Kojima, Kazuo Murota, Kazuhide Nakata
2000	J	`jnl`	Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets. SIAM J. Optim. Masakazu Kojima, Levent Tunçel
2000	J	`jnl`	Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization. Math. Program. Masakazu Kojima, Levent Tunçel
1999	J	`jnl`	A Predictor-Corrector Interior-Point Algorithm for the Semidefinite Linear Complementarity Problem Using the Alizadeh-Haeberly-Overton Search Direction. SIAM J. Optim. Masakazu Kojima, Masayuki Shida, Susumu Shindoh
1999	J	`jnl`	Search directions in the SDP and the monotone SDLCP: generalization and inexact computation. Math. Program. Masakazu Kojima, Masayuki Shida, Susumu Shindoh
1998	J	`jnl`	Existence and Uniqueness of Search Directions in Interior-Point Algorithms for the SDP and the Monotone SDLCP. SIAM J. Optim. Masayuki Shida, Susumu Shindoh, Masakazu Kojima
1998	J	`jnl`	Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs. Math. Program. Masakazu Kojima, Masayuki Shida, Susumu Shindoh
1997	J	`jnl`	Centers of Monotone Generalized Complementarity Problems. Math. Oper. Res. Masayuki Shida, Susumu Shindoh, Masakazu Kojima
1997	J	`jnl`	Exploiting sparsity in primal-dual interior-point methods for semidefinite programming. Math. Program. Katsuki Fujisawa, Masakazu Kojima, Kazuhide Nakata
1997	J	`jnl`	Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices. SIAM J. Optim. Masakazu Kojima, Susumu Shindoh, Shinji Hara
1997	J	`jnl`	Semidefinite Programming Relaxation for Nonconvex Quadratic Programs. J. Glob. Optim. Tetsuya Fujie, Masakazu Kojima
1996	J	`jnl`	A Generalized Convexity and Variational Inequality for Quasi-Convex Minimization. SIAM J. Optim. Phan Thien Thach, Masakazu Kojima
1996	J	`jnl`	Basic lemmas in polynomial-time infeasible-interiorpoint methods for linear programs. Ann. Oper. Res. Masakazu Kojima
1995	J	`jnl`	Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming. SIAM J. Optim. Shinji Mizuno, Masakazu Kojima, Michael J. Todd
1994	J	`jnl`	Global convergence in infeasible-interior-point algorithms. Math. Program. Masakazu Kojima, Toshihito Noma, Akiko Yoshise
1993	J	`jnl`	A General Framework of Continuation Methods for Complementarity Problems. Math. Oper. Res. Masakazu Kojima, Nimrod Megiddo, Shinji Mizuno
1993	J	`jnl`	A little theorem of the big Mu in interior point algorithms. Math. Program. Masakazu Kojima, Shinji Mizuno, Akiko Yoshise
1993	J	`jnl`	A primal-dual infeasible-interior-point algorithm for linear programming. Math. Program. Masakazu Kojima, Nimrod Megiddo, Shinji Mizuno
1993	J	`jnl`	Large-Step Interior Point Algorithms for Linear Complementarity Problems. SIAM J. Optim. Masakazu Kojima, Yoshifumi Kurita, Shinji Mizuno
1993	J	`jnl`	On the big Mu in the affine scaling algorithm. Math. Program. Tohru Ishihara, Masakazu Kojima
1993	J	`jnl`	Theoretical convergence of large-step primal-dual interior point algorithms for linear programming. Math. Program. Masakazu Kojima, Nimrod Megiddo, Shinji Mizuno
1992	J	`jnl`	An interior point potential reduction algorithm for the linear complementarity problem. Math. Program. Masakazu Kojima, Nimrod Megiddo, Yinyu Ye
1991	—	`book`	A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems Masakazu Kojima, Nimrod Megiddo, Toshihito Noma, Akiko Yoshise
1991	J	`jnl`	A unified approach to interior point algorithms for linear complementarity problems: A summary. Oper. Res. Lett. Masakazu Kojima, Nimrod Megiddo, Toshihito Noma, Akiko Yoshise
1991	J	`jnl`	An O(square root(n) * L) iteration potential reduction algorithm for linear complementarity problems. Math. Program. Masakazu Kojima, Shinji Mizuno, Akiko Yoshise
1991	J	`jnl`	Homotopy Continuation Methods for Nonlinear Complementarity Problems. Math. Oper. Res. Masakazu Kojima, Nimrod Megiddo, Toshihito Noma
1990	J	`jnl`	Ellipsoids that Contain All the Solutions of a Positive Semi-Definite Linear Complementarity Problem. Math. Program. Masakazu Kojima, Shinji Mizuno, Akiko Yoshise
1990	J	`jnl`	Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems. Math. Oper. Res. Masakazu Kojima, Shinji Mizuno, Toshihito Noma
1989	J	`jnl`	A new continuation method for complementarity problems with uniform Math. Program. Masakazu Kojima, Shinji Mizuno, Toshihito Noma
1989	J	`jnl`	A polynomial-time algorithm for a class of linear complementarity problems. Math. Program. Masakazu Kojima, Shinji Mizuno, Akiko Yoshise
1987	J	`jnl`	Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming. Math. Program. Yinyu Ye, Masakazu Kojima
1986	J	`jnl`	Determining Basic Variables of Optimal Solutions in Karmarkar's New LP Algorithm. Algorithmica Masakazu Kojima
1985	J	`jnl`	A PL homotopy continuation method with the use of an odd map for the artificial level. Math. Program. Masakazu Kojima, Shin'ichi Oishi, Yuzo Sumi, Kazuo Horiuchi
1985	J	`jnl`	Strongly Stable Equilibrium Points of Math. Oper. Res. Masakazu Kojima, Akira Okada, Susumu Shindoh
1984	J	`jnl`	A unified approach to the implementation of several restart fixed point algorithms and a new variable dimension algorithm. Math. Program. Masakazu Kojima, Yoshitsugu Yamamoto
1983	J	`jnl`	Computation of all solutions to a system of polynomial equations. Math. Program. Masakazu Kojima, Shinji Mizuno
1982	J	`jnl`	Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods. Math. Program. Masakazu Kojima, Yoshitsugu Yamamoto
1981	J	`jnl`	On the number of solutions to a class of complementarity problems. Math. Program. Masakazu Kojima, Romesh Saigal
1979	J	`jnl`	A Complementary Pivoting Approach to Parametric Nonlinear Programming. Math. Oper. Res. Masakazu Kojima
1979	J	`jnl`	A PL homotopy for finding all the roots of a polynomial. Math. Program. Masakazu Kojima, Hisakazu Nishino, Naohiko Arima
1979	J	`jnl`	On the number of solutions to a class of linear complementarity problems. Math. Program. Masakazu Kojima, Romesh Saigal
1978	J	`jnl`	A modification of todd's triangulation J Math. Program. Masakazu Kojima
1978	J	`jnl`	Studies on Piecewise-Linear Approximations of Piecewise- Math. Oper. Res. Masakazu Kojima
1977	J	`jnl`	On the existence and uniqueness of solutions in nonlinear complementarity theory. Math. Program. Nimrod Megiddo, Masakazu Kojima
1975	J	`jnl`	A unification of the existence theorems of the nonlinear complementarity problem. Math. Program. Masakazu Kojima