{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:35:38Z","timestamp":1774946138809,"version":"3.50.1"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"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":[[1995,7]]},"DOI":"10.1007\/bf01585556","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:42:17Z","timestamp":1114677737000},"page":"149-176","source":"Crossref","is-referenced-by-count":25,"title":["Complexity estimates of some cutting plane methods based on the analytic barrier"],"prefix":"10.1007","volume":"69","author":[{"given":"Yu.","family":"Nesterov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"CR1","first-page":"1","volume":"69","author":"D.S. Atkinson","year":"1995","unstructured":"D.S. Atkinson and P.M. Vaidya, \u201cA cutting plane algorithm for convex programming that uses analytic centers,\u201dMathematical Programming 69 (1) (1995) 1\u201343 (this issue).","journal-title":"Mathematical Programming"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1287\/mnsc.38.2.284","volume":"38","author":"J.L. Goffin","year":"1992","unstructured":"J.L. Goffin, A. Haurie and J.P. Vial, \u201cDecomposition and nondifferentiable optimization with the projective algorithm,\u201dManagement Science 38 (1992) 284\u2013302.","journal-title":"Management Science"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"N. Karmarkar, \u201cA new polynomial-time algorithm for linear programming,\u201dCombinatorica 4 (1984) 373\u2013395.","journal-title":"Combinatorica"},{"key":"CR4","volume-title":"\u201cNonsmooth optimization and descent methods,\u201d Research Report 78-4","author":"C. Lemar\u00e9chal","year":"1978","unstructured":"C. Lemar\u00e9chal, \u201cNonsmooth optimization and descent methods,\u201d Research Report 78-4, IIASA, Laxenburg, 1978."},{"key":"CR5","unstructured":"C. Lemar\u00e9chal, A. Nemirovsky and Yu. Nesterov, \u201cNew variants of bundle methods,\u201d Rapports de Recherche 1508, INRIA, 1991."},{"key":"CR6","first-page":"1244","volume":"160","author":"A. Levin","year":"1965","unstructured":"A. Levin, \u201cAn algorithm of minimization of convex functions,\u201dSoviet Mathematics Doklady 160 (1965) 1244\u20131247.","journal-title":"Soviet Mathematics Doklady"},{"key":"CR7","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"A. Nemirovsky","year":"1983","unstructured":"A. Nemirovsky and D. Yudin,Problem Complexity and Method Efficiency in Optimization (Wiley-Interscience, New York, 1983)."},{"key":"CR8","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior-point Polynomial Algorithms in Convex Programming: Theory and Applications","author":"Yu. Nesterov","year":"1994","unstructured":"Yu. Nesterov and A. Nemirovsky,Interior-point Polynomial Algorithms in Convex Programming: Theory and Applications (SIAM, Philadelphia, PA, 1994)."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1145\/321281.321291","volume":"12","author":"D.J. Newman","year":"1965","unstructured":"D.J. Newman, \u201cLocation of maximum on unimodal surfaces,\u201dJournal of ACM 12 (1965) 395\u2013398.","journal-title":"Journal of ACM"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01580724","volume":"40","author":"J. Renegar","year":"1988","unstructured":"J. Renegar, \u201cA polynomial-time algorithm, based on Newton's method for linear programming,\u201dMathematical Programming 40 (1988) 59\u201393.","journal-title":"Mathematical Programming"},{"key":"CR11","first-page":"42","volume":"1","author":"N. Shor","year":"1977","unstructured":"N. Shor, \u201cA cutting plane method for solving convex programming problem,\u201dCybernetics 1 (1977) 42\u201350.","journal-title":"Cybernetics"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/978-3-0348-9297-1_20","volume-title":"Trends in Mathematical Optimization","author":"G. Sonnevend","year":"1988","unstructured":"G. Sonnevend, \u201cNew algorithm in convex programming based on a notion of \u201ccentre\u201d (for a system of analytic inequalities) and on rational extrapolation,\u201d in: K.H. Hoffman et al., eds.,Trends in Mathematical Optimization (Birkh\u00e4user, Basel, 1988) 311\u2013326."},{"key":"CR13","first-page":"835","volume":"298","author":"S. Tarasov","year":"1988","unstructured":"S. Tarasov, L. Khachiyan and I. Erlich, \u201cThe method of inscribed ellipsoids,\u201dSoviet Mathematics Doklady 298 (1988) 835\u2013843.","journal-title":"Soviet Mathematics Doklady"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF01580859","volume":"47","author":"P.M. Vaidya","year":"1990","unstructured":"P.M. Vaidya, \u201cAn algorithm for linear programming which requires O(((m+n)n 2+(m+n)1\/5 n)L) arithmetic operations,\u201dMathematical Programming 47 (1990) 175\u2013201.","journal-title":"Mathematical Programming"},{"key":"CR15","unstructured":"P.M. Vaidya, \u201cA new algorithm for minimizing convex functions over convex sets,\u201dMathematical Programming, to appear."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1137\/0802002","volume":"2","author":"Y. Ye","year":"1992","unstructured":"Y. Ye, \u201cA potential reduction algorithm allowing column generation,\u201dSIAM Journal of Optimization 2 (1992) 7\u201320.","journal-title":"SIAM Journal of Optimization"},{"key":"CR17","first-page":"357","volume":"12","author":"D. Yudin","year":"1976","unstructured":"D. Yudin and A. Nemirovsky, \u201cInformational complexity and efficient methods for solving convex extremal problems,\u201dEkonomika i Matem. Metody 12 (1976) 357\u2013369.","journal-title":"Ekonomika i Matem. Metody"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585556.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01585556\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585556","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:32:28Z","timestamp":1556897548000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01585556"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":17,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["BF01585556"],"URL":"https:\/\/doi.org\/10.1007\/bf01585556","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}