{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T17:29:47Z","timestamp":1787333387203,"version":"build-2736575974"},"reference-count":26,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Optim."],"published-print":{"date-parts":[[1998,11]]},"abstract":"<jats:p>A cutting plane algorithm for minimizing a convex function subject to constraints defined by a separation oracle is presented. The algorithm is based on approximate analytic centers. The nonlinearity of the objective function is taken into account, yet the feasible region is approximated by a containing polytope. This containing polytope is regularly updated by adding a new cut through a test point. Each test point is an approximate analytic center of the intersection of a containing polytope and a level set of the nonlinear objective function. We establish the complexity of the algorithm. Our complexity estimate is given in terms of the problem dimension, the desired accuracy of an approximate solution, and other parameters that depend on the geometry of a specific instance of the problem.<\/jats:p>","DOI":"10.1137\/51052623496311880","type":"journal-article","created":{"date-parts":[[2003,6,11]],"date-time":"2003-06-11T11:12:06Z","timestamp":1055329926000},"page":"1108-1131","source":"Crossref","is-referenced-by-count":18,"title":["A Nonlinear Analytic Center Cutting Plane Method for a Class of Convex Programming Problems"],"prefix":"10.1137","volume":"8","author":[{"given":"F. Sharifi","family":"Mokhtarian","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J. L.","family":"Goffin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,31]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00249055"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1016\/0025-5610(94)00063-Y"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1016\/0025-5610(94)00064-Z"},{"key":"R4","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(94)90198-8"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"D. Den Hertog,\n                      Interior\u2010Point Approach to Linear, Quadratic and Convex Programming, Algorithms and Complexity\n                      , Kluwer Publishers, Dordrecht, The Netherlands, 1994.","DOI":"10.1007\/978-94-011-1134-8"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1007\/BF02032162"},{"key":"R7","unstructured":"J. Kaliski, D. Haglin, C. Roos, and T. Terlaky,\n                      Logarithmic barrier decomposition methods for semi\u2010infinite programming\n                      , Research Report, No. 96\u201051, Faculty of Technical Mathematics and Informatics, Delft University of Technology, The Netherlands, 1996."},{"key":"R8","unstructured":"H. G. Eggleston,\n                      Convexity\n                      , Cambridge University Press, London, 1969."},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1287\/moor.8.1.135"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1016\/S0025-5610(96)00037-8"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.38.2.284"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)90129-B"},{"key":"R13","unstructured":"J. L. Goffin, Z. Q. Luo, and Y. Ye,\n                      On the complexity of a algorithm for convex or quasiconvex problems\n                      , in Large Scale Optimization: State of the Art, W. W. Hager, D. W. Hearn, and P. M. Pardalos, eds., Kluwer Academic Publishers, Norwell, MA, 1993, pp. 187\u2013196."},{"key":"R14","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623493258635"},{"key":"R15","doi-asserted-by":"publisher","DOI":"10.1007\/s10107980011a"},{"key":"R16","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623494275768"},{"key":"R17","doi-asserted-by":"publisher","DOI":"10.1137\/S1052623495294943"},{"key":"R18","unstructured":"Z. Q. Luo and J. Sun,\n                      Cutting surfaces and analytic center: A polynomial algorithm for a convex feasibility problem defined by self\u2010concordant inequalities\n                      , preprint, Department of Electrical and Computer Engineering, McMaster University, Hamilton, Ontario, Canada, 1996."},{"key":"R19","doi-asserted-by":"publisher","DOI":"10.1016\/0025-5610(94)00069-6"},{"key":"R20","doi-asserted-by":"crossref","unstructured":"Y. E. Nesterov and A. S. Nemirovskii,\n                      Interior\u2010Point Polynomial Algorithms in Convex Programming\n                      , Society for Industrial and Applied Mathematics, Philadelphia, PA, 1994.","DOI":"10.1137\/1.9781611970791"},{"key":"R21","doi-asserted-by":"publisher","DOI":"10.1137\/51052623496311880"},{"key":"R22","doi-asserted-by":"crossref","unstructured":"G. Sonnevend,\n                      New algorithms in convex programming based on a notion of \u201ccenter\u201d (for systems of analytic inequalities) and on rational extrapolation\n                      in Trends in Mathematical Optimization: Proceedings of the 4th French\u2010German Conference on Optimization in Irsee, West Germany, April 1986, K. H. Hoffman, J. B. Hiriart\u2010Urruty, C. Lemar\u00e9chal, and J. Zowe, eds., Internat. Ser. Numer. Math. 84, Birkh\u00e4user\u2010Verlag, Basel, Switzerland, 1988, pp. 311\u2013327.","DOI":"10.1007\/978-3-0348-9297-1_20"},{"key":"R23","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580859"},{"key":"R24","doi-asserted-by":"publisher","DOI":"10.1090\/qam\/135625"},{"key":"R25","doi-asserted-by":"publisher","DOI":"10.1137\/0802002"},{"key":"R26","doi-asserted-by":"publisher","DOI":"10.1016\/S0025-5610(96)00075-5"}],"container-title":["SIAM Journal on Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/51052623496311880","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T16:55:40Z","timestamp":1787331340000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/51052623496311880"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,11]]},"references-count":26,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1998,11]]}},"alternative-id":["10.1137\/51052623496311880"],"URL":"https:\/\/doi.org\/10.1137\/51052623496311880","relation":{},"ISSN":["1052-6234","1095-7189"],"issn-type":[{"value":"1052-6234","type":"print"},{"value":"1095-7189","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,11]]}}}