论文信息 - The Cutting-Plane Method for Solving Convex Programs - 字舞流文

The Cutting-Plane Method for Solving Convex Programs

J. E. Kelley | Jr. James E. Kelley

[1] J. B. Rosen. The gradient projection method for nonlinear programming: Part II , 1961 .

[2] P. Wolfe. Accelerating the Cutting Plane Method for Nonlinear Programming , 1961 .

[3] J. B. Rosen. The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints , 1960 .

[4] A. A. Goldstein,et al. Newton's method for convex programming and Tchebycheff approximation , 1959, Numerische Mathematik.

[5] G. Dantzig,et al. Notes on Linear Programming: Part 1. The Generalized Simplex Method for Minimizing a Linear Form under Linear Inequality Restraints , 1954 .

[6] C. E. Lemke,et al. The dual method of solving the linear programming problem , 1954 .