{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T07:35:52Z","timestamp":1775028952158,"version":"3.50.1"},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2000,2]]},"DOI":"10.1016\/s0167-6377(99)00063-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:26:40Z","timestamp":1027636000000},"page":"1-8","source":"Crossref","is-referenced-by-count":47,"title":["A variable target value method for nondifferentiable optimization"],"prefix":"10.1016","volume":"26","author":[{"given":"Hanif D.","family":"Sherali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gyunghyun","family":"Choi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cihan H.","family":"Tuncbilek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(99)00063-2_BIB1","doi-asserted-by":"crossref","first-page":"380","DOI":"10.1016\/0377-2217(81)90096-5","article-title":"On the choice of step sizes in subgradient optimization","volume":"7","author":"Bazaraa","year":"1981","journal-title":"Eur. J. Oper. Res."},{"key":"10.1016\/S0167-6377(99)00063-2_BIB2","unstructured":"U.G. Br\u00e4nnlund, On relaxation methods for nonsmooth convex optimization, Ph.D. Thesis, Kungliga Tekniska Hogskolan, S-100 44 Stockholm, Sweden, 1993."},{"key":"10.1016\/S0167-6377(99)00063-2_BIB3","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/BFb0120697","article-title":"On improving relaxation methods by modified gradient techniques","volume":"3","author":"Camerini","year":"1975","journal-title":"Math. Programm. Study"},{"key":"10.1016\/S0167-6377(99)00063-2_BIB4","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1007\/BF01584346","article-title":"On the convergence rate of subgradient methods","volume":"13","author":"Goffin","year":"1977","journal-title":"Math. Programm."},{"key":"10.1016\/S0167-6377(99)00063-2_BIB5","unstructured":"J.L. Goffin, K.C. Kiwiel, Convergence of a simple subgradient level method, GERAD Report G-96-56, 1998, Math. Programm., to appear."},{"key":"10.1016\/S0167-6377(99)00063-2_BIB6","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1007\/BF01584070","article-title":"The traveling salesman problem and minimum spanning trees: part II","volume":"1","author":"Held","year":"1971","journal-title":"Math. Programm."},{"key":"10.1016\/S0167-6377(99)00063-2_BIB7","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1007\/BF01580223","article-title":"Validation of subgradient optimization","volume":"6","author":"Held","year":"1974","journal-title":"Math. Programm."},{"key":"10.1016\/S0167-6377(99)00063-2_BIB8","doi-asserted-by":"crossref","unstructured":"W. Hock, K. Schittkowski, Test examples for nonlinear programming codes, Lecture Notes in Economics and Mathematical Systems, Vol. 187, Springer, Berlin, 1981.","DOI":"10.1007\/978-3-642-48320-2"},{"key":"10.1016\/S0167-6377(99)00063-2_BIB9","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF01588797","article-title":"Variable target value subgradient method","volume":"49","author":"Kim","year":"1991","journal-title":"Math. Programm."},{"key":"10.1016\/S0167-6377(99)00063-2_BIB10","doi-asserted-by":"crossref","unstructured":"K.C. Kiwiel, Methods of Descent of Nondifferentiable Optimization, Lecture Notes in Mathematics, Vol. 1133, Springer, Berlin, 1985.","DOI":"10.1007\/BFb0074500"},{"key":"10.1016\/S0167-6377(99)00063-2_BIB11","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF01585731","article-title":"Proximity control in bundle methods for convex nondifferentiable minimization","volume":"46","author":"Kiwiel","year":"1990","journal-title":"Math. Programm."},{"issue":"2","key":"10.1016\/S0167-6377(99)00063-2_BIB12","doi-asserted-by":"crossref","first-page":"660","DOI":"10.1137\/0334031","article-title":"The efficiency of subgradient projection methods for convex optimization, part I: general level methods; part II: implementations and extensions","volume":"34","author":"Kiwiel","year":"1996","journal-title":"SIAM J. Control Optim."},{"issue":"1","key":"10.1016\/S0167-6377(99)00063-2_BIB13","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1023\/A:1022671302532","article-title":"Subgradient method with entropic projections for convex nondifferentiable minimization","volume":"96","author":"Kiwiel","year":"1998","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/S0167-6377(99)00063-2_BIB14","doi-asserted-by":"crossref","unstructured":"A.N. Kulikov, V.R. Fazylov, Convex optimization with prescribed accuracy, USSR Comput. Maths. Math. Phys. 30(3) (1990) 16\u201322. (Zh. Vychisl Mat. i Fiz. 30(5) (1990) 663\u2013671.)","DOI":"10.1016\/0041-5553(90)90185-U"},{"key":"10.1016\/S0167-6377(99)00063-2_BIB15","unstructured":"C. Lemarechal, Numerical experiments in nonsmooth optimization, in: E.A. Nurminski (Ed.), Progress in Nondifferentiable Optimization, Pergamon Press, Oxford, 1982, pp. 61\u201384."},{"key":"10.1016\/S0167-6377(99)00063-2_BIB16","unstructured":"C. Lemarechal, R. Mifflin, Nonsmooth optimization, Proceedings of an IIASA Workshop, March 28\u2013April 8, 1977, Pergamon Press, Oxford, 1978."},{"key":"10.1016\/S0167-6377(99)00063-2_BIB17","first-page":"593","article-title":"A general method for solving extremal problems","volume":"8","author":"Polyak","year":"1967","journal-title":"Sov. Math."},{"key":"10.1016\/S0167-6377(99)00063-2_BIB18","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01447654","article-title":"A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems","volume":"20","author":"Sherali","year":"1989","journal-title":"Appl. Math. Optim."},{"key":"10.1016\/S0167-6377(99)00063-2_BIB19","unstructured":"H.D. Sherali, G. Choi, Z. Ansari, Memoryless and limited memory space dilation and reduction algorithms, Department of Industrial and Systems Engineering, Virginia Polytechnic Institute and State University, Blacksburg, 1998."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637799000632?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637799000632?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T21:54:32Z","timestamp":1580853272000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637799000632"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,2]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,2]]}},"alternative-id":["S0167637799000632"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(99)00063-2","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2000,2]]}}}