Validation of subgradient optimization

The “relaxation” procedure introduced by Held and Karp for approximately solving a large linear programming problem related to the traveling-salesman problem is refined and studied experimentally on several classes of specially structured large-scale linear programming problems, and results on the use of the procedure for obtaining exact solutions are given. It is concluded that the method shows promise for large-scale linear programming

[1]  Philip Wolfe,et al.  Contributions to the theory of games , 1953 .

[2]  John von Neumann,et al.  1. A Certain Zero-sum Two-person Game Equivalent to the Optimal Assignment Problem , 1953 .

[3]  I. J. Schoenberg,et al.  The Relaxation Method for Linear Inequalities , 1954, Canadian Journal of Mathematics.

[4]  S. Agmon.  The Relaxation Method for Linear Inequalities , 1954, Canadian Journal of Mathematics.

[5]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[6]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[7]  Toshiro Homma.  On an Iterative Method , 1964 .

[8]  G. L. Thompson,et al.  A Heuristic Approach to Solving Travelling Salesman Problems , 1964 .

[9]  Boris Polyak.  Minimization of unsmooth functionals , 1969 .

[10]  H. L. Le Roy,et al.  Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability; Vol. IV , 1969 .

[11]  Arthur M. Geoffrion,et al.  Elements of large-scale mathematical programming , 1969 .

[12]  Arthur M. Geoffrion.  Elements of Large-Scale Mathematical Programming Part I: Concepts , 1970 .

[13]  Richard M. Karp,et al.  The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..

[14]  Leon S. Lasdon,et al.  Optimization Theory of Large Systems , 1970 .

[15]  D. Bertsekas,et al.  Steepest Descent for Optimization Problems with Nondifferentiable Cost Functionals , 1971 .

[16]  Richard M. Karp,et al.  The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..

[17]  M. Held,et al.  Large scale optimization and the relaxation method , 1972, ACM Annual Conference.

[18]  Werner Oettli.  An iterative method, having linear rate of convergence, for solving a pair of dual linear programs , 1972, Math. Program..

[19]  R. Grinold.  Steepest Ascent for Large Scale Linear Programs , 1972 .

[20]  M. Fisher,et al.  Constructive Duality in Integer Programming , 1974 .

[21]  K. Schittkowski,et al.  NONLINEAR PROGRAMMING , 2022 .