On the complexity of following the central path of linear programs by linear extrapolation II
暂无分享,去创建一个
Josef Stoer | G. Sonnevend | G. Zhao | J. Stoer | G. Sonnevend | G. Zhao
[1] G. Sonnevend. Sequential algorithms of optimal order global error for the uniform recovery of functions with monotone (r-1) derivatives , 1984 .
[2] J. Stoer,et al. An implementation of the method of analytic centers , 1988 .
[3] M. Todd,et al. Recent Developments and New Directions in Linear Programming , 1988 .
[4] F. Jarre. On the method of analytic centers for solving smooth convex programs , 1988 .
[5] Aeneas Marxen. Primal Barrier Methods for Linear Programming , 1989 .
[6] C. C. Gonzaga,et al. An Algorithm for Solving Linear Programming Problems in O(n 3 L) Operations , 1989 .
[7] Paul D. Domich,et al. Optimal 3-dimensional methods for linear programming , 1989 .
[8] Paul D. Domich,et al. Algorithmic Enhancements to the Method of Centers for Linear Programming Problems , 1989, INFORMS J. Comput..
[9] Mauricio G. C. Resende,et al. An implementation of Karmarkar's algorithm for linear programming , 1989, Math. Program..
[10] J. Stoer,et al. Global ellipsoidal approximations and homotopy methods for solving convex analytic programs , 1990 .
[11] György Sonnevend. Application of Analytic Centers to Feedback Design for Systems with Uncertainties , 1990 .
[12] Masao Iri,et al. Integrability of vector and multivector fields associated with interior point methods for linear programming , 1991, Math. Program..
[13] I. Lustig,et al. Computational experience with a primal-dual interior point method for linear programming , 1991 .
[14] Shinji Mizuno,et al. An $$O(\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problems , 1991, Math. Program..
[15] Jean-Philippe Vial,et al. A polynomial method of approximate centers for linear programming , 1992, Math. Program..
[16] J. Goffin,et al. Decomposition and nondifferentiable optimization with the projective algorithm , 1992 .