Kojima Masakazu

Masakazu Kojima

Information about the author Masakazu Kojima will soon be added to the site.
Found 26 papers in total
Equality based contraction of semidefinite programming relaxations in polynomial optimization
Equality based contraction of semidefinite programming relaxations in polynomial optimization
2008
The SDP (semidefinite programming) relaxation for general POPs (polynomial...
Efficient evaluation of polynomials and their partial derivatives in homotopy continuation methods
Efficient evaluation of polynomials and their partial derivatives in homotopy continuation methods
2008
The aim of this paper is to study how efficiently we evaluate a system of multivariate...
Sparse second order cone programming formulations for convex optimization problems
Sparse second order cone programming formulations for convex optimization problems
2008
Second order cone program (SOCP) formulations of convex optimization problems are...
Solving large scale optimization problems via grid and cluster computing
Solving large scale optimization problems via grid and cluster computing
2004
Solving large scale optimization problems requires a huge amount of computational...
Second order cone programming relaxation of a positive semidefinite constraint
Second order cone programming relaxation of a positive semidefinite constraint
2003
The positive semidefinite constraint for the variable matrix in semidefinite...
Complexity analysis of successive convex relaxation methods for nonconvex sets
Complexity analysis of successive convex relaxation methods for nonconvex sets
2001
This paper discusses computational complexity of conceptual successive convex...
On the finite convergence of successive semidefinite programming relaxation methods
On the finite convergence of successive semidefinite programming relaxation methods
2002
Let F be a subset of the n -dimensional Euclidean space R n represented in terms of a...
Enumeration of all solutions of a combinatorial linear inequality system arising from the polyhedral homotopy continuation method
Enumeration of all solutions of a combinatorial linear inequality system arising from the polyhedral homotopy continuation method
2002
An interesting combinatorial (enumeration) problem arises in the initial phase of the...
Using the conjugate gradient method in interior-points methods for semidefinite programs
Using the conjugate gradient method in interior-points methods for semidefinite programs
1998
In recent years, Semidefinite Programming (SDP) has been intensively studied from both...
Local convergence of predictor–corrector infeasible-interior-point algorithms for SDPs and SDLCPs
Local convergence of predictor–corrector infeasible-interior-point algorithms for SDPs and SDLCPs
1998
An example of an SDP (semidefinite program) exhibits a substantial difficulty in...
Exploiting sparsity in primal–dual interior-point methods for semidefinite programming
Exploiting sparsity in primal–dual interior-point methods for semidefinite programming
1997
The...
Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs
Basic lemmas in polynomial-time infeasible-interior-point methods for linear programs
1996
The primal-dual infeasible-interior-point algorithm is knwon as one of the most...
Global convergence in infeasible-interior-point algorithms
Global convergence in infeasible-interior-point algorithms
1994
This paper presents a wide class of globally convergent interior-point algorithms for...
On the big
On the big
1993
When the affine scaling algorithm is applied to a linear program, an artificial linear...
A primal-dual infeasible-interior-point algorithm for linear programming
A primal-dual infeasible-interior-point algorithm for linear programming
1993
As in many primal-dual interior-point algorithms, a primal-dual...
A little theorem of the big
A little theorem of the big
1993
When the authors apply interior point algorithms to various problems including linear...
Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
1993
This paper proposes two sets of rules, Rule G and Rule P, for controlling step lengths...
A general framework of continuation methods for complementarity problems
A general framework of continuation methods for complementarity problems
1993
A general class of continuation methods is presented which, in particular, solve...
An interior point potential reduction algorithm for the linear complementarity problem
An interior point potential reduction algorithm for the linear complementarity problem
1992
The linear complementarity problem can be viewed as the problem of minimizing subject...
An iteration potential reduction algorithm for linear complementarity problems
An iteration potential reduction algorithm for linear complementarity problems
1991
This paper proposes an interior point algorithm for a positive semi-definite linear...
Homotopy continuation methods for nonlinear complementarity problems
Homotopy continuation methods for nonlinear complementarity problems
1991
A complementarity problem with a continuous mapping f from R n into itself can be...
A unified approach to interior point algorithms for linear complementarity problems: A summary
A unified approach to interior point algorithms for linear complementarity problems: A summary
1991
This note summarizes a report with the same title, where a study was carried out...
Limiting behavior of trajectories generated by a continuation method for monotone complementarity problems
Limiting behavior of trajectories generated by a continuation method for monotone complementarity problems
1990
Defining the mapping F from the 2 n- dimensional Euclidean space into itself by for...
Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem
Ellipsoids that contain all the solutions of a positive semi-definite linear complementarity problem
1990
This paper deals with the LCP (linear complementarity problem) with a positive...
Papers per page: