Masakazu Kojima

Publication Activity (10 Years)

Years Active: 1975-2022
Publications (10 Years): 10

Top Topics

Quadratically Constrained Quadratic

Graph Structures

Optimization Problems

Top Venues

J. Glob. Optim.

Comput. Optim. Appl.

Publications

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