{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T15:29:55Z","timestamp":1751729395800},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2010,5,4]],"date-time":"2010-05-04T00:00:00Z","timestamp":1272931200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Found Comput Math"],"published-print":{"date-parts":[[2010,10]]},"DOI":"10.1007\/s10208-010-9069-x","type":"journal-article","created":{"date-parts":[[2010,5,3]],"date-time":"2010-05-03T10:45:21Z","timestamp":1272883521000},"page":"485-525","source":"Crossref","is-referenced-by-count":7,"title":["Self-Concordant Barriers for Convex Approximations of Structured Convex Sets"],"prefix":"10.1007","volume":"10","author":[{"given":"Levent","family":"Tun\u00e7el","sequence":"first","affiliation":[]},{"given":"Arkadi","family":"Nemirovski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,5,4]]},"reference":[{"key":"9069_CR1","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1137\/S1052623497318013","volume":"9","author":"K.M. Anstreicher","year":"1999","unstructured":"K.M. Anstreicher, Towards a practical volumetric cutting plane method for convex programming, SIAM J. Optim. 9, 190\u2013206 (1999).","journal-title":"SIAM J. Optim."},{"key":"9069_CR2","first-page":"1","volume":"69","author":"D.S. Atkinson","year":"1995","unstructured":"D.S. Atkinson, P.M. Vaidya, A cutting plane algorithm for convex programming that uses analytic centers, Math. Prog. 69, 1\u201343 (1995).","journal-title":"Math. Prog."},{"key":"9069_CR3","volume-title":"Potential Function Methods for Approximately Solving Linear Programming Problems. Theory and Practice","author":"D. Bienstock","year":"2002","unstructured":"D. Bienstock, Potential Function Methods for Approximately Solving Linear Programming Problems. Theory and Practice (Kluwer Academic, Boston, 2002)."},{"key":"9069_CR4","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1137\/S0097539705447293","volume":"35","author":"D. Bienstock","year":"2006","unstructured":"D. Bienstock, G. Iyengar, Approximating fractional packings and coverings in O(1\/\u03b5) iterations, SIAM J. Comput. 35, 825\u2013854 (2006).","journal-title":"SIAM J. Comput."},{"key":"9069_CR5","series-title":"CBMS-NSF Regional Conference Series in Applied Mathematics","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898717105","volume-title":"Combinatorial Optimization, Packing and Covering","author":"G. Cornu\u00e9jols","year":"2001","unstructured":"G. Cornu\u00e9jols, Combinatorial Optimization, Packing and Covering. CBMS-NSF Regional Conference Series in Applied Mathematics (SIAM, Philadelphia, 2001)."},{"key":"9069_CR6","unstructured":"N. Garg, J. K\u00f6nemann, Faster and simpler algorithms for multicommodity flow and other fractional packing problems, in Proc. 39th Ann. Symp. on FOCS (1998), pp.\u00a0300\u2013309."},{"key":"9069_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, Y. Ye, Complexity analysis of an interior cutting plane method for convex feasibility problems, SIAM J. Optim. 6, 638\u2013652 (1996).","journal-title":"SIAM J. Optim."},{"key":"9069_CR8","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1287\/moor.21.2.321","volume":"21","author":"M.D. Grigoriadis","year":"1996","unstructured":"M.D. Grigoriadis, L.G. Khachiyan, Coordination complexity of parallel price-directive decomposition, Math. Oper. Res. 21, 321\u2013340 (1996).","journal-title":"Math. Oper. Res."},{"key":"9069_CR9","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1137\/S0097539792241175","volume":"23","author":"P. Klein","year":"1994","unstructured":"P. Klein, S.A. Plotkin, C. Stein, \u00c9. Tardos, Faster approximation algorithms for the unit capacity concurrent flow problem with applications to routing and finding sparse cuts, SIAM J. Comput. 23, 466\u2013487 (1994).","journal-title":"SIAM J. Comput."},{"key":"9069_CR10","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1006\/jcss.1995.1020","volume":"50","author":"T. Leighton","year":"1995","unstructured":"T. Leighton, F. Makedon, S.A. Plotkin, C. Stein, \u00c9. Tardos, S. Tragoudas, Fast approximation algorithms for multicommodity flow problems, J.\u00a0Comput. Syst. Sci. 50, 228\u2013243 (1995).","journal-title":"J.\u00a0Comput. Syst. Sci."},{"key":"9069_CR11","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/BF01580902","volume":"56","author":"J.E. Mitchell","year":"1992","unstructured":"J.E. Mitchell, M.J. Todd, Solving combinatorial optimization problems using Karmarkar\u2019s algorithm, Math. Prog. 56, 245\u2013284 (1992).","journal-title":"Math. Prog."},{"key":"9069_CR12","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1137\/S1052623403425629","volume":"15","author":"A. Nemirovski","year":"2004","unstructured":"A. Nemirovski, Proximal method with rate of convergence O(1\/t) for variational inequalities with Lipschitz continuous monotone operators and smooth convex-concave saddle point problems, SIAM J. Optim. 15, 229\u2013251 (2004).","journal-title":"SIAM J. Optim."},{"key":"9069_CR13","unstructured":"A. Nemirovski, Interior point polynomial time methods in convex programming, Lecture Notes (Dept. of ISyE, Georgia Tech., GA, USA, 2004)."},{"key":"9069_CR14","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s10107-004-0545-4","volume":"102","author":"A. Nemirovski","year":"2005","unstructured":"A. Nemirovski, L. Tun\u00e7el, \u201cCone-free\u201d primal-dual path-following and potential reduction polynomial time interior-point methods, Math. Prog. 102, 261\u2013294 (2005).","journal-title":"Math. Prog."},{"key":"9069_CR15","series-title":"Wiley\u2013Interscience Series in Discrete Mathematics","volume-title":"Problem Complexity and Method Efficiency in Optimization","author":"A. Nemirovski","year":"1983","unstructured":"A. Nemirovski, D.B. Yudin, Problem Complexity and Method Efficiency in Optimization. Wiley\u2013Interscience Series in Discrete Mathematics (Wiley, New York, 1983)."},{"key":"9069_CR16","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Yu. Nesterov","year":"2005","unstructured":"Yu. Nesterov, Smooth minimization of nonsmooth functions, Math. Prog. 103, 127\u2013152 (2005).","journal-title":"Math. Prog."},{"key":"9069_CR17","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1007\/s10107-006-0034-z","volume":"109","author":"Yu. Nesterov","year":"2007","unstructured":"Yu. Nesterov, Dual extrapolation and its applications for solving variational inequalities and related problems, Math. Prog. 109, 319\u2013344 (2007).","journal-title":"Math. Prog."},{"key":"9069_CR18","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1080\/10556780701550059","volume":"23","author":"Yu. Nesterov","year":"2008","unstructured":"Yu. Nesterov, Rounding of convex sets and efficient gradient methods for linear programming problems, Optim. Methods Softw. 23, 109\u2013128 (2008).","journal-title":"Optim. Methods Softw."},{"key":"9069_CR19","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/moor.1080.0348","volume":"34","author":"Yu. Nesterov","year":"2009","unstructured":"Yu. Nesterov, Unconstrained convex minimization in relative scale, Math. Oper. Res. 34, 180\u2013193 (2009).","journal-title":"Math. Oper. Res."},{"key":"9069_CR20","series-title":"SIAM Series in Applied Mathematics","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970791","volume-title":"Interior Point Polynomial Methods in Convex Programming","author":"Yu. Nesterov","year":"1994","unstructured":"Yu. Nesterov, A. Nemirovskii, Interior Point Polynomial Methods in Convex Programming. SIAM Series in Applied Mathematics (SIAM, Philadelphia, 1994)."},{"key":"9069_CR21","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1287\/moor.20.2.257","volume":"20","author":"S.A. Plotkin","year":"1995","unstructured":"S.A. Plotkin, D.B. Shmoys, \u00c9. Tardos, Fast approximation algorithms for fractional packing and covering problems, Math. Oper. Res. 20, 257\u2013301 (1995).","journal-title":"Math. Oper. Res."},{"key":"9069_CR22","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/s10208-004-0136-z","volume":"6","author":"J. Renegar","year":"2006","unstructured":"J. Renegar, Hyperbolic programs, and their derivative relaxations, Found. Comput. Math. 6, 59\u201379 (2006).","journal-title":"Found. Comput. Math."},{"key":"9069_CR23","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1145\/77600.77620","volume":"37","author":"F. Shahrokhi","year":"1990","unstructured":"F. Shahrokhi, D.W. Matula, The maximum concurrent flow problem, J.\u00a0Assoc. Comput. Mach. 37, 318\u2013334 (1990).","journal-title":"J.\u00a0Assoc. Comput. Mach."}],"container-title":["Foundations of Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-010-9069-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10208-010-9069-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10208-010-9069-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T07:05:10Z","timestamp":1559113510000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10208-010-9069-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,4]]},"references-count":23,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["9069"],"URL":"https:\/\/doi.org\/10.1007\/s10208-010-9069-x","relation":{},"ISSN":["1615-3375","1615-3383"],"issn-type":[{"value":"1615-3375","type":"print"},{"value":"1615-3383","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,4]]}}}