{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:46:23Z","timestamp":1740123983309,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2019,3,25]],"date-time":"2019-03-25T00:00:00Z","timestamp":1553472000000},"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,9]]},"DOI":"10.1007\/s10957-019-01508-9","type":"journal-article","created":{"date-parts":[[2019,3,25]],"date-time":"2019-03-25T12:02:46Z","timestamp":1553515366000},"page":"935-946","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Whitney\u2019s Theorem, Triangular Sets, and Probabilistic Descent on Manifolds"],"prefix":"10.1007","volume":"182","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8441-0669","authenticated-orcid":false,"given":"David W.","family":"Dreisigmeyer","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,3,25]]},"reference":[{"issue":"2","key":"1508_CR1","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1006\/jsco.1993.1011","volume":"15","author":"M Kalkbrener","year":"1993","unstructured":"Kalkbrener, M.: A generalized euclidean algorithm for computing triangular representations of algebraic varieties. J. Symb. Comput. 15(2), 143\u2013167 (1993)","journal-title":"J. Symb. Comput."},{"key":"1508_CR2","series-title":"Graduate Texts in Mathematics","volume-title":"Differential Topology","author":"MW Hirsch","year":"1997","unstructured":"Hirsch, M.W.: Differential Topology. Graduate Texts in Mathematics. Springer, New York (1997)"},{"key":"1508_CR3","doi-asserted-by":"crossref","unstructured":"Chen, C., Davenport, J.H., Moreno\u00a0Maza, M., Xia, B., Xiao, R.: Computing with semi-algebraic sets represented by triangular decomposition. In: Proceedings of the 36th International Symposium on Symbolic and Algebraic Computation, pp. 75\u201382 (2011)","DOI":"10.1145\/1993886.1993903"},{"key":"1508_CR4","doi-asserted-by":"publisher","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., Maza, M.M., Xia, B., Xiao, R.: Triangular decomposition of semi-algebraic systems. J. Symb. Comput. 49, 3\u201326 (2013)","journal-title":"J. Symb. Comput."},{"issue":"1","key":"1508_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1006\/jsco.1999.0270","volume":"28","author":"P Aubry","year":"1999","unstructured":"Aubry, P., Maza, M.M.: Triangular sets for solving polynomial systems: a comparative implementation of four methods. J. Symb. Comput. 28(1), 125\u2013154 (1999)","journal-title":"J. Symb. Comput."},{"issue":"6","key":"1508_CR6","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1016\/j.jsc.2011.12.023","volume":"47","author":"C Chen","year":"2012","unstructured":"Chen, C., Maza, M.M.: Algorithms for computing triangular decomposition of polynomial systems. J. Symb. Comput. 47(6), 610\u2013642 (2012)","journal-title":"J. Symb. Comput."},{"issue":"1","key":"1508_CR7","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1006\/jsco.1999.0269","volume":"28","author":"P Aubry","year":"1999","unstructured":"Aubry, P., Lazard, D., Maza, M.M.: On the theories of triangular sets. J. Symb. Comput. 28(1), 105\u2013124 (1999)","journal-title":"J. Symb. Comput."},{"key":"1508_CR8","unstructured":"Cox, D.A., Little, J., O\u2019Shea, D.: Ideals, Varieties, and Algorithms, 4th edn. Undergraduate Texts in Mathematics. Springer, New York (2015)"},{"issue":"2","key":"1508_CR9","doi-asserted-by":"publisher","first-page":"322","DOI":"10.1137\/0722020","volume":"22","author":"EL Allgower","year":"1985","unstructured":"Allgower, E.L., Schmidt, P.H.: An algorithm for piecewise-linear approximation of an implicitly defined manifold. SIAM J. Numer. Anal. 22(2), 322\u2013346 (1985)","journal-title":"SIAM J. Numer. Anal."},{"issue":"1","key":"1508_CR10","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0377-0427(00)00427-1","volume":"124","author":"EL Allgower","year":"2000","unstructured":"Allgower, E.L., Georg, K.: Piecewise linear methods for nonlinear equations and optimization. J. Comput. Appl. Math. 124(1), 245\u2013261 (2000)","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"1508_CR11","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0377-0427(00)00428-3","volume":"124","author":"WC Rheinboldt","year":"2000","unstructured":"Rheinboldt, W.C.: Numerical continuation methods: a perspective. J. Comput. Appl. Math. 124(1), 229\u2013244 (2000)","journal-title":"J. Comput. Appl. Math."},{"key":"1508_CR12","unstructured":"Dreisigmeyer, D.W.: Equality constraints, Riemannian manifolds and direct search methods (2006). \n                    http:\/\/www.optimization-online.org\/DB_HTML\/2007\/08\/1743.html"},{"issue":"6","key":"1508_CR13","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1016\/S0898-1221(98)00164-3","volume":"36","author":"M Brodzik","year":"1998","unstructured":"Brodzik, M.: The computation of simplicial approximations of implicitly defined p-dimensional manifolds. Comput. Math. Appl. 36(6), 93\u2013113 (1998)","journal-title":"Comput. Math. Appl."},{"issue":"3","key":"1508_CR14","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1137\/140961602","volume":"25","author":"S Gratton","year":"2015","unstructured":"Gratton, S., Royer, C.W., Vicente, L.N., Zhang, Z.: Direct search based on probabilistic descent. SIAM J. Optim. 25(3), 1515\u20131541 (2015)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1508_CR15","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1137\/040603371","volume":"17","author":"C Audet","year":"2006","unstructured":"Audet, C., Dennis Jr., J\u00a0.E.: Mesh adaptive direct search algorithms for constrained optimization. SIAM J. Optim. 17(1), 188\u2013217 (2006)","journal-title":"SIAM J. Optim."}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-019-01508-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-019-01508-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-019-01508-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T00:08:26Z","timestamp":1585008506000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-019-01508-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,25]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["1508"],"URL":"https:\/\/doi.org\/10.1007\/s10957-019-01508-9","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2019,3,25]]},"assertion":[{"value":"17 October 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 March 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}