Mizuno Shinji

Shinji Mizuno

Information about the author Shinji Mizuno will soon be added to the site.
Found 29 papers in total
Klee–Minty’s LP and upper bounds for Dantzig’s simplex method
Klee–Minty’s LP and upper bounds for Dantzig’s simplex method
2011
Kitahara and Mizuno (2010) get two upper bounds for the number of different basic...
On the number of solutions generated by the dual simplex method
On the number of solutions generated by the dual simplex method
2012
In this short paper, we give an upper bound for the number of different basic feasible...
On the separation in 2‐period double round robin tournaments with minimum breaks
On the separation in 2‐period double round robin tournaments with minimum breaks
2012
This paper considers the separation in 2‐period double round robin tournaments...
An extension of a minimax approach to multiple classification
An extension of a minimax approach to multiple classification
2007
When mean vectors and covariance matrices of two classes are available in a binary...
Robust tracking error optimization problems by second-order cone programming
Robust tracking error optimization problems by second-order cone programming
2005
Recently, a robust optimization model is proposed to portfolio selection problems in a...
A modified layered-step interior-point algorithm for linear programming
A modified layered-step interior-point algorithm for linear programming
1998
The layered-step interior-point algorithm was introduced by Vavasis and Ye. The...
Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation
Global and polynomial-time convergence of an infeasible-interior-point algorithm using inexact computation
1999
In this paper, we propose an infeasible-interior-point algorithm for solving a...
An infeasible-interior-point algorithm using projections onto a convex set
An infeasible-interior-point algorithm using projections onto a convex set
1996
The authors present a new class of primal-dual infeasible-interior-point methods for...
Polynomiality of infeasible-interior-point algorithms for linear programming
Polynomiality of infeasible-interior-point algorithms for linear programming
1994
Kojima, Megiddo, and Mizuno investigate an infeasible-interior-point algorithm for...
A predictor-corrector infeasible-interior-point algorithm for linear programming
A predictor-corrector infeasible-interior-point algorithm for linear programming
1994
The paper presents a predictor-corrector algorithm for solving a primal-dual pair of...
A primal-dual affine-scaling potential-reduction algorithm for linear programming
A primal-dual affine-scaling potential-reduction algorithm for linear programming
1993
The authors propose a potential-reduction algorithm which always uses the primal-dual...
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...
Determination of optimal vertices from feasible solutions in unimodular linear programming
Determination of optimal vertices from feasible solutions in unimodular linear programming
1993
In this paper the authors consider a linear programming problem with the underlying...
An
An
1994
The authors present an -iteration homogeneous and self-dual linear programming (LP)...
On adaptive-step primal-dual interior-point algorithms for linear programming
On adaptive-step primal-dual interior-point algorithms for linear programming
1993
The authors describe several adaptive-step primal-dual interior point algorithms for...
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...
Strict monotonicity in Todd’s low-complexity algorithm for linear programming
Strict monotonicity in Todd’s low-complexity algorithm for linear programming
1992
The authors propose a strictly monotone algorithm in the true objective for linear...
A new polynomial time method for a linear complementarity problem
A new polynomial time method for a linear complementarity problem
1992
The purpose of this paper is to present a new polynomial time method for a linear...
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...
An O(n3L) adaptive path following algorithm for a linear complementarity problem
An O(n3L) adaptive path following algorithm for a linear complementarity problem
1991
This paper proposes an O( n 3 L ) algorithm which is a modification of the path...
A polynomial time interior point algorithm for minimum cost flow problems
A polynomial time interior point algorithm for minimum cost flow problems
1990
This paper deals with a minimum cost flow problem. The authors propose a polynomial...
Strategic manipulation in a society with indivisible goods
Strategic manipulation in a society with indivisible goods
1990
The authors consider a problem of exchanging indivisible goods in a society, in which...
Papers per page: