{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:23:48Z","timestamp":1787333028701,"version":"build-2736575974"},"reference-count":22,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Optim."],"published-print":{"date-parts":[[2000,1]]},"abstract":"<jats:p>Minimizing a separable convex objective subject to an ordering restriction on its variables is a generalization of a class of problems in statistical estimation and inventory control. It is shown that a pool adjacent violators (PAV) algorithm can be used to compute an optimal solution of this problem as well as the minimal and maximal extended solutions, which provide lower and upper bounds on all optimal solutions and solve certain subproblems. These results unify and extend several previously known results. In addition, it is shown that a PAV algorithm can be applied to solving the problem with integer constraints on the variables.<\/jats:p>","DOI":"10.1137\/s1052623497314970","type":"journal-article","created":{"date-parts":[[2003,6,11]],"date-time":"2003-06-11T11:12:06Z","timestamp":1055329926000},"page":"658-672","source":"Crossref","is-referenced-by-count":30,"title":["Minimizing Separable Convex Functions Subject to Simple Chain Constraints"],"prefix":"10.1137","volume":"10","author":[{"given":"Michael J.","family":"Best","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nilotpal","family":"Chakravarti","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vasant A.","family":"Ubhaya","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,31]]},"reference":[{"key":"R1","unstructured":"A. Aho, D\u017e. Hopkroft, D\u017e. Ul\u2019man, Postroenie i analiz vychislitelnykh algoritmov, \u201cMir\u201d, 1979, 536\u20130, Translated by A. O. Slisenko; Edited by Ju. V. Matijasevi\u010d80g:68036"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580873"},{"key":"R3","unstructured":"M. J. Best, N. Chakravarti, and V. A. Ubhaya,\n                      Minimizing Separable Convex Functions Subject to Simple Chain Constraints\n                      , Technical Report, Department of Computer Science and Operations Research, 258 IACC Building, North Dakota State University, Fargo, ND, 1996."},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1287\/moor.14.2.303"},{"key":"R5","unstructured":"F. H. Clarke,\n                      Optimization and Nonsmooth Analysis\n                      , John Wiley, New York, 1983;"},{"key":"R5","unstructured":"reprinted as Classics in Appl. Math. 5, SIAM, Philadelphia, 1990."},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1007\/BF01449044"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1976.10480351"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1007\/BF00536190"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1016\/0021-9045(81)90076-9"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623494272302"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0121104"},{"key":"R12","volume-title":"Handbook of computational geometry","author":"Sack J.\u2010R.","year":"2000"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1176345014"},{"key":"R14","unstructured":"T. Robertson, F. T. Wright, and R. L. Dykstra,\n                      Order Restricted Statistical Inference\n                      , John Wiley, New York, 1988."},{"key":"R15","first-page":"1","volume":"1","author":"Rockafellar R.","year":"2000","journal-title":"J. Nonlinear Convex Anal."},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.21.11.1285"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1016\/0167-9473(91)90072-A"},{"key":"R18","doi-asserted-by":"publisher","DOI":"10.1016\/0021-9045(74)90044-6"},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(79)90293-2"},{"key":"R20","doi-asserted-by":"publisher","DOI":"10.1016\/0898-1221(87)90185-4"},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1016\/0021-9045(90)90022-I"}],"container-title":["SIAM Journal on Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/S1052623497314970","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T16:26:41Z","timestamp":1787329601000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/S1052623497314970"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["10.1137\/S1052623497314970"],"URL":"https:\/\/doi.org\/10.1137\/s1052623497314970","relation":{},"ISSN":["1052-6234","1095-7189"],"issn-type":[{"value":"1052-6234","type":"print"},{"value":"1095-7189","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}