论文信息 - Appendix C: Optimization - 字舞流文

Appendix C: Optimization

Dirk P. Kroese | Zdravko I. Botev | Thomas Taimre

[1] K. I. M. McKinnon,et al. Convergence of the Nelder-Mead Simplex Method to a Nonstationary Point , 1998, SIAM J. Optim..

[2] Panos M. Pardalos,et al. Minimax Problems in Combinatorial Optimization , 1995 .

[3] N. Z. Shor. Cut-off method with space extension in convex programming problems , 1977, Cybernetics.

[4] Stephen P. Boyd,et al. A tutorial on geometric programming , 2007, Optimization and Engineering.

[5] K. Borgwardt. The Simplex Method: A Probabilistic Analysis , 1986 .

[6] E. L. Lawler,et al. Branch-and-Bound Methods: A Survey , 1966, Oper. Res..

[7] J. E. Kelley,et al. The Cutting-Plane Method for Solving Convex Programs , 1960 .

[8] Stephen P. Boyd,et al. Semidefinite Programming , 1996, SIAM Rev..

[9] L. Khachiyan. Polynomial algorithms in linear programming , 1980 .