Y. Ye. A class of projective transformations for linear programming. SIAM Journal on Computing, 19:457--466, 1990. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
Interior Point Methods in Semidefinite Programming with.. - Alizadeh (1993) (223 citations) (Correct)
Implementation of Primal-Dual Methods for Semidefinite.. - Monteiro.. (1997) (10 citations) (Correct)
Polynomiality of Primal-Dual Algorithms for Semidefinite.. - Monteiro, Tsuchiya (1996) (4 citations) (Correct)
Primal-Dual Path-Following Algorithms for Semidefinite Programming - Monteiro (1996) (90 citations) (Correct)
Polynomial Convergence of a New Family of Primal-Dual.. - Monteiro, Tsuchiya (1998) (15 citations) (Correct)
Polynomiality of Primal-Dual Algorithms for Semidefinite.. - Monteiro, Tsuchiya (1997) (4 citations) (Correct)
Polynomial Convergence of Primal-Dual Algorithms for.. - Monteiro (1997) (30 citations) (Correct)
A Unified Analysis for a Class of Long-Step Primal-Dual.. - Monteiro, Zhang (1998) (8 citations) (Correct)
Interior Point Methods In Semidefinite Programming With.. - Alizadeh (1995) (223 citations) (Correct)
Optimization with Semidefinite, Quadratic and Linear.. - Alizadeh, Schmieta (1997) (Correct)
Iri's polynomiality proof for the Iri-Imai method recast - den Hertog, Roos, Terlaky (1991) (Correct)
New Interior Point Algorithms in Linear Programming - Darvay (2003) (Correct)
Semidefinite and Cone Programming Bibliography/Comments - Wolkowicz (2004) (Correct)
Line Search in Potential Reduction Algorithms for Linear.. - Yinyu Ye (1989) (3 citations) Self-citation (Ye) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC