The following pages link to Shinji Mizuno (Q173893):
Displaying 30 items.
- Computation of all solutions to a system of polynomial equations (Q3666603) (← links)
- ALGORITHMS USING A BRANCH AND BOUND METHOD FOR FINDING ALL REAL SOLUTIONS TO AN EQUATION OF ONE VARIABLE (Q3826007) (← links)
- (Q4250861) (← links)
- (Q4253467) (← links)
- A General Framework of Continuation Methods for Complementarity Problems (Q4286943) (← links)
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming (Q4286944) (← links)
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm (Q4294729) (← links)
- Monotonicity of Primal and Dual Objective Values in Primal-dual Interior-point Algorithms (Q4308558) (← links)
- (Q4347845) (← links)
- (Q4496026) (← links)
- SMALL DEGENERATE SIMPLICES CAN BE BAD FOR SIMPLEX METHODS (Q4609153) (← links)
- (Q4645555) (← links)
- (Q4705034) (← links)
- (Q4705458) (← links)
- SOLUTION ALGORITHMS OF A SYSTEM OF EQUATIONS AND MINIMIZATION OF A FUNCTION BY A BRANCH AND BOUND METHOD (Q4721554) (← links)
- Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming (Q4764308) (← links)
- A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming (Q4835390) (← links)
- A Superlinearly Convergent Infeasible-Interior-Point Algorithm for Geometrical LCPs Without a Strictly Complementary Condition (Q4895564) (← links)
- (Q4906130) (← links)
- (Q4963655) (← links)
- A 2-APPROXIMATION ALGORITHM FOR THE MINIMUM KNAPSACK PROBLEM WITH A FORCING GRAPH (Q5267564) (← links)
- Large-Step Interior Point Algorithms for Linear Complementarity Problems (Q5287109) (← links)
- (Q5376370) (← links)
- AN EXTENSION OF A MINIMAX APPROACH TO MULTIPLE CLASSIFICATION (Q5384892) (← links)
- AN EXTENSION OF A MINIMAX APPROACH TO MULTIPLE CLASSIFICATION (Q5440942) (← links)
- (Q5462187) (← links)
- (Q5750715) (← links)
- Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems (Q5752302) (← links)
- A 3-approximation list scheduling algorithm for a single-machine scheduling problem with a non-renewable resource and total weighted completion time criterion (Q5876237) (← links)
- On two homogeneous self-dual approaches to linear programming and its extensions. (Q5930742) (← links)
