Limiting behavior of weighted central paths in linear programming
暂无分享,去创建一个
[1] D. Bayer,et al. The nonlinear geometry of linear programming. II. Legendre transform coordinates and central trajectories , 1989 .
[2] D. Bayer,et al. The Non-Linear Geometry of Linear Pro-gramming I: A?ne and projective scaling trajectories , 1989 .
[3] I. S. Gradshteyn. Table of Integrals, Series and Products, Corrected and Enlarged Edition , 1980 .
[4] Shinji Mizuno,et al. On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming , 1993, Math. Oper. Res..
[5] R. C. Monteiro,et al. Interior path following primal-dual algorithms , 1988 .
[6] Shinji Mizuno,et al. A polynomial-time algorithm for a class of linear complementarity problems , 1989, Math. Program..
[7] Renato D. C. Monteiro,et al. Limiting behavior of the affine scaling continuous trajectories for linear programming problems , 1991, Math. Program..
[8] Sanjay Mehrotra,et al. Quadratic Convergence in a Primal-Dual Method , 1993, Math. Oper. Res..
[9] Yinyu Ye,et al. An O(n3L) potential reduction algorithm for linear programming , 1991, Math. Program..
[10] G. Sonnevend. An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming , 1986 .
[11] L. McLinden,et al. Polyhedral extensions of some theorems of linear programming , 1982, Math. Program..
[12] N. Megiddo. Pathways to the optimal set in linear programming , 1989 .
[13] Anthony V. Fiacco,et al. Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .
[14] Kurt M. Anstreicher,et al. Linear programming and the newton barrier flow , 1988, Math. Program..
[15] Renato D. C. Monteiro,et al. Interior path following primal-dual algorithms. part I: Linear programming , 1989, Math. Program..
[16] Yin Zhang,et al. A quadratically convergent O( $$\sqrt n $$ L)-iteration algorithm for linear programming , 1993, Math. Program..
[17] Nimrod Megiddo,et al. Boundary Behavior of Interior Point Algorithms in Linear Programming , 1989, Math. Oper. Res..
[18] Adi Ben-Israel,et al. Generalized inverses: theory and applications , 1974 .
[19] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, Comb..
[20] L. McLinden. An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem. , 1980 .
[21] S. Itoh,et al. Variational inequalities and complementarity problems , 1978 .
[22] A. Williams. Complementarity Theorems for Linear Programming , 1970 .
[23] Shinji Mizuno,et al. An $$O(\sqrt n L)$$ iteration potential reduction algorithm for linear complementarity problems , 1991, Math. Program..
[24] Osman Güler,et al. Existence of Interior Points and Interior Paths in Nonlinear Monotone Complementarity Problems , 1993, Math. Oper. Res..