{"id":"https://openalex.org/W2944874335","doi":"https://doi.org/10.1007/s10107-020-01468-3","title":"Improved convergence analysis of Lasserre\u2019s measure-based upper bounds for polynomial minimization on compact sets","display_name":"Improved convergence analysis of Lasserre\u2019s measure-based upper bounds for polynomial minimization on compact sets","publication_year":2020,"publication_date":"2020-01-25","ids":{"openalex":"https://openalex.org/W2944874335","doi":"https://doi.org/10.1007/s10107-020-01468-3","mag":"2944874335"},"language":"lv","primary_location":{"id":"doi:10.1007/s10107-020-01468-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-020-01468-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-020-01468-3.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s10107-020-01468-3.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Lucas Slot","orcid":null},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832","https://openalex.org/I4405262988"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Lucas Slot","raw_affiliation_strings":["Centrum Wiskunde & Informatica (CWI), Amsterdam, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Centrum Wiskunde & Informatica (CWI), Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I1341640284"]}]},{"author_position":"last","author":{"id":null,"display_name":"Monique Laurent","orcid":"https://orcid.org/0000-0001-8474-2121"},"institutions":[{"id":"https://openalex.org/I1341640284","display_name":"Centrum Wiskunde & Informatica","ror":"https://ror.org/00x7ekv49","country_code":"NL","type":"facility","lineage":["https://openalex.org/I1341640284","https://openalex.org/I2800991832","https://openalex.org/I4405262988"]},{"id":"https://openalex.org/I193700539","display_name":"Tilburg University","ror":"https://ror.org/04b8v1s79","country_code":"NL","type":"education","lineage":["https://openalex.org/I193700539"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Monique Laurent","raw_affiliation_strings":["Centrum Wiskunde & Informatica (CWI), Amsterdam, The Netherlands","Tilburg University, Tilburg, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0001-8474-2121","affiliations":[{"raw_affiliation_string":"Centrum Wiskunde & Informatica (CWI), Amsterdam, The Netherlands","institution_ids":["https://openalex.org/I1341640284"]},{"raw_affiliation_string":"Tilburg University, Tilburg, The Netherlands","institution_ids":["https://openalex.org/I193700539"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I1341640284","https://openalex.org/I193700539"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2190,"currency":"EUR","value_usd":2890},"fwci":3.8098,"has_fulltext":true,"cited_by_count":20,"citation_normalized_percentile":{"value":0.9391676,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"193","issue":"2","first_page":"831","last_page":"871"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11191","display_name":"Mathematical functions and polynomials","score":0.4171999990940094,"subfield":{"id":"https://openalex.org/subfields/2604","display_name":"Applied Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11191","display_name":"Mathematical functions and polynomials","score":0.4171999990940094,"subfield":{"id":"https://openalex.org/subfields/2604","display_name":"Applied Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.17489999532699585,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.047600001096725464,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/compact-space","display_name":"Compact space","score":0.5460000038146973},{"id":"https://openalex.org/keywords/hypercube","display_name":"Hypercube","score":0.5313000082969666},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.5212000012397766},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.512499988079071},{"id":"https://openalex.org/keywords/probability-measure","display_name":"Probability measure","score":0.4666000008583069},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4652999937534332},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.4219000041484833},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4007999897003174},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3716999888420105},{"id":"https://openalex.org/keywords/chebyshev-nodes","display_name":"Chebyshev nodes","score":0.3693000078201294}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.9038000106811523},{"id":"https://openalex.org/C18648836","wikidata":"https://www.wikidata.org/wiki/Q381892","display_name":"Compact space","level":2,"score":0.5460000038146973},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.5313000082969666},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.5212000012397766},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.512499988079071},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46700000762939453},{"id":"https://openalex.org/C21031990","wikidata":"https://www.wikidata.org/wiki/Q355020","display_name":"Probability measure","level":2,"score":0.4666000008583069},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4652999937534332},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.43689998984336853},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.4219000041484833},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4007999897003174},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3840999901294708},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3716999888420105},{"id":"https://openalex.org/C171326582","wikidata":"https://www.wikidata.org/wiki/Q1052508","display_name":"Chebyshev nodes","level":3,"score":0.3693000078201294},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.35109999775886536},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.33500000834465027},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.33230000734329224},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.32739999890327454},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.32510000467300415},{"id":"https://openalex.org/C129785596","wikidata":"https://www.wikidata.org/wiki/Q619511","display_name":"Chebyshev polynomials","level":2,"score":0.3167000114917755},{"id":"https://openalex.org/C21424316","wikidata":"https://www.wikidata.org/wiki/Q718621","display_name":"Chebyshev filter","level":2,"score":0.31349998712539673},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.31189998984336853},{"id":"https://openalex.org/C2777105136","wikidata":"https://www.wikidata.org/wiki/Q827230","display_name":"Lebesgue measure","level":3,"score":0.3070000112056732},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.2994999885559082},{"id":"https://openalex.org/C25878781","wikidata":"https://www.wikidata.org/wiki/Q1473607","display_name":"Degree of a polynomial","level":3,"score":0.2953000068664551},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.2930999994277954},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.2669999897480011},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.2669000029563904},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.26600000262260437},{"id":"https://openalex.org/C95611797","wikidata":"https://www.wikidata.org/wiki/Q17502105","display_name":"Infimum and supremum","level":2,"score":0.265500009059906},{"id":"https://openalex.org/C2780813799","wikidata":"https://www.wikidata.org/wiki/Q3274237","display_name":"Zero (linguistics)","level":2,"score":0.25699999928474426},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25589999556541443}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s10107-020-01468-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-020-01468-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-020-01468-3.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},{"id":"pmh:oai:tilburguniversity.edu:openaire/678accfa-ae60-46d1-a402-28d186bb2cd3","is_oa":true,"landing_page_url":"https://research.tilburguniversity.edu/en/publications/678accfa-ae60-46d1-a402-28d186bb2cd3","pdf_url":null,"source":{"id":"https://openalex.org/S4306401490","display_name":"Research portal (Tilburg University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193700539","host_organization_name":"Tilburg University","host_organization_lineage":["https://openalex.org/I193700539"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Slot, L & Laurent, M 2022, 'Improved convergence analysis of Lasserre's measure-based upper bounds for polynomial minimization on compact sets', Mathematical Programming, vol. 193, no. 2, pp. 831-871. https://doi.org/10.1007/s10107-020-01468-3","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:1905.08142","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1905.08142","pdf_url":"https://arxiv.org/pdf/1905.08142","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:cwi.nl:29377","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/29377","pdf_url":"https://ir.cwi.nl/pub/29377/29416.pdf","source":{"id":"https://openalex.org/S7407055335","display_name":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Mathematical Programming vol. 193, pp. 831-871","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1007/s10107-020-01468-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10107-020-01468-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10107-020-01468-3.pdf","source":{"id":"https://openalex.org/S193920097","display_name":"Mathematical Programming","issn_l":"0025-5610","issn":["0025-5610","1436-4646"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Mathematical Programming","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3374013012","display_name":null,"funder_award_id":"764759","funder_id":"https://openalex.org/F4320335254","funder_display_name":"Horizon 2020"},{"id":"https://openalex.org/G6446765011","display_name":"Mixed-Integer Non-Linear Optimisation Applications","funder_award_id":"764759","funder_id":"https://openalex.org/F4320338337","funder_display_name":"H2020 Marie Sk\u0142odowska-Curie Actions"},{"id":"https://openalex.org/G7955706205","display_name":null,"funder_award_id":"Horizon 2020","funder_id":"https://openalex.org/F4320338337","funder_display_name":"H2020 Marie Sk\u0142odowska-Curie Actions"}],"funders":[{"id":"https://openalex.org/F4320335254","display_name":"Horizon 2020","ror":null},{"id":"https://openalex.org/F4320338337","display_name":"H2020 Marie Sk\u0142odowska-Curie Actions","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2944874335.pdf","grobid_xml":"https://content.openalex.org/works/W2944874335.grobid-xml"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W182881619","https://openalex.org/W567568486","https://openalex.org/W795914245","https://openalex.org/W2020847549","https://openalex.org/W2027470314","https://openalex.org/W2046354702","https://openalex.org/W2060889872","https://openalex.org/W2072273382","https://openalex.org/W2101538582","https://openalex.org/W2120146316","https://openalex.org/W2127130581","https://openalex.org/W2130010995","https://openalex.org/W2327253984","https://openalex.org/W2592668180","https://openalex.org/W2912106686","https://openalex.org/W2921900064","https://openalex.org/W2964069080","https://openalex.org/W2972299727","https://openalex.org/W2972919843","https://openalex.org/W2997618127","https://openalex.org/W4245552223","https://openalex.org/W6700049840"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"We":[1,263],"consider":[2,93],"the":[3,7,97,141,186,207,210,286,376,382],"problem":[4],"of":[5,23,96,143,153,272,282],"computing":[6],"minimum":[8],"value":[9],"$$f_{\\min":[10,169,229],",K}$$":[11,170],"<mml:math":[12,34,59,65,74,103,122,134,157,171,190,213,232,248,316,330,346,366,392,407],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[13,35,60,66,75,104,123,135,158,172,191,214,233,249,317,331,347,367,393,408],"<mml:msub>":[14,77,173,234],"<mml:mi>f</mml:mi>":[15,81,160,174,216,235],"<mml:mrow>":[16,36,40,76,105,161,175,193,217,236,250,318,348,394,409],"<mml:mo>min</mml:mo>":[17,176,237],"<mml:mo>,</mml:mo>":[18,177,197,238],"<mml:mi>K</mml:mi>":[19,37,67,79,136,178,239,332,368],"</mml:mrow>":[20,42,45,84,110,165,179,200,221,240,260,326,362,403],"</mml:msub>":[21,80,180,241],"</mml:math>":[22,46,62,68,85,111,125,137,167,181,203,223,242,261,327,333,363,369,404],"a":[24,28,54,116,127,150,244,269,279,302,335,371],"polynomial":[25,118],"f":[26],"over":[27],"compact":[29],"set":[30],"$$K\\subseteq":[31],"{\\mathbb":[32],"{R}}^n$$":[33],"<mml:mo>\u2286</mml:mo>":[38],"<mml:msup>":[39,159,192,215,255,351,357],"<mml:mi>R</mml:mi>":[41],"<mml:mi>n</mml:mi>":[43,201],"</mml:msup>":[44,166,202,222,258,354,360],",":[47,112,204,230],"which":[48],"can":[49],"be":[50],"reformulated":[51],"as":[52],"finding":[53],"probability":[55],"measure":[56,130],"$$\\nu":[57,99],"$$":[58,73,102,121],"<mml:mi>\u03bd</mml:mi>":[61,83,106],"on":[63,132],"$$K$$":[64,133,329,365],"minimizing":[69],"$$\\int":[70],"_Kf":[71],"d\\nu":[72],"<mml:mo>\u222b</mml:mo>":[78],"<mml:mi>d</mml:mi>":[82],".":[86,138,182,262],"Lasserre":[87],"showed":[88],"that":[89,298],"it":[90],"suffices":[91],"to":[92,226,228,268,292],"such":[94],"measures":[95],"form":[98],"=":[100],"q\\mu":[101],"<mml:mo>=</mml:mo>":[107],"<mml:mi>q</mml:mi>":[108],"<mml:mi>\u03bc</mml:mi>":[109,124],"where":[113],"q":[114,144],"is":[115,126,185,370],"sum-of-squares":[117],"and":[119,295,339,405],"$$\\mu":[120],"given":[128],"Borel":[129],"supported":[131],"By":[139],"bounding":[140],"degree":[142],"by":[145],"2":[146],"r":[147,313,343],"one":[148],"gets":[149],"converging":[151],"hierarchy":[152],"upper":[154],"bounds":[155],"$$f^{(r)}$$":[156,212],"<mml:mo>(</mml:mo>":[162,218,252,320,350,396],"<mml:mi>r</mml:mi>":[163,219,256,322,324,355,358,400],"<mml:mo>)</mml:mo>":[164,220,259,325,361,402],"for":[168,278],"When":[183],"K":[184],"hypercube":[187],"$$[-1,":[188],"1]^n$$":[189],"<mml:mo>[</mml:mo>":[194],"<mml:mo>-</mml:mo>":[195],"<mml:mn>1</mml:mn>":[196,198,253,397],"<mml:mo>]</mml:mo>":[199],"equipped":[205,374],"with":[206,375],"Chebyshev":[208],"measure,":[209],"parameters":[211],"are":[224],"known":[225,385],"converge":[227],"K}$$":[231],"at":[243],"rate":[245],"in":[246,311,340,388],"$$O(1/r^2)$$":[247],"<mml:mi>O</mml:mi>":[251,319,349,395,410],"<mml:mo>/</mml:mo>":[254,323,356,398],"<mml:mn>2</mml:mn>":[257,353,359],"extend":[264],"this":[265],"error":[266,309,386],"estimate":[267,310],"wider":[270],"class":[271,281],"convex":[273,296,372],"bodies,":[274],"while":[275],"also":[276],"allowing":[277],"broader":[280],"reference":[283],"measures,":[284],"including":[285],"Lebesgue":[287,377],"measure.":[288,378],"Our":[289],"analysis":[290],"applies":[291],"simplices,":[293],"balls":[294],"bodies":[297],"locally":[299],"look":[300],"like":[301],"ball.":[303],"In":[304],"addition,":[305],"we":[306],"show":[307],"an":[308],"$$O(\\log":[312,341],"/":[314,344,390],"r)$$":[315],"<mml:mo>log</mml:mo>":[321,352],"when":[328,364],"satisfies":[334],"minor":[336],"geometrical":[337],"condition,":[338],"^2":[342],"r^2)$$":[345],"body,":[373],"This":[379],"improves":[380],"upon":[381],"currently":[383],"best":[384],"estimates":[387],"$$O(1":[389],"\\sqrt{r})$$":[391],"<mml:msqrt>":[399],"</mml:msqrt>":[401],"$$O(1/r)$$":[406]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-16T07:32:37.131356","created_date":"2019-05-29T00:00:00"}