{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T23:06:38Z","timestamp":1768086398443,"version":"3.49.0"},"reference-count":25,"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\/bf01585553","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T04:42:17Z","timestamp":1114663337000},"page":"75-88","source":"Crossref","is-referenced-by-count":13,"title":["A sufficient condition for self-concordance, with application to some classes of structured convex programming problems"],"prefix":"10.1007","volume":"69","author":[{"given":"D.","family":"den Hertog","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Jarre","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.","family":"Roos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"T.","family":"Terlaky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","first-page":"1","volume-title":"Advances in Optimization and Parallel Computing","author":"F. Alizadeh","year":"1992","unstructured":"F. Alizadeh, \u201cOptimization over the positive definite cone: interior-point methods and combinatorial applications,\u201d in: P. Pardalos, ed.,Advances in Optimization and Parallel Computing (North-Holland, Amsterdam, 1992) pp. 1\u201325."},{"key":"CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-011-1134-8","volume-title":"Interior Point Approach to Linear, Quadratic and Convex Programming: Algorithms and Complexity","author":"D. Hertog den","year":"1994","unstructured":"D. den Hertog,Interior Point Approach to Linear, Quadratic and Convex Programming: Algorithms and Complexity (Kluwer Academic Publishers, Dordrecht, 1994)."},{"issue":"1","key":"CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00940075","volume":"73","author":"D. Hertog den","year":"1992","unstructured":"D. den Hertog, C. Roos and T. Terlaky, \u201cOn the classical logarithmic barrier method for a class of smooth convex programming problems,\u201dJournal of Optimization Theory and Applications 73 (1) (1992) 1\u201325.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"CR4","volume-title":"Geometric Programming","author":"R.J. Duffin","year":"1967","unstructured":"R.J. Duffin, E.L. Peterson and C. Zener,Geometric Programming (Wiley, New York, 1967)."},{"key":"CR5","volume-title":"Nonlinear Programming, Sequential Unconstrained Minimization Techniques","author":"A.V. Fiacco","year":"1968","unstructured":"A.V. Fiacco and G.P. McCormick,Nonlinear Programming, Sequential Unconstrained Minimization Techniques (Wiley, New York, 1968)."},{"key":"CR6","volume-title":"The logarithmic potential method for solving linear programming problems","author":"R. Frisch","year":"1955","unstructured":"R. Frisch, \u201cThe logarithmic potential method for solving linear programming problems,\u201d Memorandum, University Institute of Economics, Oslo, Norway, 1955."},{"key":"CR7","volume-title":"\u201cOn interior-point algorithms for some entropy optimization problems,\u201d Technical Report CS 91-02","author":"C.-G. Han","year":"1991","unstructured":"C.-G. Han, P.M. Pardalos and Y. Ye, \u201cOn interior-point algorithms for some entropy optimization problems,\u201d Technical Report CS 91-02, Computer Science Department, Pennsylvania State University, University Park, PA, 1991."},{"key":"CR8","first-page":"207","volume-title":"Nonlinear Programming","author":"P. Huard","year":"1967","unstructured":"P. Huard, \u201cResolution of mathematical programming with nonlinear constraints by the methods of centres,\u201d in: J. Abadie, ed.,Nonlinear Programming (North-Holland, Amsterdam, 1967) pp. 207\u2013219."},{"key":"CR9","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, Germany, 1989."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/BF01371086","volume":"26","author":"F. Jarre","year":"1992","unstructured":"F. Jarre, \u201cInterior-point methods for convex programming,\u201dApplied Mathematics and Optimization 26 (1992) 287\u2013311.","journal-title":"Applied Mathematics and Optimization"},{"key":"CR11","unstructured":"F. Jarre and M.A. Saunders, \u201cPractical aspects of an interior-point method for convex programming,\u201dSIAM Journal on Optimization, to appear."},{"key":"CR12","first-page":"501","volume":"23","author":"K.O. Kortanek","year":"1990","unstructured":"K.O. Kortanek and H. No, \u201cA second order affine scaling algorithm for the geometric programming dual with logarithmic barrier,\u201dOptimization 23 (1990) 501\u2013507.","journal-title":"Optimization"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1287\/moor.18.1.116","volume":"18","author":"K.O. Kortanek","year":"1993","unstructured":"K.O. Kortanek and J. Zhu, \u201cA polynomial barrier algorithm for linearly constrained convex programming problems,\u201dMathematics of Operations Research 18 (1993) 116\u2013128.","journal-title":"Mathematics of Operations Research"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1137\/0802022","volume":"2","author":"I.J. Lustig","year":"1992","unstructured":"I.J. Lustig, R.E. Marsten and D.F. Shanno, \u201cOn implementing Mehrotra's predictor-corrector interior point method for linear programming,\u201dSIAM Journal on Optimization 2 (1992) 435\u2013449.","journal-title":"SIAM Journal on Optimization"},{"key":"CR15","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,\u201dContemporary Mathematics 114 (1990) 265\u2013284.","journal-title":"Contemporary Mathematics"},{"issue":"3","key":"CR16","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1287\/moor.15.3.408","volume":"15","author":"R.D.C. Monteiro","year":"1989","unstructured":"R.D.C. Monteiro and I. Adler, \u201cAn extension of Karmarkar type algorithms to a class of convex separable programming problems with global rate of convergence,\u201dMathematics of Operations Research 15 (3) (1989) 408\u2013422.","journal-title":"Mathematics of Operations Research"},{"key":"CR17","series-title":"SIAM Studies in Applied Mathematics","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior Point Polynomial Algorithms in Convex Programming","author":"Y.E. Nesterov","year":"1994","unstructured":"Y.E. Nesterov and A.S. Nemirovsky,Interior Point Polynomial Algorithms in Convex Programming, SIAM Studies in Applied Mathematics, Vol. 13 (SIAM, Philadelphia, PA, 1994)."},{"key":"CR18","first-page":"445","volume-title":"Proceedings of the International Symposium of Mathematical Programming","author":"E.L. Peterson","year":"1970","unstructured":"E.L. Peterson and J.G. Ecker, \u201cGeometric programming: duality in quadratic programming andl p approximation I,\u201d in: H.W. Kuhn and A.W. Tucker, eds.,Proceedings of the International Symposium of Mathematical Programming (Princeton University Press, Princeton, NJ, 1970) pp. 445\u2013479."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1137\/0117031","volume":"17","author":"E.L. Peterson","year":"1969","unstructured":"E.L. Peterson and J.G. Ecker, \u201cGeometric programming: duality in quadratic programming andl p approximation II,\u201dSIAM Journal on Applied Mathematics 17 (1969) 317\u2013340.","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0022-247X(70)90085-5","volume":"29","author":"E.L. Peterson","year":"1970","unstructured":"E.L. Peterson and J.G. Ecker, \u201cGeometric programming: duality in quadratic programming andl p approximation III,\u201dJournal of Mathematical Analysis and Applications 29 (1970) 365\u2013383.","journal-title":"Journal of Mathematical Analysis and Applications"},{"issue":"1","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 (1) (1988) 59\u201393.","journal-title":"Mathematical Programming"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/0377-2217(85)90116-X","volume":"22","author":"T. Terlaky","year":"1985","unstructured":"T. Terlaky, \u201cOnl p programming,\u201dEuropean Journal of Operational Research 22 (1985) 70\u2013100.","journal-title":"European Journal of Operational Research"},{"key":"CR23","series-title":"Working Paper Series","volume-title":"An interior-point algorithm for solving entropy optimization problems with globally linear and locally quadratic convergence rate","author":"Y. Ye","year":"1990","unstructured":"Y. Ye and F. Potra, \u201cAn interior-point algorithm for solving entropy optimization problems with globally linear and locally quadratic convergence rate,\u201d Working Paper Series No. 90-22, Department of Management Sciences, University of Iowa, Iowa City, IA, 1990; also:SIAM Journal on Optimization, to appear."},{"key":"CR24","series-title":"Research Memorandum","volume-title":"The convergence property of Iri-Imai's algorithm for some smooth convex programming problems","author":"S. Zhang","year":"1992","unstructured":"S. Zhang, \u201cThe convergence property of Iri-Imai's algorithm for some smooth convex programming problems,\u201d Research Memorandum no. 485, Institute of Economic Research, Faculty of Economics, University of Groningen, Netherlands, 1992."},{"issue":"4","key":"CR25","first-page":"359","volume":"36","author":"J. Zhu","year":"1992","unstructured":"J. Zhu, \u201cA path following algorithm for a class of convex programming problems,\u201dZeitschrift f\u00fcr Operations Research 36 (4) (1992) 359\u2013377.","journal-title":"Zeitschrift f\u00fcr Operations Research"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585553.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01585553\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01585553","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:32:28Z","timestamp":1556883148000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01585553"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":25,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["BF01585553"],"URL":"https:\/\/doi.org\/10.1007\/bf01585553","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}