Ye Yinyu

Yinyu Ye

Information about the author Yinyu Ye will soon be added to the site.
Found 48 papers in total
On homogeneous and self-dual algorithms for the linear complementarity problem
On homogeneous and self-dual algorithms for the linear complementarity problem
1997
We present some generalizations of a homogeneous and self-dual linear programming (LP)...
A lower bound on the number of iterations of long-step primal-dual linear programming algorithms
A lower bound on the number of iterations of long-step primal-dual linear programming algorithms
1996
Recently, Todd has analyzed in detail the primal-dual affine-scaling method for linear...
Identifying an optimal basis in linear programming
Identifying an optimal basis in linear programming
1996
The authors propose a sufficient condition that allows an optimal basis to be...
A simplified homogeneous and self-dual linear programming algorithm and its implementation
A simplified homogeneous and self-dual linear programming algorithm and its implementation
1996
The authors present a simplification and generalization of the recent homogeneous and...
On the convergence of the interation sequence in primal-dual interior-point methods
On the convergence of the interation sequence in primal-dual interior-point methods
1995
Recently, numerous research efforts, most of them concerned with superlinear...
Condition numbers for polyhedra with real number data
Condition numbers for polyhedra with real number data
1995
The authors consider the complexity of finding a feasible point inside a polyhedron...
A generalized homogeneous and self-dual algorithm for linear programming
A generalized homogeneous and self-dual algorithm for linear programming
1995
A generalized homogeneous and self-dual infeasible-interior-point algorithm for linear...
Minimal adjustment costs and the optimal choice of inputs under time-of-use electricity rates
Minimal adjustment costs and the optimal choice of inputs under time-of-use electricity rates
1995
In Time-of-Use (TOU) pricing schemes, utilities charge rates that depend on the time...
Finding an interior point in the optimal face of linear programs
Finding an interior point in the optimal face of linear programs
1993
The authors study the problem of finding a point in the relative interior of the...
On quadratic and
On quadratic and
1993
Recently several new results have been developed for the asymptotic (local)...
Convergence behavior of interior-point algorithms
Convergence behavior of interior-point algorithms
1993
The authors show that most interior-point algorithms for linear programming generate a...
Toward probabilistic analysis of interior-point algorithms for linear programming
Toward probabilistic analysis of interior-point algorithms for linear programming
1994
The paper proposes an approach based on interior-point algorithms for linear...
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...
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...
On affine scaling algorithms for nonconvex quadratic programming
On affine scaling algorithms for nonconvex quadratic programming
1992
The paper investigates the use of interior algorithms, especially the affine-scaling...
An potential reduction algorithm for linear programming
An potential reduction algorithm for linear programming
1991
The paper describes a primal-dual potential function for linear programming: where , x...
Comparative analysis of affine scaling algorithms based on simplifying assumptions
Comparative analysis of affine scaling algorithms based on simplifying assumptions
1991
The paper analyzes several affine potential reduction algorithms for linear...
Convergence behavior of Karmarkar’s projective algorithm for solving a simple linear program
Convergence behavior of Karmarkar’s projective algorithm for solving a simple linear program
1991
The authors describe the convergence behavior of Karmarkar’s projective...
A ‘build-down’ scheme for linear programming
A ‘build-down’ scheme for linear programming
1990
The paper proposes a ‘build-down’ scheme for Karmarkar’s algorithm...
Containing and shrinking ellipsoids in the path-following algorithm
Containing and shrinking ellipsoids in the path-following algorithm
1990
The authors describe a new potential function and a sequence of ellipsoids in the...
Recovering optimal basic variables in Karmarkar’s polynomial algorithm for linear programming
Recovering optimal basic variables in Karmarkar’s polynomial algorithm for linear programming
1990
Primal-slack ellipsoids are described which contain all of the optimal primal feasible...
A centered projective algorithm for linear programming
A centered projective algorithm for linear programming
1990
The authors describe a projective algorithm for linear programming that shares...
An extension of Karmarkar’s projective algorithm for convex quadratic programming
An extension of Karmarkar’s projective algorithm for convex quadratic programming
1989
The authors present an extension of Karmarkar’s linear programming algorithm for...
Papers per page: