{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,28]],"date-time":"2026-01-28T21:00:24Z","timestamp":1769634024083,"version":"3.49.0"},"reference-count":28,"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\/bf01585551","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:42:17Z","timestamp":1114677737000},"page":"1-43","source":"Crossref","is-referenced-by-count":63,"title":["A cutting plane algorithm for convex programming that uses analytic centers"],"prefix":"10.1007","volume":"69","author":[{"given":"David S.","family":"Atkinson","sequence":"first","affiliation":[]},{"given":"Pravin M.","family":"Vaidya","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF01581079","volume":"57","author":"D.S. Atkinson","year":"1992","unstructured":"D.S. Atkinson and P.M. Vaidya, \u201cA scaling technique for finding the weighted analytic center of a polytope,\u201dMathematical Programming 57 (1992) 163\u2013192.","journal-title":"Mathematical Programming"},{"key":"CR2","volume-title":"Minimizing weighted self-concordant logarithmic barrier functions by scaling","author":"D.S. Atkinson","year":"1992","unstructured":"D.S. Atkinson and P.M. Vaidya, \u201cMinimizing weighted self-concordant logarithmic barrier functions by scaling,\u201d Preprint, Department of Mathematics, University of Illinois at Urbana-Champaign, Urbana, IL, 1992."},{"key":"CR3","series-title":"Working paper","volume-title":"Implementation and behavior of an interior point cutting plane algorithm for convex programming: an application to geometric programming","author":"O. Bahn","year":"1991","unstructured":"O. Bahn, J.L. Goffin, J.P. Vial and O. du Merle, \u201cImplementation and behavior of an interior point cutting plane algorithm for convex programming: an application to geometric programming,\u201d Working paper, Universit\u00e9 de Gen\u00e8ve, Gen\u00e8ve, Switzerland, 1991."},{"key":"CR4","first-page":"1","volume-title":"Proceedings of the 19th Annual ACM Symposium on Theory of Computing","author":"D. Coppersmith","year":"1987","unstructured":"D. Coppersmith and S. Winograd, \u201cMatrix multiplication via arithmetic progressions,\u201d in:Proceedings of the 19th Annual ACM Symposium on Theory of Computing (Association for Computing Machinery, New York, 1987) pp. 1\u20136."},{"key":"CR5","volume-title":"Interior point approach to linear, quadratic and convex programming: algorithms and complexity","author":"D. Hertog den","year":"1992","unstructured":"D. den Hertog, \u201cInterior point approach to linear, quadratic and convex programming: algorithms and complexity,\u201d Ph.D. Thesis, Delft University of Technology, Delft, The Netherlands, 1992."},{"key":"CR6","series-title":"Working paper","volume-title":"A path-following cutting plane method for convex programming","author":"D. Hertog den","year":"1992","unstructured":"D. den Hertog, J. Kaliski, C. Roos and T. Terlaky, \u201cA path-following cutting plane method for convex programming,\u201d Working paper, Faculty of Mathematics and Informatics\/Computer Science, Delft University of Technology, Delft, The Netherlands, 1992."},{"key":"CR7","volume-title":"\u201cA build-up variant of the path-following method for LP,\u201d Report No. 91-47","author":"D. Hertog den","year":"1991","unstructured":"D. den Hertog, C. Roos and T. Terlaky, \u201cA build-up variant of the path-following method for LP,\u201d Report No. 91-47, Faculty of Mathematics and Informatics\/Computer Science, Delft University of Technology, Delft, The Netherlands, 1991."},{"key":"CR8","volume-title":"\u201cAdding and deleting constraints in the path-following method for LP,\u201d SHELL Report AMER.92.003","author":"D. Hertog den","year":"1992","unstructured":"D. den Hertog, C. Roos and T. Terlaky, \u201cAdding and deleting constraints in the path-following method for LP,\u201d SHELL Report AMER.92.003, Royal\/Shell-Laboratories, Amsterdam, The Netherlands, 1992."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1287\/moor.16.4.775","volume":"16","author":"R. Freund","year":"1991","unstructured":"R. Freund and K. Tan, \u201cA method for the parametric center problem, with a strictly monotone polynomial-time algorithm for linear programming,\u201dMathematics of Operations Research 16 (1991) 775\u2013801.","journal-title":"Mathematics of Operations Research"},{"key":"CR10","first-page":"44","volume-title":"Proceedings of the IEEE International Conference on Computer Aided Design 1991","author":"T. Gao","year":"1991","unstructured":"T. Gao, P.M. Vaidya and C.L. Liu, \u201cA new performance driven placement algorithm,\u201d in:Proceedings of the IEEE International Conference on Computer Aided Design 1991 (IEEE Computer Society Press, Los Alamitos, CA, 1991) pp. 44\u201347."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/BF00939559","volume":"65","author":"J.L. Goffin","year":"1990","unstructured":"J.L. Goffin and J.P. Vial, \u201cCutting planes and column generation techniques with the projective algorithm,\u201dJournal of Optimization Theory and Applications 65 (1990) 409\u2013429.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e1sz and A. Schrijver,Geometric Algorithms and Combinatorial Optimization (Springer, Berlin, 1988)."},{"key":"CR13","volume-title":"The method of analytic centers for smooth convex programs","author":"F. Jarre","year":"1989","unstructured":"F. Jarre, \u201cThe method of analytic centers for smooth convex programs,\u201d Ph.D. Thesis, Institut f\u00fcr Angewandte Mathematik und Statistik, Universit\u00e4t W\u00fcrzburg, W\u00fcrzburg, Germany, 1989."},{"key":"CR14","doi-asserted-by":"crossref","DOI":"10.21236\/ADA231372","volume-title":"\u201cInterior-point methods for convex programming,\u201d Technical Report SOL 90-16","author":"F. Jarre","year":"1990","unstructured":"F. Jarre, \u201cInterior-point methods for convex programming,\u201d Technical Report SOL 90-16, Stanford University, Palo Alto, CA, 1990."},{"key":"CR15","doi-asserted-by":"crossref","DOI":"10.21236\/ADA239457","volume-title":"\u201cPractical aspects of an interior-point method for convex programming,\u201d Technical Report SOL 91-9","author":"F. Jarre","year":"1991","unstructured":"F. Jarre, \u201cPractical aspects of an interior-point method for convex programming,\u201d Technical Report SOL 91-9, Stanford University, Palo Alto, CA, 1991."},{"key":"CR16","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":"CR17","first-page":"191","volume":"20","author":"L.G. Khachiyan","year":"1979","unstructured":"L.G. Khachiyan, \u201cA polynomial algorithm in linear programming,\u201dSoviet Mathematics Doklady 20 (1979) 191\u2013194.","journal-title":"Soviet Mathematics Doklady"},{"key":"CR18","volume-title":"\u201cOn the complexity of approximating the maximal inscribed ellipsoid for a polytope,\u201d Technical Report No. 893","author":"L.G. Khachiyan","year":"1990","unstructured":"L.G. Khachiyan and M.J. Todd, \u201cOn the complexity of approximating the maximal inscribed ellipsoid for a polytope,\u201d Technical Report No. 893, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, NY, 1990."},{"key":"CR19","volume-title":"\u201cComplexity estimates of some cutting plane methods based on analytic barrier,\u201d Technical Report","author":"Y.E. Nesterov","year":"1993","unstructured":"Y.E. Nesterov, \u201cComplexity estimates of some cutting plane methods based on analytic barrier,\u201d Technical Report, University of Geneva, Geneva, Switzerland, 1993."},{"key":"CR20","volume-title":"Interior-point Polynomial Algorithms in Convex Programming","author":"Y.E. Nesterov","year":"1993","unstructured":"Y.E. Nesterov and A.S. Nemirovsky,Interior-point Polynomial Algorithms in Convex Programming (SIAM, Philadelphia, PA, 1993)."},{"key":"CR21","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":"CR22","first-page":"482","volume-title":"Proceedings of the IEEE International Conference on Computer Aided Design 1991","author":"S.S. Sapatnekar","year":"1991","unstructured":"S.S. Sapatnekar, V.B. Rao and P.M. Vaidya, \u201cA convex optimization approach to transistor sizing for CMOS circuits,\u201d in:Proceedings of the IEEE International Conference on Computer Aided Design 1991 (IEEE Computer Society Press, Los Alamitos, CA, 1991) pp. 482\u2013485."},{"key":"CR23","volume-title":"An analytic center for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming","author":"G. Sonnevend","year":"1989","unstructured":"G. Sonnevend, \u201cAn analytic center for polyhedrons and new classes of global algorithms for linear (smooth, convex) programming,\u201d Preprint, Department of Numerical Analysis, Institute of Mathematics, E\u00f6tv\u00f6s University, Budapest, Hungary, 1989."},{"key":"CR24","first-page":"226","volume":"37","author":"S.P. Tarasov","year":"1988","unstructured":"S.P. Tarasov, L.G. Khachiyan and I.I. Erlich, \u201cThe method of inscribed ellipsoids,\u201dSoviet Mathematics Doklady 37 (1988) 226\u2013230.","journal-title":"Soviet Mathematics Doklady"},{"key":"CR25","first-page":"81","volume-title":"Progress in Mathematical Programming: Interior Point and Related Methods","author":"P. Vaidya","year":"1989","unstructured":"P. Vaidya, \u201cA locally well-behaved potential function and a simple Newton-type method for finding the center of a polytope,\u201d in: N. Megiddo, ed.,Progress in Mathematical Programming: Interior Point and Related Methods (Springer, Berlin, 1989) pp. 81\u201390."},{"key":"CR26","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1109\/SFCS.1989.63500","volume-title":"Proceedings of 30th Annual IEEE Symposium on Foundations of Computer Science","author":"P.M. Vaidya","year":"1989","unstructured":"P.M. Vaidya, \u201cA new algorithm for minimizing convex functions over convex sets,\u201d in:Proceedings of 30th Annual IEEE Symposium on Foundations of Computer Science (IEEE Computer Society Press, Los Alamitos, CA, 1989) pp. 338\u2013343; also:Mathematical Programming, to appear."},{"key":"CR27","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":"CR28","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 on Optimization 2 (1992) 7\u201320.","journal-title":"SIAM Journal on Optimization"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585551.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01585551\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585551","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\/BF01585551"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":28,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["BF01585551"],"URL":"https:\/\/doi.org\/10.1007\/bf01585551","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}