{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T08:17:09Z","timestamp":1774685829820,"version":"3.50.1"},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,3,7]],"date-time":"2016-03-07T00:00:00Z","timestamp":1457308800000},"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":["Optim Lett"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s11590-016-1023-7","type":"journal-article","created":{"date-parts":[[2016,3,7]],"date-time":"2016-03-07T12:41:07Z","timestamp":1457354467000},"page":"597-608","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["On the convergence rate of grid search for polynomial optimization over the simplex"],"prefix":"10.1007","volume":"11","author":[{"given":"Etienne","family":"de Klerk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Monique","family":"Laurent","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhao","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan C.","family":"Vera","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,7]]},"reference":[{"issue":"1","key":"1023_CR1","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/0022-0000(80)90046-X","volume":"21","author":"G Ausiello","year":"1980","unstructured":"Ausiello, G., D\u2019Atri, A., Protasi, M.: Structure preserving reductions among convex optimization problems. J. Comput. Syst. Sci. 21(1), 136\u2013153 (1980)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"1023_CR2","first-page":"429","volume":"69","author":"M Bellare","year":"1995","unstructured":"Bellare, M., Rogaway, P.: The complexity of approximating a nonlinear program. Math. Program. 69(1), 429\u2013441 (1995)","journal-title":"Math. Program."},{"issue":"2","key":"1023_CR3","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1023\/A:1020209017701","volume":"24","author":"IM Bomze","year":"2002","unstructured":"Bomze, I.M., De Klerk, E.: Solving standard quadratic optimization problems via semidefinite and copositive programming. J. Global Optim. 24(2), 163\u2013185 (2002)","journal-title":"J. Global Optim."},{"issue":"2\u20133","key":"1023_CR4","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10898-013-0126-2","volume":"59","author":"IM Bomze","year":"2014","unstructured":"Bomze, I.M., Gollowitzer, S., Yildirim, E.A.: Rounding on the standard simplex: Regular grids for global optimization. J. Global Optim. 59(2\u20133), 243\u2013258 (2014)","journal-title":"J. Global Optim."},{"key":"1023_CR5","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0021-9045(83)90140-5","volume":"38","author":"LP Bos","year":"1983","unstructured":"Bos, L.P.: Bounding the Lebesque function for Lagrange interpolation in a simplex. J. Approx. Theory 38, 43\u201359 (1983)","journal-title":"J. Approx. Theory"},{"key":"1023_CR6","doi-asserted-by":"crossref","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)","DOI":"10.1017\/CBO9780511804441"},{"issue":"2\u20133","key":"1023_CR7","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1016\/j.tcs.2006.05.011","volume":"361","author":"E Klerk De","year":"2006","unstructured":"De Klerk, E., Laurent, M., Parrilo, P.: A PTAS for the minimization of polynomials of fixed degree over the simplex. Theoret. Comput. Sci. 361(2\u20133), 210\u2013225 (2006)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"1023_CR8","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/s10107-014-0825-6","volume":"151","author":"E Klerk De","year":"2015","unstructured":"De Klerk, E., Laurent, M., Sun, Z.: An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex. Math. Program. 151(2), 433\u2013457 (2015)","journal-title":"Math. Program."},{"issue":"3","key":"1023_CR9","doi-asserted-by":"crossref","first-page":"1498","DOI":"10.1137\/140976650","volume":"25","author":"E Klerk De","year":"2015","unstructured":"De Klerk, E., Laurent, M., Sun, Z.: An error analysis for polynomial optimization over the simplex based on the multivariate hypergeometric distribution. SIAM J. Optim. 25(3), 1498\u20131514 (2015)","journal-title":"SIAM J. Optim."},{"key":"1023_CR10","doi-asserted-by":"crossref","unstructured":"Faybusovich, L.: Global optimization of homogeneous polynomials on the simplex and on the sphere. In: Floudas, C., Pardalos, P. (eds.) Frontiers in Global Optimization, pp. 109\u2013121. Kluwer Academic Publishers, Boston (2004)","DOI":"10.1007\/978-1-4613-0251-3_6"},{"key":"1023_CR11","unstructured":"Nesterov, Yu.: Random walk in a simplex and quadratic optimization over convex polytopes. CORE Discussion Paper 2003\/71, CORE-UCL (2003)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1023-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-016-1023-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1023-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-016-1023-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:45Z","timestamp":1559409105000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-016-1023-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,7]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["1023"],"URL":"https:\/\/doi.org\/10.1007\/s11590-016-1023-7","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,3,7]]}}}