{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T17:16:29Z","timestamp":1649092589002},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2012,7,10]],"date-time":"2012-07-10T00:00:00Z","timestamp":1341878400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s10107-012-0577-0","type":"journal-article","created":{"date-parts":[[2012,7,9]],"date-time":"2012-07-09T08:57:05Z","timestamp":1341824225000},"page":"579-589","source":"Crossref","is-referenced-by-count":4,"title":["A complementarity partition theorem for multifold conic systems"],"prefix":"10.1007","volume":"142","author":[{"given":"Javier","family":"Pe\u00f1a","sequence":"first","affiliation":[]},{"given":"Vera","family":"Roshchina","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,7,10]]},"reference":[{"issue":"1","key":"577_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s10107-002-0339-5","volume":"95","author":"F Alizadeh","year":"2003","unstructured":"Alizadeh F, Goldfarb D.: Second-order cone programming. Math. Program. Ser. B 95(1), 3\u201351 (2003)","journal-title":"Math. Program. Ser. B"},{"key":"577_CR2","first-page":"111","volume":"77","author":"F. Alizadeh","year":"1997","unstructured":"Alizadeh F., Haeberly J.-P., Overton M.: Complementarity and nondegeneracy in semidefinite programming. Math. Program. 77, 111\u2013128 (1997)","journal-title":"Math. Program."},{"issue":"1","key":"577_CR3","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1137\/060665427","volume":"19","author":"D. Cheung","year":"2008","unstructured":"Cheung D., Cucker F., Pe\u00f1a J.: A condition number for multifold conic systems. SIAM J. Optim. 19(1), 261\u2013280 (2008)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"577_CR4","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1137\/S1052623400373829","volume":"12","author":"M. Epelman","year":"2002","unstructured":"Epelman M., Freund R.: A new condition measure, preconditioners, and relations between different measures of conditioning for conic linear systems. SIAM J. Optim. 12(3), 627\u2013655 (2002)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"577_CR5","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1007\/s10107-005-0667-3","volume":"106","author":"R. Freund","year":"2006","unstructured":"Freund R.: On the behavior of the homogeneous self-dual model for conic convex optimization. Math. Program. 106(3), 527\u2013545 (2006)","journal-title":"Math. Program."},{"key":"577_CR6","doi-asserted-by":"crossref","unstructured":"Goldman, A.J., Tucker, A.W.: Theory of linear programming Linear Inequalities and Related Systems. In: Kuhn, H.W., Tucker, A.W. (eds) Annals of Mathematical Studies, vol. 38, pp. 53\u201397 (1956)","DOI":"10.1515\/9781400881987-005"},{"key":"577_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-56468-0","volume-title":"Fundamentals of Convex Analysis","author":"J.-B. Hiriart-Urruty","year":"2001","unstructured":"Hiriart-Urruty J.-B., Lemar\u00e9chal C.: Fundamentals of Convex Analysis. Springer, Berlin (2001)"},{"key":"577_CR8","doi-asserted-by":"crossref","unstructured":"Ho, J., Tun\u00e7el, L.: Reconciliation of various complexity and condition measures for linear programming problems and a generalization of Tardos\u2019 theorem. In: Proceedings of the Smalefest, pp. 93\u2013147. World Scientific Publishing (2002)","DOI":"10.1142\/9789812778031_0006"},{"key":"577_CR9","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/s10107980009a","volume":"84","author":"Y. Nesterov","year":"1999","unstructured":"Nesterov Y., Todd M., Ye Y.: Infeasible-start primal-dual methods and infeasible detectors for nonlinear programming. Math. Program. 84, 227\u2013267 (1999)","journal-title":"Math. Program."},{"key":"577_CR10","unstructured":"Pataki, G.: Bad semidefinite programs: they all look the same. Technical report, University of North Carolina"},{"key":"577_CR11","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/moor.1060.0242","volume":"32","author":"G. Pataki","year":"2007","unstructured":"Pataki G.: On the closedness of the linear image of a closed convex cone. Math. Oper. Res. 32, 395\u2013412 (2007)","journal-title":"Math. Oper. Res."},{"key":"577_CR12","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1137\/0805026","volume":"5","author":"J. Renegar","year":"1995","unstructured":"Renegar J.: Incorporating condition measures into the complexity theory of linear programming. SIAM J. Optim. 5, 506\u2013524 (1995)","journal-title":"SIAM J. Optim."},{"key":"577_CR13","first-page":"279","volume":"70","author":"J. Renegar","year":"1995","unstructured":"Renegar J.: Linear programming, complexity theory and elementary functional analysis. Math. Program. 70, 279\u2013351 (1995)","journal-title":"Math. Program."},{"key":"577_CR14","doi-asserted-by":"crossref","unstructured":"Tun\u00e7el, L., Wolkowicz, H.: Strong duality and minimal representations for cone optimization. Comput. Optim. Appl. doi: 10.1007\/s10589-012-9480-0","DOI":"10.1007\/s10589-012-9480-0"},{"key":"577_CR15","first-page":"79","volume":"74","author":"S. Vavasis","year":"1996","unstructured":"Vavasis S., Ye Y.: A primal-dual interior point method whose running time depends only on the constraint matrix. Math. Program. 74, 79\u2013120 (1996)","journal-title":"Math. Program."},{"key":"577_CR16","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-Dual Interior-Point Methods","author":"S. Wright","year":"1997","unstructured":"Wright S.: Primal-Dual Interior-Point Methods. Society for Industrial and Applied Mathematics, Philadelphia (1997)"},{"key":"577_CR17","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1287\/moor.19.1.53","volume":"19","author":"Y. Ye","year":"1994","unstructured":"Ye Y., Todd M., Mizuno S.: An $${O(\\sqrt{n}L)}$$ -iteration homogeneous and self-dual linear programming algorithm. Math. Oper. Res. 19, 53\u201367 (1994)","journal-title":"Math. Oper. Res."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0577-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-012-0577-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0577-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,30]],"date-time":"2019-06-30T14:42:15Z","timestamp":1561905735000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-012-0577-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,7,10]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["577"],"URL":"https:\/\/doi.org\/10.1007\/s10107-012-0577-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,7,10]]}}}