{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:46:22Z","timestamp":1740123982161,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,2,5]],"date-time":"2019-02-05T00:00:00Z","timestamp":1549324800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s10957-019-01480-4","type":"journal-article","created":{"date-parts":[[2019,2,5]],"date-time":"2019-02-05T04:50:31Z","timestamp":1549342231000},"page":"727-742","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Irreducible Infeasible Subsystems of Semidefinite Systems"],"prefix":"10.1007","volume":"181","author":[{"given":"Kai","family":"Kellner","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0947-7193","authenticated-orcid":false,"given":"Marc E.","family":"Pfetsch","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5769-0917","authenticated-orcid":false,"given":"Thorsten","family":"Theobald","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,5]]},"reference":[{"key":"1480_CR1","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986)"},{"issue":"1","key":"1480_CR2","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1287\/ijoc.2.1.61","volume":"2","author":"J Gleeson","year":"1990","unstructured":"Gleeson, J., Ryan, J.: Identifying minimally infeasible subsystems of inequalities. ORSA J. Comput. 2(1), 61\u201363 (1990)","journal-title":"ORSA J. Comput."},{"issue":"2","key":"1480_CR3","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1287\/ijoc.9.2.164","volume":"9","author":"JW Chinneck","year":"1997","unstructured":"Chinneck, J.W.: Finding a useful subset of constraints for analysis in an infeasible linear program. INFORMS J. Comput. 9(2), 164\u2013174 (1997)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"1480_CR4","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1287\/ijoc.3.2.157","volume":"3","author":"JW Chinneck","year":"1991","unstructured":"Chinneck, J.W., Dravnieks, E.W.: Locating minimal infeasible constraint sets in linear programs. ORSA J. Comput. 3(2), 157\u2013168 (1991)","journal-title":"ORSA J. Comput."},{"issue":"3","key":"1480_CR5","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/0377-2217(81)90177-6","volume":"8","author":"JNM Loon van","year":"1981","unstructured":"van Loon, J.N.M.: Irreducibly inconsistent systems of linear inequalities. Eur. J. Oper. Res. 8(3), 283\u2013288 (1981)","journal-title":"Eur. J. Oper. Res."},{"key":"1480_CR6","volume-title":"Feasibility and Infeasibility in Optimization: Algorithms and Computational Methods, International Series in Operations Research and Management Sciences","author":"JW Chinneck","year":"2008","unstructured":"Chinneck, J.W.: Feasibility and Infeasibility in Optimization: Algorithms and Computational Methods, International Series in Operations Research and Management Sciences, vol. 118. Springer, Berlin (2008)"},{"issue":"1","key":"1480_CR7","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1287\/ijoc.11.1.63","volume":"11","author":"O Guieu","year":"1999","unstructured":"Guieu, O., Chinneck, J.W.: Analyzing infeasible mixed-integer and integer linear programs. INFORMS J. Comput. 11(1), 63\u201377 (1999)","journal-title":"INFORMS J. Comput."},{"key":"1480_CR8","doi-asserted-by":"crossref","unstructured":"Codato, G., Fischetti, M.: Combinatorial Benders\u2019 cuts. In: Bienstock, D., Nemhauser, G. (eds.) Proceedings of 10th International Conference on Integer Programming and Combinatorial Optimization (IPCO), New York, LNCS, vol. 3064, pp. 178\u2013195. Springer, Berlin (2004)","DOI":"10.1007\/978-3-540-25960-2_14"},{"key":"1480_CR9","doi-asserted-by":"crossref","unstructured":"Tun\u00e7el, L.: Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization. Fields Institute Monographs. American Mathematical Society, Providence, RI (2010)","DOI":"10.1090\/fim\/027"},{"issue":"3","key":"1480_CR10","doi-asserted-by":"publisher","first-page":"594","DOI":"10.1080\/10556788.2017.1322081","volume":"33","author":"T Gally","year":"2018","unstructured":"Gally, T., Pfetsch, M.E., Ulbrich, S.: A framework for solving mixed-integer semidefinite programs. Optim. Methods Softw. 33(3), 594\u2013632 (2018)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"1480_CR11","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.disopt.2006.10.006","volume":"4","author":"T Achterberg","year":"2007","unstructured":"Achterberg, T.: Conflict analysis in mixed integer programming. Discrete Optim. 4(1), 4\u201320 (2007)","journal-title":"Discrete Optim."},{"key":"1480_CR12","doi-asserted-by":"crossref","unstructured":"Witzig, J., Berthold, T., Heinz, S.: Experiments with conflict analysis in mixed integer programming. In: Salvagnin, D., Lombardi, M. (eds) Integration of AI and OR Techniques in Constraint Programming, LNCS, vol. 10335, pp. 211\u2013222. Springer, Berlin (2017)","DOI":"10.1007\/978-3-319-59776-8_17"},{"issue":"8","key":"1480_CR13","doi-asserted-by":"publisher","first-page":"4094","DOI":"10.1109\/TSP.2012.2196694","volume":"60","author":"E Elhamifar","year":"2012","unstructured":"Elhamifar, E., Vidal, R.: Block-sparse recovery via convex optimization. IEEE Trans. Signal Process. 60(8), 4094\u20134107 (2012)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"1480_CR14","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1109\/TSP.2010.2082536","volume":"59","author":"MA Khajehnejad","year":"2011","unstructured":"Khajehnejad, M.A., Dimakis, A.G., Xu, W., Hassibi, B.: Sparse recovery of nonnegative signals with minimal expansion. IEEE Trans. Signal Process. 59(1), 196\u2013208 (2011)","journal-title":"IEEE Trans. Signal Process."},{"key":"1480_CR15","doi-asserted-by":"crossref","unstructured":"Wang, M., Tang, A.: Conditions for a unique non-negative solution to an underdetermined system. In: 47th Annual Allerton Conference on Communication, Control, and Computing, Monticello IL. IEEE (2009)","DOI":"10.1109\/ALLERTON.2009.5394815"},{"issue":"3","key":"1480_CR16","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1109\/TSP.2010.2089624","volume":"59","author":"M Wang","year":"2011","unstructured":"Wang, M., Xu, W., Tang, A.: A unique \u201cnonnegative\u201d solution to an underdetermined system: from vectors to matrices. IEEE Trans. Signal Process. 59(3), 1007\u20131016 (2011)","journal-title":"IEEE Trans. Signal Process."},{"issue":"3","key":"1480_CR17","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1287\/moor.1120.0584","volume":"38","author":"I Klep","year":"2013","unstructured":"Klep, I., Schweighofer, S.: An exact duality theory for semidefinite programming based on sums of squares. Math. Oper. Res. 38(3), 569\u2013590 (2013)","journal-title":"Math. Oper. Res."},{"key":"1480_CR18","volume-title":"Semidefinite Optimization and Convex Algebraic Geometry","author":"G Blekherman","year":"2013","unstructured":"Blekherman, G., Parrilo, P.A., Thomas, R.R.: Semidefinite Optimization and Convex Algebraic Geometry. SIAM, Philadelphia (2013)"},{"key":"1480_CR19","doi-asserted-by":"crossref","unstructured":"Theobald, T.: Some recent developments in spectrahedral computation. In: B\u00f6ckle, G., Decker, W., Malle, G. (eds) Algorithmic and Experimental Methods in Algebra, Geometry, and Number Theory, pp. 717\u2013739. Springer, Berlin (2017)","DOI":"10.1007\/978-3-319-70566-8_30"},{"key":"1480_CR20","unstructured":"Pfetsch, M.E.: The maximum feasible subsystem problem and vertex-facet incidences of polyhedra. Ph.D. thesis, TU Berlin (2003)"},{"key":"1480_CR21","volume-title":"Convex Analysis","author":"RT Rockafellar","year":"1997","unstructured":"Rockafellar, R.T.: Convex Analysis. Princeton University Press, Princeton (1997)"},{"issue":"3","key":"1480_CR22","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s10107-002-0363-5","volume":"95","author":"E Amaldi","year":"2003","unstructured":"Amaldi, E., Pfetsch, M.E., Trotter Jr., L.E.: On the maximum feasible subsystem problem, IISs, and IIS-hypergraphs. Math. Program. 95(3), 533\u2013554 (2003)","journal-title":"Math. Program."},{"issue":"6","key":"1480_CR23","doi-asserted-by":"publisher","first-page":"3042","DOI":"10.1109\/TSP.2010.2044837","volume":"58","author":"YC Eldar","year":"2010","unstructured":"Eldar, Y.C., Kuppinger, P., B\u00f6lcskei, H.: Block-sparse signals: uncertainty relations and efficient recovery. IEEE Trans. Signal Process. 58(6), 3042\u20133054 (2010)","journal-title":"IEEE Trans. Signal Process."},{"issue":"7","key":"1480_CR24","doi-asserted-by":"publisher","first-page":"1401","DOI":"10.1007\/s10114-013-1564-y","volume":"29","author":"JH Lin","year":"2013","unstructured":"Lin, J.H., Li, S.: Block sparse recovery via mixed \n                    \n                      \n                    \n                    $$l_2$$\n                    \n                      \n                        \n                          l\n                          2\n                        \n                      \n                    \n                  \/\n                    \n                      \n                    \n                    $$l_1$$\n                    \n                      \n                        \n                          l\n                          1\n                        \n                      \n                    \n                   minimization. Acta Math. Sin. Engl. Ser. 29(7), 1401\u20131412 (2013)","journal-title":"Acta Math. Sin. Engl. Ser."},{"issue":"3","key":"1480_CR25","doi-asserted-by":"publisher","first-page":"1441","DOI":"10.1137\/140972354","volume":"25","author":"M Liu","year":"2015","unstructured":"Liu, M., Pataki, G.: Exact duality in semidefinite programming based on elementary reformulations. SIAM J. Optim. 25(3), 1441\u20131454 (2015)","journal-title":"SIAM J. Optim."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-019-01480-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-019-01480-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-019-01480-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,4]],"date-time":"2020-02-04T19:17:35Z","timestamp":1580843855000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-019-01480-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,5]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["1480"],"URL":"https:\/\/doi.org\/10.1007\/s10957-019-01480-4","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2019,2,5]]},"assertion":[{"value":"10 July 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 January 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 February 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}