{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T14:29:10Z","timestamp":1648736950734},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1996,7,1]],"date-time":"1996-07-01T00:00:00Z","timestamp":836179200000},"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":[[1996,7]]},"DOI":"10.1007\/bf02592145","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T15:56:37Z","timestamp":1175183797000},"page":"47-54","source":"Crossref","is-referenced-by-count":2,"title":["Complexity of some cutting plane methods that use analytic centers"],"prefix":"10.1007","volume":"74","author":[{"given":"Krzysztof C.","family":"Kiwiel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02592145_CR1","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BF00249055","volume":"5","author":"A. Altman","year":"1996","unstructured":"A. Altman and K.C. Kiwiel, A note on some analytic center cutting plane methods for convex feasibility and minimization problems,Computational Optimization and Applications 5 (1996) 175\u2013180.","journal-title":"Computational Optimization and Applications"},{"key":"BF02592145_CR2","series-title":"Tech. report","volume-title":"On Vaidya's volumetric cutting plane method for convex programming","author":"K.M. Anstreicher","year":"1994","unstructured":"K.M. Anstreicher, On Vaidya's volumetric cutting plane method for convex programming, Tech. report, Dept. of Management Sciences, Univ. of Iowa, Iowa City, IA, Sept. 1994."},{"key":"BF02592145_CR3","first-page":"1","volume":"69","author":"D.S. Atkinson","year":"1995","unstructured":"D.S. Atkinson and P.M. Vaidya, A cutting plane algorithm for convex programming that uses analytic centers,Mathematical Programming 69 (1995) 1\u201343.","journal-title":"Mathematical Programming"},{"key":"BF02592145_CR4","first-page":"45","volume":"69","author":"O. Bahn","year":"1995","unstructured":"O. Bahn, O. du Merle, J.-L. Goffin and J.-Ph. Vial A cutting plane method from analytic centers for stochastic programming,Mathematical Programming 69 (1995) 45\u201373.","journal-title":"Mathematical Programming"},{"key":"BF02592145_CR5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0166-218X(94)90198-8","volume":"49","author":"O. Bahn","year":"1993","unstructured":"O. Bahn, J.-L. Goffin, J.-Ph. Vial and O. du Merle, Implementation and behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming,Discrete Applied Mathematics 49 (1993) 3\u201323.","journal-title":"Discrete Applied Mathematics"},{"key":"BF02592145_CR6","series-title":"Tech. report","volume-title":"Solving nonlinear multicommodity flow problems by the analytic center cutting plane method","author":"J.-L. Goffin","year":"1994","unstructured":"J.-L. Goffin, J. Gondzio, R. Sarkissian and J.-Ph. Vial, Solving nonlinear multicommodity flow problems by the analytic center cutting plane method. Tech. report, Department d'\u00e9conomie commerciale et industrielle, Universit\u00e9 de Gen\u00e9ve, Gen\u00e9ve, Switzerland, Oct. 1994."},{"key":"BF02592145_CR7","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1287\/mnsc.38.2.284","volume":"37","author":"J.-L. Goffin","year":"1992","unstructured":"J.-L. Goffin, A. Haurie and J.-Ph. Vial, Decomposition and nondifferentiable optimization with the projective algorithm,Management Science 37 (1992) 284\u2013302.","journal-title":"Management Science"},{"key":"BF02592145_CR8","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1007\/978-1-4613-3632-7_10","volume-title":"Large Scale Optimization: State of the Art","author":"J.-L. Goffin","year":"1994","unstructured":"J.-L. Goffin, Z.-Q. Luo and Y. Ye, On the complexity of a column generation algorithm for convex or quasiconvex feasibility problems, in: W.W. Hager, D.W. Hearn and P.M. Pardalos, eds.,Large Scale Optimization: State of the Art (Kluwer Academic Publishers, Dordrecht, 1994), 182\u2013191."},{"key":"BF02592145_CR9","doi-asserted-by":"crossref","unstructured":"J.-L. Goffin, Z.-Q. Luo and Y. Ye, Complexity analysis of an interior point cutting plane method for convex feasibility problems,SIAM Journal on Optimization (1996) to appear.","DOI":"10.1137\/S1052623493258635"},{"key":"BF02592145_CR10","doi-asserted-by":"crossref","unstructured":"K.C. Kiwiel, Efficiency of the analytic center cutting plane method for convex minimization,SIAM Journal on Optimization (1996), to appear.","DOI":"10.1137\/S1052623494275768"},{"key":"BF02592145_CR11","series-title":"Tech. report","volume-title":"Analysis of a cutting plane method that uses analytic center and multiple cuts","author":"Z.-Q. Luo","year":"1994","unstructured":"Z.-Q. Luo, Analysis of a cutting plane method that uses analytic center and multiple cuts, Tech. report, Dept. of Electrical and Computer Engineering, McMaster Univ., Hamilton, Ontario, Canada, Sept. 1994."},{"key":"BF02592145_CR12","series-title":"DSES Technical Report No. 37-93-387","volume-title":"A long-step, cutting plane algorithm for linear and convex programming","author":"J.E. Mitchell","year":"1993","unstructured":"J.E. Mitchell and S. Ramaswamy, A long-step, cutting plane algorithm for linear and convex programming, DSES Technical Report No. 37-93-387, Dept. of Decision Sciences & Engg. Systems, Rensselaer Polytechnic Institute, Troy, NY, Aug. 1993; revised Aug. 1994."},{"key":"BF02592145_CR13","first-page":"149","volume":"69","author":"Yu.E. Nesterov","year":"1995","unstructured":"Yu.E. Nesterov, Complexity estimates of some cutting plane methods based on the analytic barrier,Mathematical Programming 69 (1995) 149\u2013176.","journal-title":"Mathematical Programming"},{"key":"BF02592145_CR14","volume-title":"Problem Complexity and Method, Efficiency in Optimization","author":"A.S. Nemirovskii","year":"1979","unstructured":"A.S. Nemirovskii and D.B. Yudin,Problem Complexity and Method, Efficiency in Optimization (Nauka, Moscow, 1979) (in Russian): English translation: Wiley, New York, 1983."},{"key":"BF02592145_CR15","series-title":"International Series of Numerical Mathematics","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, New algorithms in convex programming based on the notion of \u2018centre\u2019 (for systems of analytic inequalities) and on rational extrapolation. in: K.H. Hoffman, J.-B. Hiriart-Urruty, C. Lemar\u00e9chal and J. Zowe, eds.,Trends in Mathematical Optimization, International Series of Numerical Mathematics 84 (Birkh\u00e4user, Basel, 1988), 311\u2013326."},{"key":"BF02592145_CR16","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1137\/0802002","volume":"2","author":"Y. Ye","year":"1992","unstructured":"Y. Ye, A potential reduction algorithm allowing column generation,SIAM Journal on Optimization 2 (1992) 7\u201320.","journal-title":"SIAM Journal on Optimization"},{"key":"BF02592145_CR17","series-title":"Tech. report","volume-title":"Complexity analysis of the analytic center cutting plane method that uses multiple cuts","author":"Y. Ye","year":"1994","unstructured":"Y. Ye, Complexity analysis of the analytic center cutting plane method that uses multiple cuts, Tech. report, Dept. of Management Sciences, Univ. of Iowa, Iowa City, IA, Sept. 1994."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592145.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02592145\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592145","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:37:52Z","timestamp":1558395472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02592145"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,7]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,7]]}},"alternative-id":["BF02592145"],"URL":"https:\/\/doi.org\/10.1007\/bf02592145","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,7]]}}}