{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T14:31:25Z","timestamp":1774449085012,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1974,12,1]],"date-time":"1974-12-01T00:00:00Z","timestamp":155088000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1974,12]]},"DOI":"10.1007\/bf01580223","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:58:43Z","timestamp":1114682323000},"page":"62-88","source":"Crossref","is-referenced-by-count":1024,"title":["Validation of subgradient optimization"],"prefix":"10.1007","volume":"6","author":[{"given":"Michael","family":"Held","sequence":"first","affiliation":[]},{"given":"Philip","family":"Wolfe","sequence":"additional","affiliation":[]},{"given":"Harlan P.","family":"Crowder","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","first-page":"1","volume-title":"Proceedings of the Princeton symposium on mathematical programming","author":"J. Abadie","year":"1970","unstructured":"J. Abadie and M. Sakarovitch, \u201cTwo methods of decomposition for linear programming\u201d, in:Proceedings of the Princeton symposium on mathematical programming Ed. H.W. Kuhn (Princeton University Press, Princeton, N.J., 1970) pp 1\u201323."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"382","DOI":"10.4153\/CJM-1954-037-2","volume":"6","author":"S. Agmon","year":"1954","unstructured":"S. Agmon, \u201cThe relaxation method for linear inequalities\u201d,Canadian Journal of Mathematics 6 (1954) 382\u2013392.","journal-title":"Canadian Journal of Mathematics"},{"key":"CR3","unstructured":"D.P. Bertsekas and S.K. Mitter, \u201cSteepest descent for optimization problems with nondifferentiable cost functionals\u201d, in:Proceedings of the 5 th annual Princeton conference on information sciences and systems, 1971."},{"key":"CR4","first-page":"393","volume":"2","author":"G.B. Dantzig","year":"1954","unstructured":"G.B. Dantzig, D.R. Fulkerson and S.M. Johnson, \u201cSolution of a large-scale traveling-salesman problem\u201d,Operations Research 2 (1954) 393\u2013410.","journal-title":"Operations Research"},{"key":"CR5","first-page":"517","volume":"11","author":"V.F. Dem'janov","year":"1970","unstructured":"V.F. Dem'janov, \u201cSeeking a minimax on a bounded set\u201d,Soviet Mathematics Doklady 11 (1970) 517\u2013521. [Translation of:Doklady Akademii Nauk SSSR 191 (1970).]","journal-title":"Soviet Mathematics Doklady"},{"key":"CR6","series-title":"Working Paper OR","volume-title":"Constructive duality in integer programming","author":"M.L. Fisher","year":"1972","unstructured":"M.L. Fisher and J.F. Shapiro, \u201cConstructive duality in integer programming\u201d, Working Paper OR 008-72, Operations Research Center, Massachusetts Institute of Technology, Cambridge, Mass. (April, 1972)."},{"key":"CR7","volume-title":"Flows in networks","author":"L.R. Ford Jr.","year":"1962","unstructured":"L.R. Ford, Jr. and D.R. Fulkerson,Flows in networks (Princeton University Press, Princeton, N.J., 1962)."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1287\/mnsc.16.11.652","volume":"16","author":"A.M. Geoffrion","year":"1970","unstructured":"A.M. Geoffrion, \u201cElements of large-scale mathematical programming\u201d,Management Science 16 (1970) 652\u2013691.","journal-title":"Management Science"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1137\/1014070","volume":"14","author":"R.C. Grinold","year":"1972","unstructured":"R.C. Grinold, \u201cSteepest ascent for large-scale linear programs\u201d,SIAM Review 14 (1972) 447\u2013464.","journal-title":"SIAM Review"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"1138","DOI":"10.1287\/opre.18.6.1138","volume":"18","author":"M. Held","year":"1970","unstructured":"M. Held and R.M. Karp, \u201cThe traveling-salesman problem and minimum spanning trees\u201d,Operations Research 18 (1970) 1138\u20131162.","journal-title":"Operations Research"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","volume":"1","author":"M. Held","year":"1971","unstructured":"M. Held and R.M. Karp, \u201cThe traveling-salesman problem and minimum spanning trees: part II\u201d,Mathematical Programming 1 (1971) 6\u201325.","journal-title":"Mathematical Programming"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M. Held","year":"1962","unstructured":"M. Held and R.M. Karp, \u201cA dynamic programming approach to sequencing problems\u201d,Journal of the Society for Industrial and Applied Mathematics 10 (1962) 196\u2013210.","journal-title":"Journal of the Society for Industrial and Applied Mathematics"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1287\/mnsc.10.2.225","volume":"10","author":"L.L. Karg","year":"1964","unstructured":"L.L. Karg and G.L. Thompson, \u201cA heuristic approach to solving traveling-salesman problems\u201d,Management Science 10 (1964) 225\u2013248.","journal-title":"Management Science"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1525\/9780520411586-036","volume-title":"Proceedings of the second Berkeley symposium on mathematical statistics and probability","author":"H.W. Kuhn","year":"1951","unstructured":"H.W. Kuhn and A.W. Tucker, \u201cNonlinear programming\u201d, in:Proceedings of the second Berkeley symposium on mathematical statistics and probability Ed. J. Neyman (University of California Press, Berkeley, Calif., 1951) pp. 481\u2013492."},{"key":"CR15","volume-title":"Optimization theory for large systems","author":"L.S. Lasdon","year":"1970","unstructured":"L.S. Lasdon,Optimization theory for large systems (Macmillan, London, 1970)."},{"key":"CR16","volume-title":"Boxstep: a new strategy for Lagrangian decomposition","author":"R.E. Marsten","year":"1973","unstructured":"R.E. Marsten and J.W. Blankenship, \u201cBoxstep: a new strategy for Lagrangian decomposition\u201d, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Ill. (March, 1973)."},{"key":"CR17","doi-asserted-by":"crossref","first-page":"393","DOI":"10.4153\/CJM-1954-038-x","volume":"6","author":"T. Motzkin","year":"1954","unstructured":"T. Motzkin and I.J. Schoenberg, \u201cThe relaxation method for linear inequalities\u201d,Canadian Journal of Mathematics 6 (1954) 393\u2013404.","journal-title":"Canadian Journal of Mathematics"},{"key":"CR18","series-title":"Annals of Mathematics Study","volume-title":"Contributions to the theory of games, Vol. II","author":"J. Neumann von","year":"1953","unstructured":"J. von Neumann, \u201cA certain zero-sum two-person game equivalent to the optimal assignment problem\u201d, in:Contributions to the theory of games, Vol. II, Eds. H.W. Kuhn and A.W. Tucker, Annals of Mathematics Study No. 28 (Princeton University Press, Princeton, N.J., 1953)."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1007\/BF01585003","volume":"3","author":"W. Oettli","year":"1972","unstructured":"W. Oettli, \u201cAn iterative method, having linear rate of convergence, for solving a pair of dual linear programs\u201d,Mathematical Programming 3 (1972) 302\u2013311.","journal-title":"Mathematical Programming"},{"key":"CR20","first-page":"593","volume":"8","author":"B.T. Poljak","year":"1967","unstructured":"B.T. Poljak, \u201cA general method of solving extremum problems\u201d, Soviet Mathematics Doklady 8 (1967) 593\u2013597. [Translation ofDoklady Akademii Nauk SSSR 174 (1967).]","journal-title":"Soviet Mathematics Doklady"},{"key":"CR21","unstructured":"B.T. Poljak, \u201cMinimization of unsmooth functionals\u201d,U.S.S.R. Computational Mathematics and Mathematical Physics 14\u201329. [Translation of: \u017durnal Vy\u010dislitel'no $$\\mathop i\\limits^ \\vee $$ Matematiki i Matemati\u010desko $$\\mathop i\\limits^ \\vee $$ Fiziki 9 (1969) 509\u2013521.]"},{"key":"CR22","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"R.T. Rockafellar,Convex analysis (Princeton University Press, Princeton, N.J., 1970)."},{"key":"CR23","unstructured":"N.Z. Shor, \u201cOn the structure of algorithms for the numerical solution of optimal planning and design problems\u201d, Dissertation, Cybernetics Institute, Academy of Sciences U.S.S.R. (1964)."},{"key":"CR24","unstructured":"P. Wolfe, M. Held and R.M. Karp, \u201cLarge-scale optimization and the relaxation method\u201d, in:Proceedings of the 25 th national ACM meeting, Boston, Mass. (August 1972)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580223.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01580223\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580223","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,31]],"date-time":"2024-12-31T23:31:26Z","timestamp":1735687886000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01580223"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1974,12]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1974,12]]}},"alternative-id":["BF01580223"],"URL":"https:\/\/doi.org\/10.1007\/bf01580223","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1974,12]]}}}