{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T15:26:50Z","timestamp":1764602810063},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2006,12,16]],"date-time":"2006-12-16T00:00:00Z","timestamp":1166227200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2008,4]]},"DOI":"10.1007\/s10898-006-9119-8","type":"journal-article","created":{"date-parts":[[2006,12,15]],"date-time":"2006-12-15T09:46:31Z","timestamp":1166175991000},"page":"697-718","source":"Crossref","is-referenced-by-count":24,"title":["Global minimization of rational functions and the nearest GCDs"],"prefix":"10.1007","volume":"40","author":[{"given":"Jiawang","family":"Nie","sequence":"first","affiliation":[]},{"given":"James","family":"Demmel","sequence":"additional","affiliation":[]},{"given":"Ming","family":"Gu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,12,16]]},"reference":[{"key":"9119_CR1","doi-asserted-by":"crossref","unstructured":"Arnon, D., McCallum, S.: A polynomial time algorithm for the topological type of a real algebraic curve. J. Symbol. Comput. 5, 213\u2013236","DOI":"10.1016\/S0747-7171(88)80013-0"},{"key":"9119_CR2","doi-asserted-by":"crossref","unstructured":"Brown, W., Traub, J.: On Euclid\u2019s algorithm and the theory of subresultants. J. ACM 18, 505\u2013514","DOI":"10.1145\/321662.321665"},{"key":"9119_CR3","doi-asserted-by":"crossref","unstructured":"Collins, G.: Subresultants and reduced polynomial remainder sequences. J. ACM 14, 128\u2013142","DOI":"10.1145\/321371.321381"},{"key":"9119_CR4","doi-asserted-by":"crossref","first-page":"2825","DOI":"10.1090\/S0002-9947-00-02472-7","volume":"352","author":"R.E. Curto","year":"2000","unstructured":"Curto R.E. and Fialkow L. (2000). The truncated complex K-moment problem. Trans. Amer. Math. Soc. 352: 2825\u20132855","journal-title":"Trans. Amer. Math. Soc."},{"key":"9119_CR5","doi-asserted-by":"crossref","unstructured":"de Klerk, E.: Aspects of Semidefinite Programming: Interior Point Algorithms and Selected Applications. Applied Optimization Series, vol. 65, 300\u00a0pp. Kluwer Academic Publishers, (2002)","DOI":"10.1007\/b105286"},{"key":"9119_CR6","volume-title":"Positive Polynomials, Monographs in Mathematics","author":"C. Delzell","year":"2001","unstructured":"Delzell C. and Prestel A. (2001). Positive Polynomials, Monographs in Mathematics. Springer, Berlin"},{"key":"9119_CR7","unstructured":"Garey, M., Johnson, D.: Computers and Intractability: A guide to the theory of NP-completeness. W.H. Freeman, and Company, New York (1979)"},{"key":"9119_CR8","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1145\/779359.779363","volume":"29","author":"D. Henrion","year":"2003","unstructured":"Henrion D. and Lasserre J. (2003). GloptiPoly: Global optimization over polynomials with Matlab and SeDuMi. ACM Trans. Math. Soft. 29: 165\u2013194","journal-title":"ACM Trans. Math. Soft."},{"key":"9119_CR9","doi-asserted-by":"crossref","unstructured":"Henrion, D., Lasserre, J.: Detecting global optimality and extracting solutions in GloptiPoly. In: Henrion, D., Garulli, A. (eds.) Positive Polynomials in Control, Lecture Notes on Control and Information Sciences. Springer Verlag, Berlin (2005)","DOI":"10.1007\/10997703_15"},{"issue":"1","key":"9119_CR10","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/s10107-005-0589-0","volume":"106","author":"D. Jibetean","year":"2006","unstructured":"Jibetean D. and de Klerk E. (2006). Global optimization of rational functions: a semidefinite programming approach. Math. Prog. 106(1): 93\u2013109","journal-title":"Math. Prog."},{"key":"9119_CR11","unstructured":"Jibetean, D., Laurent M.: Semidefinite approximations for global unconstrained polynomial optimization. To appear in SIAM J. Optim."},{"key":"9119_CR12","unstructured":"Karmarkar, N., Lakshman, Y.: Approximate polynomial greatest common divisors and nearest singular polynomials. In: Proceedings ISSAC\u201996 (Zurich, Switzerland). ACM Press, New York"},{"key":"9119_CR13","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1006\/jsco.1998.0232","volume":"26","author":"N. Karmarkar","year":"1998","unstructured":"Karmarkar N. and Lakshman Y. (1998). On approximate GCDs of univariate polynomials. J. Symbol. Comput. 26: 653\u2013666","journal-title":"J. Symbol. Comput."},{"issue":"1","key":"9119_CR14","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/s10107-004-0554-3","volume":"103","author":"M. Kojima","year":"2003","unstructured":"Kojima M., Kim S. and Waki H. (2003). Sparsity in sums of squares of polynomials.Math. Program. 103(1): 45\u201362","journal-title":"Math. Program."},{"issue":"3","key":"9119_CR15","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"J. Lasserre","year":"2001","unstructured":"Lasserre J. (2001). Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3): 796\u2013817","journal-title":"SIAM J. Optim."},{"key":"9119_CR16","unstructured":"Laurent, M.: Semidefinite representations for finite varieties. To appear in Math. Prog."},{"key":"9119_CR17","unstructured":"L\u00f6fberg, J.: YALMIP: A MATLAB toolbox for rapid prototyping of optimization problems. Website: http:\/\/control.ee.ethz.ch\/~joloef\/yalmip.php"},{"key":"9119_CR18","doi-asserted-by":"crossref","unstructured":"Manocha D., Demmel J. Algorithms for interesting parametric and implicit curves I: simple intersections. ACM Trans. Graphics. 13, 73\u2013100","DOI":"10.1145\/174462.174617"},{"key":"9119_CR19","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.: Squared functional systems and optimization problems. In: Frenk, H. et\u00a0al. (eds.) High Performance Optimization, pp. 405\u2013440. Kluwer Academic Publishers, Dordrecht (2000)","DOI":"10.1007\/978-1-4757-3216-0_17"},{"key":"9119_CR20","doi-asserted-by":"crossref","unstructured":"Nie, J., Demmel, J.: Shape optimization of transfer functions. In: Hager, W., Pardalos, P., Huang, S. et\u00a0al. (eds.) Multiscale optimization methods and applications, pp. 313\u2013326. Springer series on nonconvex optimization and its application series, Berlin (2005)","DOI":"10.1007\/0-387-29550-X_16"},{"issue":"3","key":"9119_CR21","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1007\/s10107-005-0672-6","volume":"106","author":"J. Nie","year":"2006","unstructured":"Nie J., Demmel J. and Sturmfels B. (2006). Minimizing polynomials via sum of squares over the gradient ideal. Math. Prog. Ser. A 106(3): 587\u2013606","journal-title":"Math. Prog. Ser. A"},{"key":"9119_CR22","unstructured":"Nie, J., Schweighofer, M.: On the complexity of Putinar\u2019s Positivstellensatz. To appear in J. Complexity."},{"key":"9119_CR23","first-page":"83","volume-title":"Proceedings of the DIMACS Workshop on Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science (March 2001)","author":"P. Parrilo","year":"2003","unstructured":"Parrilo P. and Sturmfels B. (2003). Minimizing polynomial functions. In: Basu, S. and Gonzalez-Vega, L. (eds) Proceedings of the DIMACS Workshop on Algorithmic and Quantitative Aspects of Real Algebraic Geometry in Mathematics and Computer Science (March 2001), pp 83\u2013100. American Mathematical Society, Providence RI"},{"issue":"2","key":"9119_CR24","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/s10107-003-0387-5","volume":"96","author":"P. Parrilo","year":"2003","unstructured":"Parrilo P. (2003). Semidefinite programming relaxations for semialgebraic problems. Math. Prog. Ser. B 96(2): 293\u2013320","journal-title":"Math. Prog. Ser. B"},{"key":"9119_CR26","unstructured":"Prajna, S., Papachristodoulou, A., Seiler, P., Parrilo, P.: SOSTOOLS User\u2019s Guide. http:\/\/www.mit.edu\/~parrilo\/SOSTOOLS\/"},{"key":"9119_CR27","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1512\/iumj.1993.42.42045","volume":"42","author":"M. Putinar","year":"1993","unstructured":"Putinar M. (1993). Positive polynomials on compact semi-algebraic sets. Ind. Univ. Math. J. 42: 203\u2013206","journal-title":"Ind. Univ. Math. J."},{"key":"9119_CR28","doi-asserted-by":"crossref","unstructured":"Reznick, B.: Some concrete aspects of Hilbert\u2019s 17th problem. Contemporary Mathematics, vol 253, pp. 251\u2013272. American Mathematical Society, Providence, RI (2000)","DOI":"10.1090\/conm\/253\/03936"},{"key":"9119_CR29","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.: Convex Analysis, 2nd edn. Princeton University Press, Princeton, UJ (1970)","DOI":"10.1515\/9781400873173"},{"key":"9119_CR30","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1016\/j.jalgebra.2005.01.043","volume":"289","author":"C. Scheiderer","year":"2005","unstructured":"Scheiderer C. (2005). Distinguished representations of non-negative polynomials. J. Algebra 289: 558\u2013573","journal-title":"J. Algebra"},{"key":"9119_CR31","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF00121304","volume":"2","author":"H. Sherali","year":"1992","unstructured":"Sherali H. and Tuncbilek C. (1992). A global optimization algorithm for polynomial programming problems using a Reformulation-Linearization Technique. J. Glob. Optim. 2: 101\u2013112","journal-title":"J. Glob. Optim."},{"key":"9119_CR32","first-page":"1","volume":"25","author":"N. Shor","year":"1987","unstructured":"Shor N. (1987). Quadratic optimization problems. Soviet J. Comput. Systems Sci. 25: 1\u201311","journal-title":"Soviet J. Comput. Systems Sci."},{"key":"9119_CR33","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1006\/jcom.1996.0011","volume":"12","author":"G. Stengle","year":"1996","unstructured":"Stengle G. (1996). Complexity estimates for the Schm\u00fcdgen positivstellensatz. J. Complexity 12: 167\u2013174","journal-title":"J. Complexity"},{"key":"9119_CR34","doi-asserted-by":"crossref","unstructured":"Stetter, H.: Numerical Polynomial Algebra. Society of Industrial and Applied Mathematics (2004)","DOI":"10.1137\/1.9780898717976"},{"key":"9119_CR35","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11 & 12","author":"J.F. Sturm","year":"1999","unstructured":"Sturm J.F. (1999). SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim. Method Softw. 11 & 12: 625\u2013653","journal-title":"Optim. Method Softw."},{"key":"9119_CR36","unstructured":"Waki, H., Kim, S., Kojima, M., Muramatsu, M.: Sums of squares and semidefinite programming relaxations for polynomial optimization problems with structured sparsity. To appear in SIAM J. Optim."},{"key":"9119_CR37","doi-asserted-by":"crossref","unstructured":"Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.): Handbook of Semidefinite Programming. Kluwer Academic Publishers, Dordrecht (2000)","DOI":"10.1007\/978-1-4615-4381-7"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-006-9119-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-006-9119-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-006-9119-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T12:12:07Z","timestamp":1559304727000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-006-9119-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,12,16]]},"references-count":36,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,4]]}},"alternative-id":["9119"],"URL":"https:\/\/doi.org\/10.1007\/s10898-006-9119-8","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,12,16]]}}}