|
|
eCommons@Cornell >
Browsing by Author Ye, Y.
Showing results 1 to 10 of 10
| Preview | Issue Date | Title | Author(s) | | Jan-1990 | Anticipated Behavior of Long-Step Algorithms for Linear Programming. | Mizuno, S.; Todd, M. J.; Ye, Y. |
| Dec-1989 | Anticipated Behavior of Path-Following Algorithms for Linear Programming | Mizuno, S.; Todd, M. J.; Ye, Y. |
| Nov-1994 | Approximate Farkas Lemmas and Stopping Rules for Iterative Infeasible-Point Algorithms for Linear Programming | Todd, M. J.; Ye, Y. |
| Dec-1987 | A Centered Projective Algorithm for Linear Programming | Todd, M.; Ye, Y. |
| Apr-1996 | Infeasible-Start Primal-Dual Methods and Infeasibility Detectors for Nonlinear Programming Problems | Yu.E. Nesterov; Todd, M. J.; Ye, Y. |
| Jan-1994 | A Lower Bound on the Number of Iterations of Long-Step and Polynomial Interior-Point Linear Programming Algorithms | Todd, M. J.; Ye, Y. |
| Oct-1990 | On adaptive-step primal-dual interior-point algorithms for linear programming | Mizuno, S.; Todd, M. J.; Ye, Y. |
| Jun-1992 | An O(square-root[nL])-Iteration Homogeneous and Self-Dual Linear Programming Algorithm | Ye, Y.; Todd, M.; Mizuno, S. |
| Oct-1998 | Probabilistic analysis of two complexity measures for linear programming problems | Todd, M. J.; Tuncel, L.; Ye, Y. |
| Jan-1993 | A Surface of Analytic Centers and Infeasible- Interior-Point Algorithms for Linear Programming | Mizuno, S.; Todd, M. J.; Ye, Y. |
Showing results 1 to 10 of 10
|
