{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:39:01Z","timestamp":1740145141883,"version":"3.37.3"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,5,22]],"date-time":"2023-05-22T00:00:00Z","timestamp":1684713600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,5,22]],"date-time":"2023-05-22T00:00:00Z","timestamp":1684713600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000086","name":"Directorate for Mathematical and Physical Sciences","doi-asserted-by":"publisher","award":["1819229"],"award-info":[{"award-number":["1819229"]}],"id":[{"id":"10.13039\/100000086","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000153","name":"Division of Biological Infrastructure","doi-asserted-by":"publisher","award":["1661348"],"award-info":[{"award-number":["1661348"]}],"id":[{"id":"10.13039\/100000153","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s11590-023-02015-7","type":"journal-article","created":{"date-parts":[[2023,5,22]],"date-time":"2023-05-22T02:01:22Z","timestamp":1684720882000},"page":"591-613","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Robust feasibility of systems of quadratic equations using topological degree theory"],"prefix":"10.1007","volume":"18","author":[{"given":"Krishnamurthy","family":"Dvijotham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2727-6547","authenticated-orcid":false,"given":"Bala","family":"Krishnamoorthy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunqi","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Benjamin","family":"Rapone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,22]]},"reference":[{"key":"2015_CR1","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10107-012-0567-2","volume":"134","author":"C Bandi","year":"2012","unstructured":"Bandi, C., Bertsimas, D.: Tractable stochastic analysis in high dimensions via robust optimization. Math. Progr. 134, 23\u201370 (2012)","journal-title":"Math. Progr."},{"issue":"4","key":"2015_CR2","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1287\/moor.2014.0645","volume":"39","author":"C Bandi","year":"2014","unstructured":"Bandi, C., Bertsimas, Dimitris: Optimal design for multi-item auctions: a robust optimization approach. Math. Operat. Res. 39(4), 1012\u20131038 (2014)","journal-title":"Math. Operat. Res."},{"key":"2015_CR3","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050","volume-title":"Robust optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust optimization. Princeton University Press, Princeton (2009)"},{"issue":"1","key":"2015_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6377(99)00016-4","volume":"25","author":"A Ben-Tal","year":"1999","unstructured":"Ben-Tal, A., Nemirovski, A.: Robust solutions of uncertain linear programs. Operat. Res. Lett. 25(1), 1\u201313 (1999)","journal-title":"Operat. Res. Lett."},{"key":"2015_CR5","doi-asserted-by":"crossref","unstructured":"Bendich, P., Edelsbrunner, H., Morozov, D., Patel, A.: The robustness of level sets. In: ESA 2010: 18th Annual European Symposium, Liverpool, UK, September 6\u20138, 2010. In: Proceedings, Part I, pp. 1\u201310. Springer, Berlin & Heidelberg (2010)","DOI":"10.1007\/978-3-642-15775-2_1"},{"issue":"1","key":"2015_CR6","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1287\/ijoc.1090.0319","volume":"22","author":"D Bertsimas","year":"2010","unstructured":"Bertsimas, D., Nohadani, O., Teo, Kwong Meng: Nonconvex robust optimization for problems with constraints. INFORMS J. Comput. 22(1), 44\u201358 (2010)","journal-title":"INFORMS J. Comput."},{"issue":"6","key":"2015_CR7","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1016\/j.orl.2003.12.007","volume":"32","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., Pachamanova, D., Sim, M.: Robust linear optimization under general norms. Operations Research Letters 32(6), 510\u2013516 (2004)","journal-title":"Operations Research Letters"},{"issue":"1","key":"2015_CR8","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., Sim, M.: The price of robustness. Operat. Res. 52(1), 35\u201353 (2004)","journal-title":"Operat. Res."},{"issue":"3","key":"2015_CR9","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1137\/130910312","volume":"56","author":"D Bienstock","year":"2014","unstructured":"Bienstock, D., Chertkov, M., Harnett, S.: Chance-constrained optimal power flow: risk-aware network control under uncertainty. SIAM Rev 56(3), 461\u2013495 (2014)","journal-title":"SIAM Rev"},{"key":"2015_CR10","unstructured":"Daniel, B., Gonzalo, M.: LP approximations to mixed-integer polynomial optimization problems. (2016). arXiv:1501.00288"},{"issue":"1","key":"2015_CR11","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1109\/TPWRS.2015.2395452","volume":"31","author":"S Bolognani","year":"2016","unstructured":"Bolognani, S., Zampieri, Sandro: On the existence and linear approximation of the power flow solution in power distribution networks. IEEE Trans. Power Sys. 31(1), 163\u2013172 (2016)","journal-title":"IEEE Trans. Power Sys."},{"issue":"11","key":"2015_CR12","doi-asserted-by":"publisher","first-page":"1725","DOI":"10.1016\/j.aml.2012.01.046","volume":"25","author":"F Chazal","year":"2012","unstructured":"Chazal, F., Skraba, P., Patel, Amit: Computing well diagrams for vector fields on $$\\mathbb{R} ^n$$. Appl. Math. Lett. 25(11), 1725\u20131728 (2012)","journal-title":"Appl. Math. Lett."},{"key":"2015_CR13","unstructured":"Carleton, C., Dan G., Paul S.: NESTA, The NICTA energy system test case archive. (2019). arXiv:1411.0359"},{"key":"2015_CR14","doi-asserted-by":"crossref","unstructured":"Coffrin, C., H.L Hijazi, Van\u00a0Hentenryck, P.: Strengthening convex relaxations with bound tightening for power network optimization. In International conference on principles and practice of constraint programming, pp 39\u201357. Springer, Berlin (2015)","DOI":"10.1007\/978-3-319-23219-5_4"},{"issue":"1","key":"2015_CR15","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1109\/LCSYS.2017.2721380","volume":"2","author":"K Dvijotham","year":"2018","unstructured":"Dvijotham, K., Nguyen, H., Turitsyn, K.: Solvability regions of affinely parameterized quadratic equations. IEEE Contr. Syst. Lett. 2(1), 25\u201330 (2018)","journal-title":"IEEE Contr. Syst. Lett."},{"issue":"3","key":"2015_CR16","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s10208-011-9090-8","volume":"11","author":"H Edelsbrunner","year":"2011","unstructured":"Edelsbrunner, H., Morozov, D., Patel, A.: Quantifying transversality by measuring the robustness of intersections. Found. Comput. Math. 11(3), 345\u2013361 (2011)","journal-title":"Found. Comput. Math."},{"key":"2015_CR17","volume-title":"Degree theory in analysis and applications","author":"F Irene","year":"1995","unstructured":"Irene, F., Wilfrid, G.: Degree theory in analysis and applications, vol. 2. Oxford University Press, Oxford (1995)"},{"issue":"4","key":"2015_CR18","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1145\/2751524","volume":"62","author":"P Franek","year":"2015","unstructured":"Franek, P., Kr\u010d\u00e1l, M.: Robust satisfiability of systems of equations. J. ACM 62(4), 261\u20132619 (2015)","journal-title":"J. ACM"},{"issue":"1","key":"2015_CR19","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/s00454-016-9794-2","volume":"56","author":"P Franek","year":"2016","unstructured":"Franek, P., Kr\u010d\u00e1l, Marek: On computability and triviality of well groups. Discr. Comput. Geometry 56(1), 126\u2013164 (2016)","journal-title":"Discr. Comput. Geometry"},{"key":"2015_CR20","unstructured":"Franek, P., Kr\u010d\u00e1l, M.: Persistence of zero sets. (2016). Preprint available at arXiv:1507.04310"},{"key":"2015_CR21","unstructured":"Franek, P., Kr\u010d\u00e1l, M., Wagner, H.: Robustness of zero sets: Implementation. (2016). Preprint available at http:\/\/www.cs.cas.cz\/~franek\/rob-sat\/experimental.pdf"},{"key":"2015_CR22","doi-asserted-by":"publisher","first-page":"1265","DOI":"10.1090\/S0025-5718-2014-02877-9","volume":"84","author":"P Franek","year":"2015","unstructured":"Franek, P., Ratschan, S.: Effective topological degree computation based on interval arithmetic. Math. Comput. 84, 1265\u20131290 (2015)","journal-title":"Math. Comput."},{"key":"2015_CR23","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1016\/j.cam.2005.07.030","volume":"199","author":"A Frommer","year":"2007","unstructured":"Frommer, A., Hoxha, F., Lang, B.: Proving the existence of zeros using the topological degree and interval arithmetic. J. Comput. Appl. Math. 199, 397\u2013402 (2007)","journal-title":"J. Comput. Appl. Math."},{"issue":"3","key":"2015_CR24","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1137\/S0036142903438148","volume":"43","author":"A Frommer","year":"2005","unstructured":"Frommer, A., Lang, B.: Existence tests for solutions of nonlinear equations using Borsuk\u2019s theorem. SIAM J. Numer. Anal. 43(3), 1348\u20131361 (2005)","journal-title":"SIAM J. Numer. Anal."},{"issue":"621\u2013645","key":"2015_CR25","first-page":"12","volume":"34","author":"A Griewank","year":"2014","unstructured":"Griewank, A.: On automatic differentiation and algorithmic linearization. Pesquisa Operacional 34(621\u2013645), 12 (2014)","journal-title":"Pesquisa Operacional"},{"issue":"6","key":"2015_CR26","doi-asserted-by":"publisher","first-page":"1177","DOI":"10.1287\/opre.2016.1489","volume":"64","author":"B Kocuk","year":"2016","unstructured":"Kocuk, B., Dey, S.S., Sun, A.X.: Strong SOCP relaxations for the optimal power flow problem. Operat. Res. 64(6), 1177\u20131196 (2016)","journal-title":"Operat. Res."},{"issue":"1\u20132","key":"2015_CR27","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s10107-005-0687-z","volume":"107","author":"JB Lasserre","year":"2006","unstructured":"Lasserre, J.B.: Robust global optimization with polynomials. Math. Program. 107(1\u20132), 275\u2013293 (2006)","journal-title":"Math. Program."},{"key":"2015_CR28","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10898-010-9628-3","volume":"51","author":"JB Lasserre","year":"2011","unstructured":"Lasserre, J.B.: Min-max and robust polynomial optimization. J. Global Optimiz. 51, 1\u201310 (2011)","journal-title":"J. Global Optimiz."},{"key":"2015_CR29","doi-asserted-by":"crossref","unstructured":"Lotfi, R., Kargar, B., Gharehbaghi, A., Afshar, M., Sadra Rajabi, M., Mardani, N.: A data-driven robust optimization for multi-objective renewable energy location by considering risk. Environ., Develop. Sustain., pp. 1\u201322 (2022)","DOI":"10.1007\/s10668-022-02448-7"},{"issue":"2","key":"2015_CR30","first-page":"631","volume":"41","author":"S Marde\u0161i\u0107","year":"1973","unstructured":"Marde\u0161i\u0107, S.: Compact subsets of $$\\mathbb{R} ^n$$ and dimension of their projections. Proceed. Am. Math. Soci. 41(2), 631\u2013633 (1973)","journal-title":"Proceed. Am. Math. Soci."},{"key":"2015_CR31","doi-asserted-by":"crossref","unstructured":"Johanna\u00a0L Mathieu, Duncan\u00a0S Callaway, and Sila Kiliccote. Examining uncertainty in demand response baseline models and variability in automated responses to dynamic pricing. In Decision and control and european control conference (CDC-ECC), 2011 50th IEEE conference on IEEE, pp. 4332\u20134339 (2011)","DOI":"10.1109\/CDC.2011.6160628"},{"issue":"4","key":"2015_CR32","doi-asserted-by":"publisher","first-page":"1594","DOI":"10.1109\/TPWRS.2007.907515","volume":"22","author":"JM Morales","year":"2007","unstructured":"Morales, J.M., Perez-Ruiz, J.: Point estimate schemes to solve the probabilistic power flow. IEEE Trans. Power Sys. 22(4), 1594\u20131601 (2007)","journal-title":"IEEE Trans. Power Sys."},{"issue":"2","key":"2015_CR33","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1006\/jcom.2001.0636","volume":"18","author":"B Mourrain","year":"2002","unstructured":"Mourrain, B., Vrahatis, M.N., Yakoubsohn, J.C.: On the complexity of isolating real roots and computing with certainty the topological degree. J. Compl. 18(2), 612\u2013640 (2002)","journal-title":"J. Compl."},{"key":"2015_CR34","volume-title":"Topological degree theory and applications","author":"D O\u2019Regan","year":"2006","unstructured":"O\u2019Regan, D., Cho, Y.J., Chen, Y.Q.: Topological degree theory and applications, vol. 10. Chapman and Hall\/CRC, Boca Raton (2006)"},{"key":"2015_CR35","unstructured":"Park, J., Boyd, S.: General heuristics for nonconvex quadratically constrained quadratic programming. (2017 ) arXiv:1703.07870"},{"key":"2015_CR36","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.ijepes.2015.02.012","volume":"72","author":"L Roald","year":"2015","unstructured":"Roald, L., Vrakopoulou, M., Oldewurtel, F., Andersson, G.: Risk-based optimal power flow with probabilistic guarantees. Int. J. Electr. Power Energy Syst. 72, 66\u201374 (2015)","journal-title":"Int. J. Electr. Power Energy Syst."},{"key":"2015_CR37","doi-asserted-by":"crossref","unstructured":"Taylor, J.A., Mathieu, J.L.: Uncertainty in demand response-identification, estimation, and learning. In: The Operations research revolution, pp. 56\u201370. INFORMS, (2015)","DOI":"10.1287\/educ.2015.0137"},{"key":"2015_CR38","doi-asserted-by":"crossref","unstructured":"Tseng, S.H., Bitar, E., Ao\u00a0Tang. (2016) Random convex approximations of ambiguous chance constrained programs. In 2016 IEEE 55th Conference on Decision and Control (CDC), pp 6210\u20136215","DOI":"10.1109\/CDC.2016.7799224"},{"issue":"1","key":"2015_CR39","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L Vandenberghe","year":"1996","unstructured":"Vandenberghe, L., Boyd, S.: Semidefinite programming. SIAM Rev. 38(1), 49\u201395 (1996)","journal-title":"SIAM Rev."},{"issue":"4","key":"2015_CR40","doi-asserted-by":"publisher","first-page":"3319","DOI":"10.1109\/TPWRS.2016.2623979","volume":"32","author":"C Wang","year":"2017","unstructured":"Wang, C., Bernstein, A., Le Boudec, J.Y., Paolone, M.: Existence and uniqueness of load-flow solutions in three-phase distribution networks. IEEE Trans. Power Syst. 32(4), 3319\u20133320 (2017)","journal-title":"IEEE Trans. Power Syst."},{"issue":"2","key":"2015_CR41","doi-asserted-by":"publisher","first-page":"953","DOI":"10.1109\/TSG.2016.2572060","volume":"9","author":"C Wang","year":"2018","unstructured":"Wang, C., Bernstein, A., Le Boudec, J.Y., Paolone, M.: Explicit conditions on existence and uniqueness of load-flow solutions in distribution networks. IEEE Trans. Smart Grid 9(2), 953\u2013962 (2018)","journal-title":"IEEE Trans. Smart Grid"},{"issue":"3","key":"2015_CR42","doi-asserted-by":"publisher","first-page":"1341","DOI":"10.1109\/59.207353","volume":"7","author":"Z Wang","year":"1992","unstructured":"Wang, Z., Alvarado, F.L.: Interval arithmetic in power flow analysis. IEEE Trans. Power Syst. 7(3), 1341\u20131349 (1992)","journal-title":"IEEE Trans. Power Syst."},{"issue":"4","key":"2015_CR43","doi-asserted-by":"publisher","first-page":"2417","DOI":"10.1109\/TPWRS.2011.2154367","volume":"26","author":"H Zhang","year":"2011","unstructured":"Zhang, H., Li, P.: Chance constrained programming for optimal power flow under uncertainty. IEEE Trans. Power Syst. 26(4), 2417\u20132424 (2011)","journal-title":"IEEE Trans. Power Syst."},{"issue":"1","key":"2015_CR44","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1109\/TPWRS.2010.2051168","volume":"26","author":"RD Zimmerman","year":"2011","unstructured":"Zimmerman, R.D., Murillo-Sanchez, C.E., Thomas, R.J.: Matpower: steady-state operations, planning, and analysis tools for power systems research and education. IEEE Trans. Power Sys. 26(1), 12\u201319 (2011)","journal-title":"IEEE Trans. Power Sys."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-02015-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-023-02015-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-023-02015-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,2]],"date-time":"2024-03-02T15:05:42Z","timestamp":1709391942000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-023-02015-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,22]]},"references-count":44,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["2015"],"URL":"https:\/\/doi.org\/10.1007\/s11590-023-02015-7","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2023,5,22]]},"assertion":[{"value":"22 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 May 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 May 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}