Centered newton method for mathematical programming
暂无分享,去创建一个
[1] K. Tanabe. Continuous Newton-Raphson method for solving and underdetermined system of nonlinear equations☆ , 1979 .
[2] K. Tanabe. A geometric method in nonlinear programming , 1980 .
[3] Narendra Karmarkar,et al. A new polynomial-time algorithm for linear programming , 1984, Comb..
[4] K. Tanabe. Global analysis of continuous analogues of the Levenberg-Marquardt and Newton-Raphson methods for solving nonlinear equations , 1985 .
[5] Nimrod Megiddo,et al. A note on degeneracy in linear programming , 1986, Math. Program..
[6] G. Sonnevend. An "analytical centre" for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming , 1986 .
[7] H. Imai. EXTENSIONS OF THE MULTIPLICATIVE PENALTY FUNCTION METHOD FOR LINEAR PROGRAMMING , 1987 .
[8] N. Megiddo. Pathways to the optimal set in linear programming , 1989 .