{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T05:40:11Z","timestamp":1750830011434,"version":"3.41.0"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319663197"},{"type":"electronic","value":"9783319663203"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-66320-3_27","type":"book-chapter","created":{"date-parts":[[2017,8,29]],"date-time":"2017-08-29T11:34:27Z","timestamp":1504006467000},"page":"377-391","source":"Crossref","is-referenced-by-count":4,"title":["Penalty Function Based Critical Point Approach to Compute Real Witness Solution Points of Polynomial Systems"],"prefix":"10.1007","author":[{"given":"Wenyuan","family":"Wu","sequence":"first","affiliation":[]},{"given":"Changbo","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Greg","family":"Reid","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,30]]},"reference":[{"issue":"6","key":"27_CR1","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1006\/jsco.2002.0563","volume":"34","author":"P Aubry","year":"2002","unstructured":"Aubry, P., Rouillier, F., El Din, M.S.: Real solving for positive dimensional systems. J. Symb. Comput. 34(6), 543\u2013560 (2002)","journal-title":"J. Symb. Comput."},{"key":"27_CR2","series-title":"Algorithms and Computation in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-33099-2","volume-title":"Algorithms in Real Algebraic Geometry","author":"S Basu","year":"2006","unstructured":"Basu, S., Pollack, R., Roy, M.-F.: Algorithms in Real Algebraic Geometry. Algorithms and Computation in Mathematics, vol. 10, 2nd edn. Springer, Heidelberg (2006). doi: 10.1007\/3-540-33099-2","edition":"2"},{"issue":"4","key":"27_CR3","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1007\/s11075-012-9646-y","volume":"63","author":"GM Besana","year":"2013","unstructured":"Besana, G.M., DiRocco, S., Hauenstein, J.D., Sommese, A.J., Wampler, C.W.: Cell decomposition of almost smooth real algebraic surfaces. Numer. Algorithms 63(4), 645\u2013678 (2013)","journal-title":"Numer. Algorithms"},{"key":"27_CR4","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971484","volume-title":"Numerical Methods for Least Squares Problems","author":"A Bjorck","year":"1996","unstructured":"Bjorck, A.: Numerical Methods for Least Squares Problems. SIAM, Philadelphia (1996)"},{"issue":"286","key":"27_CR5","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1090\/S0025-5718-2013-02766-4","volume":"83","author":"B Bank","year":"2014","unstructured":"Bank, B., Giusti, M., Heintz, J.: Point searching in real singular complete intersection varieties - algorithms of intrinsic complexity. Math. Comput. 83(286), 873\u2013897 (2014)","journal-title":"Math. Comput."},{"key":"27_CR6","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1006\/jcom.1997.0432","volume":"13","author":"B Bank","year":"1997","unstructured":"Bank, B., Giusti, M., Heintz, J., Mbakop, G.-M.: Polar varieties, real equation solving, and data structures: the hypersurface case. J. Complex. 13, 5\u201327 (1997)","journal-title":"J. Complex."},{"key":"27_CR7","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1145\/2930889.2930910","volume":"2016","author":"DA Brake","year":"2016","unstructured":"Brake, D.A., Hauenstein, J.D., Liddell, A.C.: Numerically validating the completeness of the real solution set of a system of polynomial equations. ISSAC 2016, 143\u2013150 (2016)","journal-title":"ISSAC"},{"issue":"2","key":"27_CR8","doi-asserted-by":"crossref","first-page":"722","DOI":"10.1137\/060658862","volume":"46","author":"DJ Bates","year":"2008","unstructured":"Bates, D.J., Hauenstein, J.D., Sommese, A.J., Wampler, C.W.: Adaptive multiprecision path tracking. SIAM J. Numer. Anal. 46(2), 722\u2013746 (2008)","journal-title":"SIAM J. Numer. Anal."},{"key":"27_CR9","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611972702","volume-title":"Numerically Solving Polynomial Systems with the Software Package Bertini","author":"DJ Bates","year":"2013","unstructured":"Bates, D.J., Hauenstein, J.D., Sommese, A.J., Wampler, C.W.: Numerically Solving Polynomial Systems with the Software Package Bertini. SIAM, Philadelphia (2013)"},{"issue":"2","key":"27_CR10","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s10208-013-9143-2","volume":"13","author":"C Beltr\u00e1n","year":"2013","unstructured":"Beltr\u00e1n, C., Leykin, A.: Robust Certified Numerical Homotopy Tracking. Found. Comput. Math. 13(2), 253\u2013295 (2013)","journal-title":"Found. Comput. Math."},{"issue":"6","key":"27_CR11","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.1007\/s10208-014-9212-1","volume":"14","author":"S Basu","year":"2014","unstructured":"Basu, S., Roy, M.-F., El Din, M.S., Schost, \u00c9.: A baby step-giant step roadmap algorithm for general algebraic sets. Found. Comput. Math. 14(6), 1117\u20131172 (2014)","journal-title":"Found. Comput. Math."},{"key":"27_CR12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.jsc.2011.12.014","volume":"49","author":"C Chen","year":"2013","unstructured":"Chen, C., Davenport, J.H., May, J.P., Moreno Maza, M., Xia, B., Xiao, R.: Triangular decomposition of semi-algebraic systems. J. Symb. Comput. 49, 3\u201326 (2013)","journal-title":"J. Symb. Comput."},{"key":"27_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/3-540-07407-4_17","volume-title":"Automata Theory and Formal Languages","author":"GE Collins","year":"1975","unstructured":"Collins, G.E.: Quantifier elimination for real closed fields by cylindrical algebraic decompostion. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol. 33, pp. 134\u2013183. Springer, Heidelberg (1975). doi: 10.1007\/3-540-07407-4_17"},{"key":"27_CR14","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0747-7171(88)80004-X","volume":"5","author":"JH Davenport","year":"1988","unstructured":"Davenport, J.H., Heintz, J.: Real quantifier elimination is doubly exponential. J. Symb. Comp. 5, 29\u201335 (1988)","journal-title":"J. Symb. Comp."},{"issue":"1","key":"27_CR15","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/s10440-012-9782-3","volume":"125","author":"J Hauenstein","year":"2013","unstructured":"Hauenstein, J.: Numerically computing real points on algebraic sets. Acta Appl. Math. 125(1), 105\u2013119 (2013)","journal-title":"Acta Appl. Math."},{"key":"27_CR16","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1016\/j.jsc.2016.07.015","volume":"79","author":"J Hauenstein","year":"2017","unstructured":"Hauenstein, J., Sommese, A.: What is numerical algebraic geometry? J. Symb. Comp. 79, 499\u2013507 (2017). Part 3","journal-title":"J. Symb. Comp."},{"key":"27_CR17","unstructured":"Hong, H.: Improvement in CAD-Based Quantifier Elimination. Ph.D. thesis. Ohio State University, Columbus, Ohio (1990)"},{"key":"27_CR18","unstructured":"Li, T.Y., Lee, T.L.: Homotopy method for solving Polynomial Systems software. http:\/\/www.math.msu.edu\/~li\/Software.htm"},{"key":"27_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-21752-9","volume-title":"Introduction to Smooth Manifolds","author":"JM Lee","year":"2003","unstructured":"Lee, J.M.: Introduction to Smooth Manifolds, vol. 218. Springer, Heidelberg (2003). doi: 10.1007\/978-0-387-21752-9"},{"issue":"5","key":"27_CR20","doi-asserted-by":"crossref","first-page":"607","DOI":"10.1007\/s10208-007-9004-y","volume":"8","author":"JB Lasserre","year":"2008","unstructured":"Lasserre, J.B., Laurent, M., Rostalski, P.: Semidefinite characterization and computation of zero-dimensional real radical ideals. Found. Comput. Math. 8(5), 607\u2013647 (2008)","journal-title":"Found. Comput. Math."},{"issue":"27\u201329","key":"27_CR21","doi-asserted-by":"crossref","first-page":"2685","DOI":"10.1016\/j.tcs.2009.03.024","volume":"410","author":"JB Lasserre","year":"2009","unstructured":"Lasserre, J.B., Laurent, M., Rostalski, P.: A prolongation-projection algorithm for computing the finite real variety of an ideal. Theoret. Comput. Sci. 410(27\u201329), 2685\u20132700 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR22","unstructured":"Lu, Y.: Finding all real solutions of polynomial systems. Ph.D thesis. University of Notre Dame (2006). Results of this thesis appear. In: (with Bates, D.J., Sommese, A.J., Wampler, C.W.), Finding all real points of a complex curve, Contemp. Math. vol. 448, pp. 183\u2013205 (2006)"},{"key":"27_CR23","doi-asserted-by":"crossref","unstructured":"Ma, Y., Zhi, L.: Computing Real Solutions of Polynomial Systems via Low-rank Moment Matrix Completion. In: ISSAC, pp. 249\u2013256 (2012)","DOI":"10.1145\/2442829.2442866"},{"issue":"4","key":"27_CR24","doi-asserted-by":"crossref","first-page":"716","DOI":"10.1006\/jcom.2000.0563","volume":"16","author":"F Rouillier","year":"2000","unstructured":"Rouillier, F., Roy, M.-F., El Din, M.S.: Finding at least one point in each connected component of a real algebraic set defined by a single equation. J. Complex. 16(4), 716\u2013750 (2000)","journal-title":"J. Complex."},{"key":"27_CR25","doi-asserted-by":"crossref","unstructured":"El Din, M.S., Schost, \u00c9.: Polar varieties and computation of one point in each connected component of a smooth real algebraic set. In: ISSAC 2013, pp. 224\u2013231 (2003)","DOI":"10.1145\/860854.860901"},{"issue":"3","key":"27_CR26","first-page":"417","volume":"32","author":"MS Din El","year":"2004","unstructured":"El Din, M.S., Schost, \u00c9.: Properness defects of projection functions and computation of at least one point in each connected component of a real algebraic set. J. Discrete Comput. Geom. 32(3), 417\u2013430 (2004)","journal-title":"J. Discrete Comput. Geom."},{"key":"27_CR27","doi-asserted-by":"crossref","unstructured":"Sommese, A.J., Wampler, C.W.: The Numerical Solution of Systems of Polynomials Arising in Engineering and Science. World Scientific Press (2005)","DOI":"10.1142\/5763"},{"key":"27_CR28","unstructured":"Stewart, G.W.: Perturbation theory for the singular value decomposition. In: SVD and Signal processing, II: Algorithms, Analysis and Applications, pp. 99\u2013109. Elsevier (1990)"},{"key":"27_CR29","series-title":"Algorithms and Computation in Mathematics","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/3-540-27357-3_8","volume-title":"Solving Polynomial Equations","author":"AJ Sommese","year":"2005","unstructured":"Sommese, A.J., Verschelde, J., Wampler, C.W.: Introduction to numerical algebraic geometry. In: Bronstein, M., et al. (eds.) Solving Polynomial Equations. AACIM, vol. 14, pp. 339\u2013392. Springer, Heidelberg (2005). doi: 10.1007\/3-540-27357-3_8"},{"key":"27_CR30","volume-title":"Lectures on Differential Geometry","author":"S Sternberg","year":"1964","unstructured":"Sternberg, S.: Lectures on Differential Geometry. Prentice-Hall, Englewood Cliffs (1964)"},{"key":"27_CR31","doi-asserted-by":"crossref","unstructured":"Wu, W., Reid, G.: Finding points on real solution components and applications to differential polynomial systems. In: ISSAC, pp. 339\u2013346 (2013)","DOI":"10.1145\/2465506.2465954"},{"key":"27_CR32","doi-asserted-by":"crossref","unstructured":"Wu, W., Reid, G., Feng, Y.: Computing real witness points of positive dimensional polynomial systems. Accepted by Theoretical Computer Sciences (2017). http:\/\/doi.org\/10.1016\/j.tcs.2017.03.035","DOI":"10.1016\/j.tcs.2017.03.035"},{"key":"27_CR33","doi-asserted-by":"crossref","unstructured":"Yang, Z., Zhi, L., Zhu, Y.: Verified error bounds for real solutions of positive-dimensional polynomial systems. In: ISSAC, pp. 371\u2013378 (2013)","DOI":"10.1145\/2465506.2465951"}],"container-title":["Lecture Notes in Computer Science","Computer Algebra in Scientific Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66320-3_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T05:11:50Z","timestamp":1750828310000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-66320-3_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319663197","9783319663203"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66320-3_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}