{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T05:34:58Z","timestamp":1775280898826,"version":"3.50.1"},"reference-count":36,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,12,1]],"date-time":"2003-12-01T00:00:00Z","timestamp":1070236800000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2003,12]]},"DOI":"10.1016\/s0377-2217(02)00629-x","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:25:26Z","timestamp":1049736326000},"page":"461-473","source":"Crossref","is-referenced-by-count":30,"title":["On the convergence of conditional \u03b5-subgradient methods for convex programs and convex\u2013concave saddle-point problems"],"prefix":"10.1016","volume":"151","author":[{"given":"Torbj\u00f6rn","family":"Larsson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Patriksson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ann-Brith","family":"Str\u00f6mberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00629-X_BIB1","first-page":"511","article-title":"Recurrence relations and variational inequalities","volume":"27","author":"Alber","year":"1983","journal-title":"Soviet Mathematics Doklady"},{"key":"10.1016\/S0377-2217(02)00629-X_BIB2","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF01584842","article-title":"On the projected subgradient method for nonsmooth convex optimization in a Hilbert space","volume":"81","author":"Alber","year":"1998","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00629-X_BIB3","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/s101070050002","article-title":"The volume algorithm: Producing primal solutions with a subgradient method","volume":"87","author":"Barahona","year":"2000","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00629-X_BIB4","series-title":"Nonlinear Programming: Theory and Algorithms","author":"Bazaraa","year":"1993"},{"key":"10.1016\/S0377-2217(02)00629-X_BIB5","series-title":"Nonlinear Programming","author":"Bertsekas","year":"1999"},{"key":"10.1016\/S0377-2217(02)00629-X_BIB6","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF01585170","article-title":"Convergence of some algorithms for convex minimization","volume":"62","author":"Correa","year":"1993","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00629-X_BIB7","series-title":"The Theory of Max\u2013Min","author":"Danskin","year":"1967"},{"key":"10.1016\/S0377-2217(02)00629-X_BIB8","series-title":"Introduction to Minimax","author":"Demyanov","year":"1974"},{"key":"10.1016\/S0377-2217(02)00629-X_BIB9","first-page":"1181","article-title":"Conditional subdifferentials of convex functions","volume":"19","author":"Dem\u2019janov","year":"1980","journal-title":"Soviet Mathematics Doklady"},{"key":"10.1016\/S0377-2217(02)00629-X_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01071403","article-title":"Methods for solving nonlinear extremal problems","volume":"2","author":"Ermol\u2019ev","year":"1966","journal-title":"Cybernetics"},{"key":"10.1016\/S0377-2217(02)00629-X_BIB11","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0167-6377(89)90059-X","volume":"8","author":"Hearn","year":"1989","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(02)00629-X_BIB12","series-title":"Convex Analysis and Minimization Algorithms, I: Fundamentals","author":"Hiriart-Urruty","year":"1993"},{"key":"10.1016\/S0377-2217(02)00629-X_BIB13","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1287\/opre.47.1.93","article-title":"Large-scale convex optimization via saddle point computation","volume":"47","author":"Kallio","year":"1999","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00629-X_BIB14","unstructured":"M. Kallio, A. Ruszczy\u0144ski, Perturbation methods for saddle point computation, Working paper WP-94-38, IIASA, Laxenburg, Austria"},{"key":"10.1016\/S0377-2217(02)00629-X_BIB15","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BF01585554","article-title":"Proximal level bundle methods for convex nondifferentiable optimization, saddle-point problems and variational inequalities","volume":"69","author":"Kiwiel","year":"1995","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00629-X_BIB16","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1080\/02331939708844312","article-title":"A Lagrangian relaxation scheme for structured linear programs with application to multicommodity network flows","volume":"40","author":"Larsson","year":"1997","journal-title":"Optimization"},{"key":"10.1016\/S0377-2217(02)00629-X_BIB17","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1080\/02331939708844366","article-title":"A dual scheme for traffic assignment problems","volume":"42","author":"Larsson","year":"1997","journal-title":"Optimization"},{"key":"10.1016\/S0377-2217(02)00629-X_BIB18","unstructured":"T. Larsson, M. Patriksson, Global optimality conditions and Lagrangian heuristics for nonconvex optimization, report, Department of Mathematics, Chalmers University of Technology, Gothenburg, in preparation"},{"key":"10.1016\/S0377-2217(02)00629-X_BIB19","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/0377-2217(94)00200-2","article-title":"Conditional subgradient optimization\u2013\u2013theory and applications","volume":"88","author":"Larsson","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00629-X_BIB20","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1080\/10556789808805688","article-title":"Ergodic convergence in subgradient optimization","volume":"9","author":"Larsson","year":"1998","journal-title":"Optimization Methods & Software"},{"key":"10.1016\/S0377-2217(02)00629-X_BIB21","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/s101070050090","article-title":"Ergodic, primal convergence in dual subgradient schemes for convex programming","volume":"86","author":"Larsson","year":"1999","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(02)00629-X_BIB22","series-title":"Optimization Theory for Large Systems","author":"Lasdon","year":"1970"},{"key":"10.1016\/S0377-2217(02)00629-X_BIB23","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1023\/A:1008782926733","article-title":"A primal\u2013dual algorithm for monotropic programming and its application to network optimization","volume":"15","author":"Ouorou","year":"2000","journal-title":"Computational Optimization and Applications"},{"key":"10.1016\/S0377-2217(02)00629-X_BIB24","doi-asserted-by":"crossref","first-page":"1295","DOI":"10.1002\/(SICI)1097-0207(19970415)40:7<1295::AID-NME115>3.0.CO;2-P","article-title":"Topology optimization of sheets in contact by a subgradient method","volume":"40","author":"Petersson","year":"1997","journal-title":"International Journal of Numerical Methods in Engineering"},{"key":"10.1016\/S0377-2217(02)00629-X_BIB25","first-page":"593","article-title":"A general method of solving extremum problems","volume":"8","author":"Polyak","year":"1967","journal-title":"Soviet Mathematics Doklady"},{"key":"10.1016\/S0377-2217(02)00629-X_BIB26","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0041-5553(69)90061-5","article-title":"Minimization of unsmooth functionals","volume":"9","author":"Polyak","year":"1969","journal-title":"USSR Computational Mathematics and Mathematical Physics"},{"key":"10.1016\/S0377-2217(02)00629-X_BIB27","unstructured":"B.T. Polyak, Introduction to Optimization, Optimization Software New York, 1987"},{"key":"10.1016\/S0377-2217(02)00629-X_BIB28","series-title":"Convex Analysis","author":"Rockafellar","year":"1970"},{"key":"10.1016\/S0377-2217(02)00629-X_BIB29","series-title":"The Theory of Subgradients and its Applications to Problems of Optimization: Convex and Nonconvex Functions","author":"Rockafellar","year":"1981"},{"key":"10.1016\/S0377-2217(02)00629-X_BIB30","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0167-6377(96)00019-3","article-title":"Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs","volume":"19","author":"Sherali","year":"1996","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(02)00629-X_BIB31","series-title":"Minimization Methods for Non-Differentiable Functions","author":"Shor","year":"1985"},{"key":"10.1016\/S0377-2217(02)00629-X_BIB32","doi-asserted-by":"crossref","first-page":"663","DOI":"10.1023\/A:1022680114518","article-title":"Error stability properties of generalized gradient-type algorithms","volume":"98","author":"Solodov","year":"1998","journal-title":"Journal of Optimization Theory and Applications"},{"key":"10.1016\/S0377-2217(02)00629-X_BIB33","series-title":"Integer Programming","author":"Wolsey","year":"1998"},{"key":"10.1016\/S0377-2217(02)00629-X_BIB34","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1023\/A:1014839227049","article-title":"New bundle methods for solving Lagrangian relaxation dual problems","volume":"113","author":"Zhao","year":"2002","journal-title":"Journal of Optimization Theory and Applications"},{"key":"10.1016\/S0377-2217(02)00629-X_BIB35","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1023\/A:1022646725208","article-title":"Surrogate gradient algorithm for Lagrangian relaxation","volume":"100","author":"Zhao","year":"1999","journal-title":"Journal of Optimization Theory and Applications"},{"key":"10.1016\/S0377-2217(02)00629-X_BIB36","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1137\/0803039","article-title":"Primal\u2013dual projected gradient algorithms for extended linear\u2013quadratic programming","volume":"3","author":"Zhu","year":"1993","journal-title":"SIAM Journal on Optimization"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722170200629X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722170200629X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,30]],"date-time":"2019-03-30T06:57:14Z","timestamp":1553929034000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S037722170200629X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,12]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,12]]}},"alternative-id":["S037722170200629X"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00629-x","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2003,12]]}}}