{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T06:58:12Z","timestamp":1758265092702},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1996,3,1]],"date-time":"1996-03-01T00:00:00Z","timestamp":825638400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[1996,3]]},"DOI":"10.1007\/bf00249055","type":"journal-article","created":{"date-parts":[[2004,9,26]],"date-time":"2004-09-26T15:12:28Z","timestamp":1096211548000},"page":"175-180","source":"Crossref","is-referenced-by-count":14,"title":["A note on some analytic center cutting plane methods for convex feasibility and minimization problems"],"prefix":"10.1007","volume":"5","author":[{"given":"Anna","family":"Altman","sequence":"first","affiliation":[]},{"given":"Krzysztof C.","family":"Kiwiel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF00249055_CR1","volume-title":"On Vaidya's volumetric cutting plane method for convex programming","author":"K.M. Anstreicher","year":"1994","unstructured":"K.M. Anstreicher, \u201cOn Vaidya's volumetric cutting plane method for convex programming,\u201d Tech. Report, Dept. of Management Sciences, Univ. of Iowa, Iowa City, IA, September 1994."},{"key":"BF00249055_CR2","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,\u201d Math. Programming, vol. 69, pp. 1\u201343, 1995.","journal-title":"Math. Programming"},{"key":"BF00249055_CR3","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, \u201cImplementation and behavior of an interior point cutting plane algorithm for convex programming: An application to geometric programming,\u201d Discrete Appl. Math., vol. 49, pp. 3\u201323, 1993.","journal-title":"Discrete Appl. Math."},{"key":"BF00249055_CR4","first-page":"45","volume":"69","author":"O. Bahn","year":"1995","unstructured":"O. Bahn, O.du Merle, J.-L. Goffin, and J.-Ph. Vial, \u201cA cutting plane method from analytic centers for stochastic programming,\u201d Math Programming, vol. 69, pp. 45\u201373, 1995.","journal-title":"Math Programming"},{"key":"BF00249055_CR5","volume-title":"Using the primal dual infeasible newton method in the analytic center method for problems defined by deep cutting planes","author":"J.-L. Goffin","year":"1994","unstructured":"J.-L. Goffin, \u201cUsing the primal dual infeasible newton method in the analytic center method for problems defined by deep cutting planes,\u201d Tech. Report, Faculty of Management, McGill Univ., Montreal, Quebec, September 1994."},{"key":"BF00249055_CR6","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, \u201cDecomposition and nondifferentiable optimization with the projective algorithm,\u201d Management Sci., vol. 37, pp. 284\u2013302, 1992.","journal-title":"Management Sci."},{"key":"BF00249055_CR7","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., \u201cOn the complexity of a column generation algorithm for convex or quasiconvex feasibility problems,\u201d in Large Scale Optimization: State of the Art, W.W. Hager, D.W. Hearn, and P.M. Pardalos (Eds.), Kluwer: Dordrecht, 1994, pp. 182\u2013191."},{"key":"BF00249055_CR8","doi-asserted-by":"crossref","unstructured":"J.-L. Goffin, Z.-Q. Luo and Y. Ye, \u201cComplexity analysis of an interior point cutting plane method for convex feasibility problems,\u201d SIAM J. Optim. vol.? 1995, ?-?, (to appear).","DOI":"10.1137\/S1052623493258635"},{"key":"BF00249055_CR9","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, \u201cSolving nonlinear multicommodity flow problems by the analytic center cutting plane method,\u201d Tech. report, D\u00e9partement d'\u00e9conomie commerciale et industrielle, Universit\u00e9 de Gen\u00e9ve, Gen\u00e9ve, Switzerland, October 1994."},{"key":"BF00249055_CR10","unstructured":"K.C. Kiwiel, \u201cEfficiency of the analytic center cutting plane method for convex minimization,\u201d SIAM J. Optim. vol.?, 1995, (to appear)."},{"key":"BF00249055_CR11","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, \u201cAnalysis of a cutting plane method that uses analytic center and multiple cuts,\u201d Tech. Report, Dept. of Electrical and Computer Engineering, McMaster Univ., Hamilton, Ontario, Canada, September 1994."},{"key":"BF00249055_CR12","first-page":"149","volume":"69","author":"Yu. E. Nesterov","year":"1995","unstructured":"Yu. E. Nesterov, \u201cComplexity estimates of some cutting plane methods based on the analytical barrier,\u201d Math. Programming, vol. 69, pp. 149\u2013176, 1995.","journal-title":"Math. Programming"},{"key":"BF00249055_CR13","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"A.S. Nemirovskii","year":"1979","unstructured":"A.S. Nemirovskii and D.B. Yudin, \u201cProblem Complexity and Method Efficiency in Optimization,\u201d Nauka, Moscow, 1979 (Russian), English transl. Wiley: New York, 1983."},{"key":"BF00249055_CR14","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, \u201cNew algorithms in convex programming based on the notion of \u201ccentre\u201d (for systems of analytic inequalities) and on rational extrapolation,\u201d in Trends in Mathematical Optimization, K.H. Hoffman, J.-B. Hiriart-Urruty, C. Lemar\u00e9chal, and J. Zowe (Eds.), International Series of Numerical Mathematics 84, Birkh\u00e4user-Verlag: Basel, 1988, pp. 311\u2013326."},{"key":"BF00249055_CR15","first-page":"1081","volume":"298","author":"S.P. Tarasov","year":"1988","unstructured":"S.P. Tarasov, L.G. Khachian, and I.I. \u00c8rlikh, \u201cThe method of inscribed ellipsoids,\u201d Dokl. Akad. Nauk SSSR vol. 298, pp. 1081\u20131085, 1988 (Russian), English transl. in Soviet Math. Dokl., vol. 37, pp. 226\u2013230, 1988.","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"BF00249055_CR16","doi-asserted-by":"crossref","unstructured":"P.M. Vaidya, \u201cA new algorithm for minimizing convex functions over convex sets,\u201d in Proceedings 30th Annual IEEE Symposium Foundations of Computer Science, Research Triangle Park, NC, 1989, Los Alamitos, CA, 1990, IEEE Computer Society Press, pp. 338\u2013343 (to appear in Math Programming).","DOI":"10.1109\/SFCS.1989.63500"},{"key":"BF00249055_CR17","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,\u201d SIAM J. Optim., vol. 2, pp. 7\u201320, 1992.","journal-title":"SIAM J. Optim."},{"key":"BF00249055_CR18","volume-title":"Complexity analysis of the analytical center cutting plane method that uses multiple cuts","author":"Y. Ye","year":"1994","unstructured":"Y. Ye, \u201cComplexity analysis of the analytical center cutting plane method that uses multiple cuts,\u201d Tech. Report, Dept. of Management Sciences, Univ. of Iowa, Iowa City, IA, September 1994."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00249055.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00249055\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00249055","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T06:16:22Z","timestamp":1585894582000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00249055"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,3]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1996,3]]}},"alternative-id":["BF00249055"],"URL":"https:\/\/doi.org\/10.1007\/bf00249055","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996,3]]}}}