{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:40:02Z","timestamp":1752378002204,"version":"3.41.2"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,2,1]],"date-time":"2000-02-01T00:00:00Z","timestamp":949363200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[2000,2]]},"DOI":"10.1023\/a:1008787027641","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T11:37:32Z","timestamp":1040557052000},"page":"167-191","source":"Crossref","is-referenced-by-count":12,"title":["A Polynomial Cutting Surfaces Algorithm for the Convex Feasibility Problem Defined by Self-Concordant Inequalities"],"prefix":"10.1007","volume":"15","author":[{"given":"Zhi-Quan","family":"Luo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jie","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"254635_CR1","volume-title":"Interior point column generation algorithms for adaptive filtering","author":"K. Afkhamie","year":"1997","unstructured":"K. Afkhamie, Z.-Q. Luo, and K.M. Wong, \u201cInterior point column generation algorithms for adaptive filtering,\u201d Manuscript, Communications Research Laboratory, McMaster University, Hamilton, Ontario, Canada, 1997."},{"key":"254635_CR2","unstructured":"A. Altman and K.C. Kiwiel, \u201cA note on some analytic center cutting plane methods for convex feasibility and minimization problems,\u201d Systems Research Institute, Newelska 6, 01-447, Warsaw, Poland, June 1994."},{"key":"254635_CR3","first-page":"1","volume":"69","author":"D.S. Atkinson","year":"1995","unstructured":"D.S. Atkinson and P.M.Vaidya, \u201cAcutting plane algorithm for convex programming that uses analytic centers,\u201d Mathematical Programming, vol. 69, pp. 1\u201344, 1995.","journal-title":"Mathematical Programming"},{"key":"254635_CR4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0166-218X(94)90198-8","volume":"49","author":"O. Bahn","year":"1994","unstructured":"O. Bahn, O. Du Merle, J.-L. Goffin, and J.-P. Vial, \u201cExperimental behavior of an interior point cutting plane algorithm for convex programming: an application to geometric programming,\u201d Discrete Applied Mathematics, vol. 49, pp. 3\u201323, 1994.","journal-title":"Discrete Applied Mathematics"},{"key":"254635_CR5","first-page":"45","volume":"69","author":"O. Bahn","year":"1995","unstructured":"O. Bahn, O. Du Merle, J.-L. Goffin, and J.-P. Vial, \u201cA cutting plane method from analytic centers for stochastic programming,\u201d Mathematical Programming, vol. 69, pp. 45\u201374, 1995.","journal-title":"Mathematical Programming"},{"key":"254635_CR6","first-page":"75","volume":"69","author":"D. den Hertog","year":"1995","unstructured":"D. den Hertog, F. Jarre, C. Roos, and T. Terlaky, \u201cA sufficient condition for self-concordance, with application to some classes of structured convex programming problems,\u201d Mathematical Programming, vol. 69, pp. 75\u201388, 1995.","journal-title":"Mathematical Programming"},{"key":"254635_CR7","doi-asserted-by":"crossref","first-page":"638","DOI":"10.1137\/S1052623493258635","volume":"6","author":"J.-L. Goffin","year":"1996","unstructured":"J.-L. Goffin, Z.-Q. Luo, and Y. Ye, \u201cComplexity analysis of an interior cutting plane method for convex feasibility problems,\u201d SIAM J. Optimization, vol. 6, pp. 638\u2013652, 1996.","journal-title":"SIAM J. Optimization"},{"key":"254635_CR8","doi-asserted-by":"crossref","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 Academic Publishers B.V., 1994, pp. 182-189.","DOI":"10.1007\/978-1-4613-3632-7_10"},{"key":"254635_CR9","volume-title":"Shallow, deep and very deep cuts in the analutic center cutting plane method","author":"J.-L. Goffin","year":"1996","unstructured":"J.-L. Goffin and J.-P. Vial, \u201cShallow, deep and very deep cuts in the analutic center cutting plane method,\u201d Logilab Technical Report 96.1, University of Geneva, Switzerland, 1996."},{"key":"254635_CR10","volume-title":"The Method of Analytic Centers for Smooth Convex Programs","author":"F. Jarre","year":"1989","unstructured":"F. Jarre, The Method of Analytic Centers for Smooth Convex Programs, Ph.D. Thesis, Institut f\u00fcr Angwandte Mathematik und Statistik, Universit\u00e4t W\u00fcrtzburg, Germany, 1989."},{"key":"254635_CR11","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1137\/S105262349427652X","volume":"7","author":"Z.-Q. Luo","year":"1997","unstructured":"Z.-Q. Luo, \u201cAnalysis of a cutting plane method that uses weighted analytic center and multiple cuts,\u201d SIAM Journal on Optimization, vol. 7, pp. 697\u2013716, 1997.","journal-title":"SIAM Journal on Optimization"},{"issue":"1","key":"254635_CR12","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1137\/S1052623495294943","volume":"9","author":"Z.-Q. Luo","year":"1998","unstructured":"Z.-Q. Luo and J. Sun, \u201cAn analytic center based column generation algorithm for the convex quadratic feasibility problem,\u201d SIAM J. Optimization, vol. 9, no. 1, pp. 217\u2013235, 1998.","journal-title":"SIAM J. Optimization"},{"key":"254635_CR13","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1090\/conm\/114\/1097878","volume":"114","author":"S. Mehrotra","year":"1990","unstructured":"S. Mehrotra and J. Sun, \u201cAn interior point algorithm for solving smooth convex programs based on Newton's method,\u201d Contemporary Mathematics, vol. 114, pp. 265\u2013284, 1990.","journal-title":"Contemporary Mathematics"},{"key":"254635_CR14","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF01594926","volume":"50","author":"S. Mehrotra","year":"1991","unstructured":"S. Mehrotra and J. Sun, \u201cOn computing the center of a convex quadratically constrained set,\u201d Mathematical Programming, vol. 50, pp. 81\u201389, 1991.","journal-title":"Mathematical Programming"},{"key":"254635_CR15","first-page":"149","volume":"69","author":"Y. Nesterov","year":"1995","unstructured":"Y. Nesterov, \u201cCutting plane algorithms from analytic centers: efficiency estimates,\u201d Mathematical Programming, vol. 69, pp. 149\u2013176, 1995.","journal-title":"Mathematical Programming"},{"key":"254635_CR16","volume-title":"Interior-Point Polynomial Algorithms in Convex Programming","author":"Y. Nesterov","year":"1993","unstructured":"Y. Nesterov and A. Nemirovskii, Interior-Point Polynomial Algorithms in Convex Programming, SIAM Studies in Applied Mathematics, Philadelphia, USA, 1993."},{"key":"254635_CR17","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/BF02591963","volume":"27","author":"M.L. Overton","year":"1983","unstructured":"M.L. Overton, \u201cA quadratically convergent method for minimizing a sum of euclidean norms,\u201d Mathematical Programming, vol. 27, pp. 34\u201363, 1983.","journal-title":"Mathematical Programming"},{"key":"254635_CR18","unstructured":"G. Sonnevend, \u201cNew algorithms in convex programming based on a notion of 'centre' (for systems of analytic inequalities) and on rational extrapolation,\u201d in Trends in Mathematical Optimization: Proceedings of the 4th French-German Conference on Optimization in Irsee, K.H. Hoffmann, J.B. Hiriat-Urruty, C. Lemarechal, and J. Zowe, (Eds.), Germany, 1986."},{"key":"254635_CR19","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 Journal on Optimization, vol. 2, pp. 7\u201320, 1992.","journal-title":"SIAM Journal on Optimization"},{"key":"254635_CR20","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/S0025-5610(96)00075-5","volume":"78","author":"Y. Ye","year":"1997","unstructured":"Y. Ye, \u201cComplexity analysis of the analytic center cutting plane method that uses multiple cuts,\u201d Mathematical Programming, vol. 78, pp. 85\u2013104, 1997.","journal-title":"Mathematical Programming"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008787027641.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008787027641\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008787027641.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:06:01Z","timestamp":1752375961000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008787027641"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,2]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2000,2]]}},"alternative-id":["254635"],"URL":"https:\/\/doi.org\/10.1023\/a:1008787027641","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2000,2]]}}}