{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T20:44:15Z","timestamp":1777668255819,"version":"3.51.4"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,10,15]],"date-time":"2014-10-15T00:00:00Z","timestamp":1413331200000},"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":["Math. Program."],"published-print":{"date-parts":[[2015,7]]},"DOI":"10.1007\/s10107-014-0825-6","type":"journal-article","created":{"date-parts":[[2014,10,14]],"date-time":"2014-10-14T02:18:02Z","timestamp":1413253082000},"page":"433-457","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["An alternative proof of a PTAS for fixed-degree polynomial optimization over the simplex"],"prefix":"10.1007","volume":"151","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"}]}],"member":"297","published-online":{"date-parts":[[2014,10,15]]},"reference":[{"key":"825_CR1","doi-asserted-by":"crossref","DOI":"10.1515\/9783110884586","volume-title":"Korovkin-type approximation theory and its applications. De Guyter studies in mathematics","author":"F Altomare","year":"1994","unstructured":"Altomare, F., Campiti, M.: Korovkin-type approximation theory and its applications. De Guyter studies in mathematics, vol. 17. Walter de Guyter publishers, Berlin (1994)"},{"key":"825_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, 429\u2013441 (1995)","journal-title":"Math. Program."},{"issue":"2","key":"825_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."},{"key":"825_CR4","doi-asserted-by":"crossref","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)","DOI":"10.1007\/s10898-013-0126-2"},{"key":"825_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"},{"issue":"2","key":"825_CR6","doi-asserted-by":"crossref","first-page":"293","DOI":"10.2140\/pjm.1986.121.293","volume":"121","author":"Z Ditzian","year":"1986","unstructured":"Ditzian, Z.: Inverse theorems for multidimensional Bernstein operators. Pac. J. Math. 121(2), 293\u2013319 (1986)","journal-title":"Pac. J. Math."},{"key":"825_CR7","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S1385-7258(89)80002-2","volume":"92","author":"Z Ditzian","year":"1989","unstructured":"Ditzian, Z.: Best polynomial approximation and Bernstein polynomial approximation on a simplex. Indag. Math. 92, 243\u2013256 (1989)","journal-title":"Indag. Math."},{"key":"825_CR8","doi-asserted-by":"crossref","first-page":"93","DOI":"10.2140\/pjm.1993.158.93","volume":"158","author":"Z Ditzian","year":"1993","unstructured":"Ditzian, Z., Zhou, X.: Optimal approximation class for multivariate Bernstein operators. Pac. J. Math. 158, 93\u2013120 (1993)","journal-title":"Pac. J. Math."},{"key":"825_CR9","volume-title":"Discrete Multivariate Distributions","author":"NL Johnson","year":"1997","unstructured":"Johnson, N.L., Kotz, S., Balakrishnan, N.: Discrete Multivariate Distributions. Wiley, New York (1997)"},{"issue":"3","key":"825_CR10","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1016\/j.ejor.2007.01.055","volume":"191","author":"E Klerk de","year":"2008","unstructured":"de Klerk, E., den Hertog, D., Elabwabi, G.: On the complexity of optimization over the standard simplex. Eur. J. Oper. Res. 191(3), 773\u2013785 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"2\u20133","key":"825_CR11","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. Theor. Comput. Sci. 361(2\u20133), 210\u2013225 (2006)","journal-title":"Theor. Comput. Sci."},{"issue":"6","key":"825_CR12","doi-asserted-by":"crossref","first-page":"3104","DOI":"10.1137\/100790835","volume":"20","author":"E Klerk de","year":"2010","unstructured":"de Klerk, E., Laurent, M.: Error bounds for some semidefinite programming approaches to polynomial minimization over the hypercube. SIAM J. Optim. 20(6), 3104\u20133120 (2010)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"825_CR13","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1137\/070700024","volume":"69","author":"A Knoblauch","year":"2008","unstructured":"Knoblauch, A.: Closed-form expressions for the moments of the binomial probability distribution. SIAM J. Appl. Math. 69(1), 197\u2013204 (2008)","journal-title":"SIAM J. Appl. Math."},{"key":"825_CR14","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"JB Lasserre","year":"2001","unstructured":"Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11, 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"key":"825_CR15","doi-asserted-by":"crossref","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"TS Motzkin","year":"1965","unstructured":"Motzkin, T.S., Straus, E.G.: Maxima for graphs and a new proof of a theorem of T\u00faran. Can. J. Math. 17, 533\u2013540 (1965)","journal-title":"Can. J. Math."},{"key":"825_CR16","unstructured":"Nesterov, Y.: Random Walk in a Simplex and Quadratic Optimization over Convex Polytopes. CORE Discussion Paper 2003\/71, CORE-UCL, Louvain-La-Neuve (2003)"},{"key":"825_CR17","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/978-1-4615-4381-7_13","volume-title":"Handbook of Semidefinite Programming","author":"Y Nesterov","year":"2000","unstructured":"Nesterov, Y., Wolkowicz, H., Ye, Y.: Semidefinite programming relaxations of nonconvex quadratic optimization. In: Wolkowicz, H., Saigal, R., Vandenberghe, L. (eds.) Handbook of Semidefinite Programming, pp. 361\u2013419. Kluwer Academic Publishers, Norwell (2000)"},{"key":"825_CR18","unstructured":"Sagol, G., Yildirim, E.A.: Analysis of Copositive Optimization Based Bounds on Standard Quadratic Optimization. Technical Report. Department of Industrial Engineering, Koc University, Sariyer, Istanbul, Turkey (2013)"},{"key":"825_CR19","first-page":"3","volume-title":"Recent Advances in Global Optimization","author":"S Vavasis","year":"1998","unstructured":"Vavasis, S.: Approximation algorithms for concave quadratic programming. In: Floudas, C.A., Pardalos, P. (eds.) Recent Advances in Global Optimization, pp. 3\u201318. Princeton University Press, Princeton (1998)"},{"issue":"1","key":"825_CR20","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1080\/10556788.2010.540014","volume":"27","author":"EA Yildirim","year":"2012","unstructured":"Yildirim, E.A.: On the accuracy of uniform polyhedral approximations of the copositive cone. Optim. Methods Softw. 27(1), 155\u2013173 (2012)","journal-title":"Optim. Methods Softw."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0825-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-014-0825-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-014-0825-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:00:06Z","timestamp":1559124006000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-014-0825-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,10,15]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,7]]}},"alternative-id":["825"],"URL":"https:\/\/doi.org\/10.1007\/s10107-014-0825-6","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,10,15]]}}}