The Relation Between the Path of Centers and Smale's Regularization of the Linear Programming Problem
暂无分享,去创建一个
[1] N. Megiddo. Pathways to the optimal set in linear programming , 1989 .
[2] Shinji Mizuno,et al. A polynomial-time algorithm for a class of linear complementarity problems , 1989, Math. Program..
[3] D. Bayer,et al. The Non-Linear Geometry of Linear Pro-gramming I: A?ne and projective scaling trajectories , 1989 .
[4] James Renegar,et al. A polynomial-time algorithm, based on Newton's method, for linear programming , 1988, Math. Program..
[5] G. Sonnevend. An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming , 1986 .
[6] S. Itoh,et al. Variational inequalities and complementarity problems , 1978 .
[7] Nimrod Megiddo,et al. On the existence and uniqueness of solutions in nonlinear complementarity theory , 1977, Math. Program..
[8] Herbert E. Scarf,et al. The Solution of Systems of Piecewise Linear Equations , 1976, Math. Oper. Res..
[9] M. J. D. Powell,et al. Nonlinear Programming—Sequential Unconstrained Minimization Techniques , 1969 .
[10] Anthony V. Fiacco,et al. Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .
[11] G. Dantzig,et al. COMPLEMENTARY PIVOT THEORY OF MATHEMATICAL PROGRAMMING , 1968 .