Ye Y.

Y. Ye

Information about the author Y. Ye will soon be added to the site.
Found 13 papers in total
On some interior-point algorithms for nonconvex quadratic optimization
On some interior-point algorithms for nonconvex quadratic optimization
2002
Recently, interior-point algorithms have been applied to nonlinear and nonconvex...
An improved rounding method and semidefinite programming relaxation for graph partition
An improved rounding method and semidefinite programming relaxation for graph partition
2002
Given an undirected graph G = (V, E) with |V| = n and an integer k...
A .699-approximation algorithm for max-bisection
A .699-approximation algorithm for max-bisection
2001
We present a .699-approximation algorithm for max-bisection, i.e., partitioning the...
Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems
Characterizations, bounds, and probabilistic analysis of two complexity measures for linear programming problems
2001
This note studies -->χ --> A , a condition number used in the linear programming...
Predictor–corrector method for nonlinear complementarity problem
Predictor–corrector method for nonlinear complementarity problem
1997
Ye et al . proved that the predictor–corrector method proposed by Mizuno et al ....
A generalized predictor–corrector linear programming algorithm
A generalized predictor–corrector linear programming algorithm
1995
According to the homogeneous and self-dual linear programming model and the reduced...
On a homogeneous algorithm for the monotone complementarity problem
On a homogeneous algorithm for the monotone complementarity problem
1999
We present a generalization of a homogeneous self-dual linear programming (LP)...
Infeasible-start primal–dual methods and infeasibility detectors for nonlinear programming problems
Infeasible-start primal–dual methods and infeasibility detectors for nonlinear programming problems
1999
In this paper we present several ‘infeasible-start’ path-following and...
Approximating quadratic programming with bound and quadratic constraints
Approximating quadratic programming with bound and quadratic constraints
1999
We consider the problem of approximating the global maximum of a quadratic program...
Predictor–corrector method for nonlinear complementarity problem
Predictor–corrector method for nonlinear complementarity problem
1997
Ye et al . proved that the predictor–corrector method proposed by Mizuno et al ....
A generalized predictor–corrector linear programming algorithm
A generalized predictor–corrector linear programming algorithm
1995
According to the homogeneous and self-dual linear programming model and the reduced...
Near boundary behavior of primal-dual potential reduction algorithms for linear programming
Near boundary behavior of primal-dual potential reduction algorithms for linear programming
1993
This paper is concerned with selection of the - parameter in the primal-dual potential...
A quadratically convergent -iteration algorithm for linear programming
A quadratically convergent -iteration algorithm for linear programming
1993
Recently, Ye, Tapia and Zhang demonstrated that Mizuno-Todd-Ye's predictor-corrector...
Papers per page: