default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMasakazu Kojima
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j87]Naohiko Arima, Sunyoung Kim, Masakazu Kojima:
Further Development in Convex Conic Reformulation of Geometric Nonconvex Conic Optimization Problems. SIAM J. Optim. 34(4): 3194-3211 (2024)- 2022
- [j86]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): 761-787 (2022) - 2021
- [j85]Sunyoung Kim, Masakazu Kojima, Kim-Chuan Toh:
A Newton-bracketing method for a simple conic optimization problem. Optim. Methods Softw. 36(2-3): 371-388 (2021) - 2020
- [j84]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): 513-541 (2020) - [j83]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): 1251-1273 (2020)
2010 – 2019
- 2019
- [j82]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): 34:1-34:26 (2019) - 2018
- [j81]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): 619-653 (2018) - 2017
- [j80]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): 453-479 (2017) - [j79]Sunyoung Kim, Masakazu Kojima:
Binary quadratic optimization problems that are difficult to solve by conic relaxations. Discret. Optim. 24: 170-183 (2017) - 2016
- [j78]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): 884-900 (2016) - [j77]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): 161-187 (2016) - 2014
- [j76]Samuel Burer, Sunyoung Kim, Masakazu Kojima:
Faster, but weaker, relaxations for quadratically constrained quadratic programs. Comput. Optim. Appl. 59(1-2): 27-45 (2014) - 2013
- [j75]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): 333-364 (2013) - [j74]Naohiko Arima, Sunyoung Kim, Masakazu Kojima:
A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming. SIAM J. Optim. 23(4): 2320-2340 (2013) - 2012
- [j73]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): 27:1-27:19 (2012) - 2011
- [j72]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): 33-68 (2011) - 2010
- [j71]Martin Mevissen, Masakazu Kojima:
Sdp Relaxations for Quadratic Optimization Problems Derived from Polynomial Optimization Problems. Asia Pac. J. Oper. Res. 27(1): 15-38 (2010) - [j70]Sunyoung Kim, Masakazu Kojima:
Solving polynomial least squares problems via semidefinite programming relaxations. J. Glob. Optim. 46(1): 1-23 (2010) - [c3]Sunyoung Kim, Masakazu Kojima:
Semidefinite programming relaxations for sensor network localization. CACSD 2010: 19-23 - [c2]Masakazu Kojima:
Exploiting Structured Sparsity in Large Scale Semidefinite Programming Problems. ICMS 2010: 4-9
2000 – 2009
- 2009
- [j69]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) - [j68]Sunyoung Kim, Masakazu Kojima, Philippe L. Toint:
Recognizing underlying sparsity in optimization. Math. Program. 119(2): 273-303 (2009) - [j67]Sunyoung Kim, Masakazu Kojima, Hayato Waki:
Exploiting Sparsity in SDP Relaxation for Sensor Network Localization. SIAM J. Optim. 20(1): 192-215 (2009) - 2008
- [j66]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
- [j65]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): 289-307 (2007) - [j64]Tomohiko Mizutani, Akiko Takeda, Masakazu Kojima:
Dynamic Enumeration of All Mixed Cells. Discret. Comput. Geom. 37(3): 351-367 (2007) - [j63]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
- [j62]Takayuki Gunji, Sunyoung Kim, Katsuki Fujisawa, Masakazu Kojima:
PHoMpara - Parallel Implementation of the Polyhedral Homotopy Continuation Method for Polynomial Systems. Computing 77(4): 387-411 (2006) - [j61]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): 24-43 (2006) - [j60]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
- [j59]Masakazu Kojima, Sunyoung Kim, Hayato Waki:
Sparsity in sums of squares of polynomials. Math. Program. 103(1): 45-62 (2005) - [j58]Sunyoung Kim, Masakazu Kojima, Hayato Waki:
Generalized Lagrangian Duals and Sums of Squares Relaxations of Sparse Polynomial Optimization Problems. SIAM J. Optim. 15(3): 697-719 (2005) - 2004
- [j57]Takayuki Gunji, Sunyoung Kim, Masakazu Kojima, Akiko Takeda, Katsuki Fujisawa, Tomohiko Mizutani:
PHoM - a Polyhedral Homotopy Continuation Method for Polynomial Systems. Computing 73(1): 57-77 (2004) - [j56]Sunyoung Kim, Masakazu Kojima:
Numerical Stability of Path Tracing in Polyhedral Homotopy Continuation Methods. Computing 73(4): 329-348 (2004) - [c1]Katsuki Fujisawa, Masakazu Kojima, Akiko Takeda, Makoto Yamashita:
High Performance Grid and Cluster Computing for Some Optimization Problems. SAINT Workshops 2004: 612-615 - 2003
- [j55]Sunyoung Kim, Masakazu Kojima:
Exact Solutions of Some Nonconvex Quadratic Optimization Problems via SDP and SOCP Relaxations. Comput. Optim. Appl. 26(2): 143-154 (2003) - [j54]Makoto Yamashita, Katsuki Fujisawa, Masakazu Kojima:
Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0). Optim. Methods Softw. 18(4): 491-505 (2003) - [j53]Sunyoung Kim, Masakazu Kojima, Makoto Yamashita:
Second order cone programming relaxation of a positive semidefinite constraint. Optim. Methods Softw. 18(5): 535-541 (2003) - [j52]Makoto Yamashita, Katsuki Fujisawa, Masakazu Kojima:
SDPARA: SemiDefinite Programming Algorithm paRAllel version. Parallel Comput. 29(8): 1053-1067 (2003) - 2002
- [j51]Masakazu Kojima, Levent Tunçel:
On the finite convergence of successive SDP relaxation methods. Eur. J. Oper. Res. 143(2): 325-341 (2002) - [j50]Akiko Takeda, Katsuki Fujisawa, Yusuke Fukaya, Masakazu Kojima:
Parallel Implementation of Successive Convex Relaxation Methods for Quadratic Optimization Problems. J. Glob. Optim. 24(2): 237-260 (2002) - [j49]Masakazu Kojima, Levent Tunçel:
Some Fundamental Properties of Successive Convex Relaxation Methods on LCP and Related Problems. J. Glob. Optim. 24(3): 333-348 (2002) - [j48]Kim-Chuan Toh, Masakazu Kojima:
Solving Some Large Scale Semidefinite Programs via the Conjugate Residual Method. SIAM J. Optim. 12(3): 669-691 (2002) - [j47]Mituhiro Fukuda, Masakazu Kojima, Masayuki Shida:
Lagrangian Dual Interior-Point Methods for Semidefinite Programs. SIAM J. Optim. 12(4): 1007-1031 (2002) - 2001
- [j46]Mituhiro Fukuda, Masakazu Kojima:
Branch-and-Cut Algorithms for the Bilinear Matrix Inequality Eigenvalue Problem. Comput. Optim. Appl. 19(1): 79-105 (2001) - [j45]Masakazu Kojima, Akiko Takeda:
Complexity Analysis of Successive Convex Relaxation Methods for Nonconvex Sets. Math. Oper. Res. 26(3): 519-542 (2001) - [j44]Mituhiro Fukuda, Masakazu Kojima, Kazuo Murota, Kazuhide Nakata:
Exploiting Sparsity in Semidefinite Programming via Matrix Completion I: General Framework. SIAM J. Optim. 11(3): 647-674 (2001) - 2000
- [j43]Masakazu Kojima, Levent Tunçel:
Discretization and localization in successive convex relaxation methods for nonconvex quadratic optimization. Math. Program. 89(1): 79-111 (2000) - [j42]Masakazu Kojima, Levent Tunçel:
Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets. SIAM J. Optim. 10(3): 750-778 (2000)
1990 – 1999
- 1999
- [j41]Masakazu Kojima, Masayuki Shida, Susumu Shindoh:
Search directions in the SDP and the monotone SDLCP: generalization and inexact computation. Math. Program. 85(1): 51-80 (1999) - [j40]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): 444-465 (1999) - 1998
- [j39]Masakazu Kojima, Masayuki Shida, Susumu Shindoh:
Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs. Math. Program. 80: 129-160 (1998) - [j38]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): 387-396 (1998) - 1997
- [j37]Tetsuya Fujie, Masakazu Kojima:
Semidefinite Programming Relaxation for Nonconvex Quadratic Programs. J. Glob. Optim. 10(4): 367-380 (1997) - [j36]Masayuki Shida, Susumu Shindoh, Masakazu Kojima:
Centers of Monotone Generalized Complementarity Problems. Math. Oper. Res. 22(4): 969-976 (1997) - [j35]Katsuki Fujisawa, Masakazu Kojima, Kazuhide Nakata:
Exploiting sparsity in primal-dual interior-point methods for semidefinite programming. Math. Program. 79: 235-253 (1997) - [j34]Masakazu Kojima, Susumu Shindoh, Shinji Hara:
Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices. SIAM J. Optim. 7(1): 86-125 (1997) - 1996
- [j33]Masakazu Kojima:
Basic lemmas in polynomial-time infeasible-interiorpoint methods for linear programs. Ann. Oper. Res. 62(1): 1-28 (1996) - [j32]Phan Thien Thach, Masakazu Kojima:
A Generalized Convexity and Variational Inequality for Quasi-Convex Minimization. SIAM J. Optim. 6(1): 212-226 (1996) - 1995
- [j31]Shinji Mizuno, Masakazu Kojima, Michael J. Todd:
Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming. SIAM J. Optim. 5(1): 52-67 (1995) - 1994
- [j30]Masakazu Kojima, Toshihito Noma, Akiko Yoshise:
Global convergence in infeasible-interior-point algorithms. Math. Program. 65: 43-72 (1994) - 1993
- [j29]Masakazu Kojima, Nimrod Megiddo, Shinji Mizuno:
A General Framework of Continuation Methods for Complementarity Problems. Math. Oper. Res. 18(4): 945-963 (1993) - [j28]Masakazu Kojima, Nimrod Megiddo, Shinji Mizuno:
Theoretical convergence of large-step primal-dual interior point algorithms for linear programming. Math. Program. 59: 1-21 (1993) - [j27]Masakazu Kojima, Shinji Mizuno, Akiko Yoshise:
A little theorem of the big Mu in interior point algorithms. Math. Program. 59: 361-375 (1993) - [j26]Masakazu Kojima, Nimrod Megiddo, Shinji Mizuno:
A primal-dual infeasible-interior-point algorithm for linear programming. Math. Program. 61: 263-280 (1993) - [j25]Tohru Ishihara, Masakazu Kojima:
On the big Mu in the affine scaling algorithm. Math. Program. 62: 85-93 (1993) - [j24]Masakazu Kojima, Yoshifumi Kurita, Shinji Mizuno:
Large-Step Interior Point Algorithms for Linear Complementarity Problems. SIAM J. Optim. 3(2): 398-412 (1993) - 1992
- [j23]Masakazu Kojima, Nimrod Megiddo, Yinyu Ye:
An interior point potential reduction algorithm for the linear complementarity problem. Math. Program. 54: 267-279 (1992) - 1991
- [b1]Masakazu Kojima, Nimrod Megiddo, Toshihito Noma, Akiko Yoshise:
A Unified Approach to Interior Point Algorithms for Linear Complementarity Problems. Lecture Notes in Computer Science 538, Springer 1991, ISBN 3-540-54509-3 - [j22]Masakazu Kojima, Nimrod Megiddo, Toshihito Noma:
Homotopy Continuation Methods for Nonlinear Complementarity Problems. Math. Oper. Res. 16(4): 754-774 (1991) - [j21]Masakazu Kojima, Shinji Mizuno, Akiko Yoshise:
An O(square root(n) * L) iteration potential reduction algorithm for linear complementarity problems. Math. Program. 50: 331-342 (1991) - [j20]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): 247-254 (1991) - 1990
- [j19]Masakazu Kojima, Shinji Mizuno, Toshihito Noma:
Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems. Math. Oper. Res. 15(4): 662-675 (1990) - [j18]Masakazu Kojima, Shinji Mizuno, Akiko Yoshise:
Ellipsoids that Contain All the Solutions of a Positive Semi-Definite Linear Complementarity Problem. Math. Program. 48: 415-435 (1990)
1980 – 1989
- 1989
- [j17]Masakazu Kojima, Shinji Mizuno, Toshihito Noma:
A new continuation method for complementarity problems with uniformP-functions. Math. Program. 43(1-3): 107-113 (1989) - [j16]Masakazu Kojima, Shinji Mizuno, Akiko Yoshise:
A polynomial-time algorithm for a class of linear complementarity problems. Math. Program. 44(1-3): 1-26 (1989) - 1987
- [j15]Yinyu Ye, Masakazu Kojima:
Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming. Math. Program. 39(3): 305-317 (1987) - 1986
- [j14]Masakazu Kojima:
Determining Basic Variables of Optimal Solutions in Karmarkar's New LP Algorithm. Algorithmica 1(4): 499-515 (1986) - 1985
- [j13]Masakazu Kojima, Akira Okada, Susumu Shindoh:
Strongly Stable Equilibrium Points of N-Person Noncooperative Games. Math. Oper. Res. 10(4): 650-663 (1985) - [j12]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): 235-244 (1985) - 1984
- [j11]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): 288-328 (1984) - 1983
- [j10]Masakazu Kojima, Shinji Mizuno:
Computation of all solutions to a system of polynomial equations. Math. Program. 25(2): 131-157 (1983) - 1982
- [j9]Masakazu Kojima, Yoshitsugu Yamamoto:
Variable dimension algorithms: Basic theory, interpretations and extensions of some existing methods. Math. Program. 24(1): 177-215 (1982) - 1981
- [j8]Masakazu Kojima, Romesh Saigal:
On the number of solutions to a class of complementarity problems. Math. Program. 21(1): 190-203 (1981)
1970 – 1979
- 1979
- [j7]Masakazu Kojima:
A Complementary Pivoting Approach to Parametric Nonlinear Programming. Math. Oper. Res. 4(4): 464-477 (1979) - [j6]Masakazu Kojima, Hisakazu Nishino, Naohiko Arima:
A PL homotopy for finding all the roots of a polynomial. Math. Program. 16(1): 37-62 (1979) - [j5]Masakazu Kojima, Romesh Saigal:
On the number of solutions to a class of linear complementarity problems. Math. Program. 17(1): 136-139 (1979) - 1978
- [j4]Masakazu Kojima:
Studies on Piecewise-Linear Approximations of Piecewise-C1 Mappings in Fixed Points and Complementarity Theory. Math. Oper. Res. 3(1): 17-36 (1978) - [j3]Masakazu Kojima:
A modification of todd's triangulation J3. Math. Program. 15(1): 223-227 (1978) - 1977
- [j2]Nimrod Megiddo, Masakazu Kojima:
On the existence and uniqueness of solutions in nonlinear complementarity theory. Math. Program. 12(1): 110-130 (1977) - 1975
- [j1]Masakazu Kojima:
A unification of the existence theorems of the nonlinear complementarity problem. Math. Program. 9(1): 257-277 (1975)
Coauthor Index
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.
Reference lists
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.
Citation data
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.
OpenAlex data
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 2024-10-22 21:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
