{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,6]],"date-time":"2025-08-06T12:07:54Z","timestamp":1754482074024},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1992,5,1]],"date-time":"1992-05-01T00:00:00Z","timestamp":704678400000},"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":[[1992,5]]},"DOI":"10.1007\/bf01581083","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:52:15Z","timestamp":1114681935000},"page":"239-257","source":"Crossref","is-referenced-by-count":16,"title":["An interior point algorithm of $$O(\\sqrt m \\left| {\\ln \\varepsilon } \\right|)$$ iterations forC 1-convex programming"],"prefix":"10.1007","volume":"57","author":[{"given":"Jie","family":"Sun","sequence":"first","affiliation":[]},{"given":"Liqun","family":"Qi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","volume-title":"Optimization and Nonsmooth Analysis","author":"F.H. Clarke","year":"1983","unstructured":"F.H. Clarke,Optimization and Nonsmooth Analysis (Wiley, New York, 1983)."},{"key":"CR2","volume-title":"Numerical Methods for Unconstrained Optimization and Nonlinear Equations","author":"J.E. Dennis","year":"1983","unstructured":"J.E. Dennis and R.B. Schnabel,Numerical Methods for Unconstrained Optimization and Nonlinear Equations (Prentice-Hall, Englewood Cliffs, NJ, 1983)."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF01588795","volume":"49","author":"D. Goldfarb","year":"1991","unstructured":"D. Goldfarb and S. Liu, \u201cAn O(n 3 L) primal interior point method for convex quadratic programming,\u201dMathematical Programming 49 (1991) 325\u2013340.","journal-title":"Mathematical Programming"},{"key":"CR4","volume-title":"\u201cA large-step analytic center method for a class of smooth convex programming problems,\u201d Report 90-14","author":"D.D. Hertog","year":"1990","unstructured":"D.D. Hertog, C. Roos and T. Terlaky, \u201cA large-step analytic center method for a class of smooth convex programming problems,\u201d Report 90-14, Faculty of Technical Mathematics and Informatics, Delft University of Technology (Delft, Netherlands, 1990)."},{"key":"CR5","volume-title":"\u201cA potential reduction method for a class of smooth convex programming problems,\u201d Report 90-91","author":"D.D. Hertog","year":"1990","unstructured":"D.D. Hertog, C. Roos and T. Terlaky, \u201cA potential reduction method for a class of smooth convex programming problems,\u201d Report 90-91, Faculty of Technical Mathematics and Informatics, Delft University of Technology (Delft, Netherlands, 1990)."},{"key":"CR6","first-page":"207","volume-title":"Nonlinear Programming","author":"P. Huard","year":"1967","unstructured":"P. Huard, \u201cResolution of mathematical programming with nonlinear constraints by the method of centers,\u201d in: J. Abadie, ed.,Nonlinear Programming (North-Holland, Amsterdam, 1967) pp. 207\u2013219."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/BF01588796","volume":"49","author":"F. Jarre","year":"1990\/91","unstructured":"F. Jarre, \u201cOn the convergence of the method of analytic centers when applied to convex quadratic programs,\u201dMathematical Programming 49 (1990\/91) 341\u2013358.","journal-title":"Mathematical Programming"},{"key":"CR8","first-page":"69","volume-title":"Optimization. Lecture Notes in Mathematics No. 1405","author":"F. Jarre","year":"1989","unstructured":"F. Jarre, \u201cOn the method of analytic centers for solving smooth convex programs,\u201d in: S. Dolecki, ed.,Optimization. Lecture Notes in Mathematics No. 1405 (Springer, Berlin, 1989) pp. 69\u201385."},{"key":"CR9","first-page":"297","volume-title":"Lecture Notes in Control And Information Sciences No. 111","author":"F. Jarre","year":"1988","unstructured":"F. Jarre, G. Sonnevend and J. Stoer, \u201cAn implementation of the method of analytic centers,\u201d in: A. Benoussan and J.L. Lions, eds.,Lecture Notes in Control And Information Sciences No. 111 (Springer, Berlin, 1988) pp. 297\u2013307."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF01582283","volume":"43","author":"M. Kojima","year":"1989","unstructured":"M. Kojima, S. Mizuno and T. Noma, \u201cA new continuation method for complementary problems with uniform P-functions,\u201dMathematical Programming 43 (1989) 107\u2013113.","journal-title":"Mathematical Programming"},{"key":"CR11","volume-title":"On some efficient interior point methods for nonlinear convex programming","author":"K.O. Kortanek","year":"1989","unstructured":"K.O. Kortanek, F. Potra and Y. Ye, \u201cOn some efficient interior point methods for nonlinear convex programming,\u201d Preprint 89-24, College of Business Administration, The University of Iowa (Iowa City, IA, 1989)."},{"key":"CR12","volume-title":"A polynomial algorithm for convex programming problems satisfying a scaled Lipschitz condition","author":"K.O. Kortanek","year":"1990","unstructured":"K.O. Kortanek and J. Zhu, \u201cA polynomial algorithm for convex programming problems satisfying a scaled Lipschitz condition,\u201d Preprint 90-17, College of Business administration, The University of Iowa (Iowa City, IA, 1990)."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/moor.15.2.342","volume":"15","author":"S. Mehrotra","year":"1990","unstructured":"S. Mehrotra and J. Sun, \u201cAn algorithm for convex quadratic programming that requires O(n 3.5 L)arithmetic operations,\u201dMathematics of Operations Research 15 (1990) 342\u2013363.","journal-title":"Mathematics of Operations Research"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1137\/0728029","volume":"28","author":"S. Mehrotra","year":"1991","unstructured":"S. Mehrotra and J. Sun, \u201cA method of analytic centers for quadratically constrained convex quadratic programs,\u201dSIAM Journal on Numerical Analysis 28 (1991) 529\u2013544.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"CR15","first-page":"265","volume-title":"Contemporary Mathematics, Vol. 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 in: J. Lagarias and M. Todd, eds.,Contemporary Mathematics, Vol. 114 (AMS, Providence, RI, 1990) pp. 265\u2013284."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF01594926","volume":"51","author":"S. Mehrotra","year":"1991","unstructured":"S. Mehrotra and J. Sun, \u201cOn computing the center of a convex quadratically constrained set,\u201dMathematical Programming 51 (1991) 81\u201389.","journal-title":"Mathematical Programming"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1287\/moor.15.3.408","volume":"15","author":"R.C. Monteiro","year":"1990","unstructured":"R.C. Monteiro and I. Adler, \u201cAn extension of Karmarkar type algorithm to a class of convex separable programming problems with global linear rate of convergence,\u201dMathematics of Operations Research 15 (1990) 408\u2013422.","journal-title":"Mathematics of Operations Research"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1287\/moor.15.2.191","volume":"15","author":"R.C. Monteiro","year":"1990","unstructured":"R.C. Monteiro, I. Adler and M.G.C. Resende, \u201cA polynomial-time primal\u2014dual affine scaling algorithm for linear and convex quadratic programming and its power series extension,\u201dMathematics of Operations Research 15 (1990) 191\u2013214.","journal-title":"Mathematics of Operations Research"},{"key":"CR19","volume-title":"\u201cA general approach to polynomial-time algorithms design for convex programming,\u201d Report","author":"J.E. Nesterov","year":"1988","unstructured":"J.E. Nesterov and A.S. Nemirovsky, \u201cA general approach to polynomial-time algorithms design for convex programming,\u201d Report, Central Economical and Mathematical Institute, USSR Academy of Science (Moscow, 1988)."},{"key":"CR20","volume-title":"\u201cA nonsmooth version of Newton's method,\u201d Technical Report 90-01","author":"L. Qi","year":"1990","unstructured":"L. Qi and J. Sun, \u201cA nonsmooth version of Newton's method,\u201d Technical Report 90-01, Department of Industrial Engineering and Management Sciences, Northwestern University (Evanston, IL, 1990), to appear in:Mathematical Programming."},{"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","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafellar","year":"1970","unstructured":"R.T. Rockafellar,Convex Analysis (Princeton University Press, Princeton, NJ, 1970)."},{"key":"CR23","first-page":"247","volume-title":"Advances in Numerical Partial Differential Equations and Optimization","author":"R.T. Rockafellar","year":"1991","unstructured":"R.T. Rockafellar, \u201cLarge-scale extended linear-quadratic programming and multistage optimization,\u201d in: S. Gomez et al., eds.,Advances in Numerical Partial Differential Equations and Optimization (SIAM, Philadelphia, PA, 1991) pp. 247\u2013261."},{"key":"CR24","doi-asserted-by":"crossref","first-page":"810","DOI":"10.1137\/0328046","volume":"28","author":"R.T. Rockafellar","year":"1990","unstructured":"R.T. Rockafellar and R.-J.B. Wets, \u201cGeneralized linear-quadratic problems of deterministic and stochastic optimal control in discrete time,\u201dSIAM Journal on Control and Optimization 28 (1990) 810\u2013822.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"CR25","first-page":"866","volume-title":"Lecture Notes in Control and Information Sciences No. 84","author":"G. Sonnevend","year":"1985","unstructured":"G. Sonnevend, \u201cAn analytical centre for polyhedrons and new class of global algorithms for linear (smooth, convex) programming,\u201d in:Lecture Notes in Control and Information Sciences No. 84 (Springer, Berlin, 1985) pp. 866\u2013876."},{"key":"CR26","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01445161","volume":"21","author":"G. Sonnevend","year":"1990","unstructured":"G. Sonnevend and J. Stoer, \u201cGlobal ellipsoidal approximation and homotopy methods for solving convex analytic programs,\u201dApplied Mathematics and Optimization 21 (1990) 139\u2013165.","journal-title":"Applied Mathematics and Optimization"},{"key":"CR27","volume-title":"\u201cAn affine-scaling method for linearly constrained convex programs,\u201d Technical Report","author":"J. Sun","year":"1990","unstructured":"J. Sun, \u201cAn affine-scaling method for linearly constrained convex programs,\u201d Technical Report, Department of Industrial Engineering and Management Sciences, Northwestern University (Evanston, IL, 1990)."},{"key":"CR28","volume-title":"A new algorithm for minimizing convex functions over convex sets","author":"P.M. Vaidya","year":"1990","unstructured":"P.M. Vaidya, \u201cA new algorithm for minimizing convex functions over convex sets,\u201d Preprint, AT&T Bell Laboratories (Murray Hill, NJ, 1990)."},{"key":"CR29","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF01587086","volume":"44","author":"Y. Ye","year":"1989","unstructured":"Y. Ye and E. Tse, \u201cAn extension of Karmarkar's projective algorithm for convex quadratic programming,\u201dMathematical Programming 44 (1989) 157\u2013180.","journal-title":"Mathematical Programming"},{"key":"CR30","volume-title":"A path following algorithm for a class of convex programming problems","author":"J. Zhu","year":"1990","unstructured":"J. Zhu, \u201cA path following algorithm for a class of convex programming problems,\u201d Preprint 90-14, College of Business Administration, The University of Iowa (Iowa City, IA, 1990)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581083.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01581083\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581083","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:12:14Z","timestamp":1556896334000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01581083"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,5]]},"references-count":30,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1992,5]]}},"alternative-id":["BF01581083"],"URL":"https:\/\/doi.org\/10.1007\/bf01581083","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,5]]}}}