Information about the author Yinyu Ye will soon be added to the site.
On homogeneous and self-dual algorithms for the linear complementarity problem
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
Recently, Todd has analyzed in detail the primal-dual affine-scaling method for linear...
Identifying an optimal basis in linear programming
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
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
Recently, numerous research efforts, most of them concerned with superlinear...
Condition numbers for polyhedra with real number data
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 infeasible-interior-point algorithm for linear...
Minimal adjustment costs and the optimal choice of inputs under time-of-use electricity rates
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
The authors study the problem of finding a point in the relative interior of the...
On quadratic and
Recently several new results have been developed for the asymptotic (local)...
Convergence behavior of interior-point algorithms
The authors show that most interior-point algorithms for linear programming generate a...
Toward probabilistic analysis of interior-point algorithms for linear programming
The paper proposes an approach based on interior-point algorithms for linear...
The authors present an -iteration homogeneous and self-dual linear programming (LP)...
On adaptive-step primal-dual interior-point algorithms for linear programming
The authors describe several adaptive-step primal-dual interior point algorithms for...
An interior point potential reduction algorithm for the linear complementarity problem
The linear complementarity problem can be viewed as the problem of minimizing subject...
On affine scaling algorithms for nonconvex quadratic programming
The paper investigates the use of interior algorithms, especially the affine-scaling...
An potential reduction algorithm for linear programming
The paper describes a primal-dual potential function for linear programming: where , x...
Comparative analysis of affine scaling algorithms based on simplifying assumptions
The paper analyzes several affine potential reduction algorithms for linear...
Convergence behavior of Karmarkar’s projective algorithm for solving a simple linear program
The authors describe the convergence behavior of Karmarkar’s projective...
A ‘build-down’ scheme for linear programming
The paper proposes a ‘build-down’ scheme for Karmarkar’s algorithm...
Containing and shrinking ellipsoids in the path-following algorithm
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
Primal-slack ellipsoids are described which contain all of the optimal primal feasible...
A centered projective algorithm for linear programming
The authors describe a projective algorithm for linear programming that shares...
An extension of Karmarkar’s projective algorithm for convex quadratic programming
The authors present an extension of Karmarkar’s linear programming algorithm for...
Papers per page: