{"id":"https://openalex.org/W7164026528","doi":"https://doi.org/10.1145/3798129.3800760","title":"Hesse\u2019s Redemption: Efficient Convex Polynomial Programming","display_name":"Hesse\u2019s Redemption: Efficient Convex Polynomial Programming","publication_year":2026,"publication_date":"2026-06-09","ids":{"openalex":"https://openalex.org/W7164026528","doi":"https://doi.org/10.1145/3798129.3800760"},"language":null,"primary_location":{"id":"doi:10.1145/3798129.3800760","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800760","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3798129.3800760","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085055528","display_name":"Lucas Slot","orcid":"https://orcid.org/0000-0003-3790-492X"},"institutions":[{"id":"https://openalex.org/I4210135670","display_name":"Amsterdam University of the Arts","ror":"https://ror.org/04dde1554","country_code":"NL","type":"education","lineage":["https://openalex.org/I4210135670"]},{"id":"https://openalex.org/I887064364","display_name":"University of Amsterdam","ror":"https://ror.org/04dkp9463","country_code":"NL","type":"education","lineage":["https://openalex.org/I887064364"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Lucas Slot","raw_affiliation_strings":["University of Amsterdam, Amsterdam, Netherlands"],"raw_orcid":"https://orcid.org/0000-0003-3790-492X","affiliations":[{"raw_affiliation_string":"University of Amsterdam, Amsterdam, Netherlands","institution_ids":["https://openalex.org/I4210135670","https://openalex.org/I887064364"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089128021","display_name":"David Steurer","orcid":"https://orcid.org/0000-0002-3908-8180"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"David Steurer","raw_affiliation_strings":["ETH Zurich, Zurich, Switzerland"],"raw_orcid":"https://orcid.org/0000-0002-3908-8180","affiliations":[{"raw_affiliation_string":"ETH Zurich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076325451","display_name":"Manuel Wiedmer","orcid":null},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Manuel Wiedmer","raw_affiliation_strings":["ETH Zurich, Zurich, Switzerland"],"raw_orcid":"https://orcid.org/0009-0002-2365-4165","affiliations":[{"raw_affiliation_string":"ETH Zurich, Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.9500485,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"410","last_page":"419"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.5389999747276306,"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"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.5389999747276306,"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/T11413","display_name":"Risk and Portfolio Optimization","score":0.08150000125169754,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.0714000016450882,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.3709000051021576},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.3578999936580658},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3240000009536743},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.31630000472068787},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.2842999994754791},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.27549999952316284},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.27379998564720154}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4887999892234802},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4016999900341034},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.3709000051021576},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.3578999936580658},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35510000586509705},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3240000009536743},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.31630000472068787},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29809999465942383},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.29809999465942383},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.2842999994754791},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.27549999952316284},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.27379998564720154},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2653999924659729},{"id":"https://openalex.org/C201829737","wikidata":"https://www.wikidata.org/wiki/Q2022760","display_name":"Linear matrix inequality","level":2,"score":0.26089999079704285},{"id":"https://openalex.org/C101044782","wikidata":"https://www.wikidata.org/wiki/Q6787887","display_name":"Matrix polynomial","level":3,"score":0.25780001282691956},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2572000026702881},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.2524999976158142},{"id":"https://openalex.org/C84135550","wikidata":"https://www.wikidata.org/wiki/Q3154022","display_name":"Linear inequality","level":3,"score":0.251800000667572},{"id":"https://openalex.org/C72134830","wikidata":"https://www.wikidata.org/wiki/Q5166524","display_name":"Convexity","level":2,"score":0.2517000138759613}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3798129.3800760","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800760","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3798129.3800760","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3798129.3800760","pdf_url":null,"source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 58th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W1585205451","https://openalex.org/W1590002045","https://openalex.org/W1639981145","https://openalex.org/W1681064468","https://openalex.org/W1884347414","https://openalex.org/W1967344706","https://openalex.org/W1971099220","https://openalex.org/W1971911125","https://openalex.org/W1985123706","https://openalex.org/W1993200481","https://openalex.org/W1995246641","https://openalex.org/W2012329067","https://openalex.org/W2018556306","https://openalex.org/W2023854932","https://openalex.org/W2028123920","https://openalex.org/W2050735826","https://openalex.org/W2050958701","https://openalex.org/W2063938506","https://openalex.org/W2068660819","https://openalex.org/W2071846104","https://openalex.org/W2079135578","https://openalex.org/W2095761776","https://openalex.org/W2136885855","https://openalex.org/W2165281529","https://openalex.org/W2255400221","https://openalex.org/W2594565427","https://openalex.org/W2773609948","https://openalex.org/W2808862920","https://openalex.org/W3048750752","https://openalex.org/W3134417020","https://openalex.org/W3163002697","https://openalex.org/W3216451529","https://openalex.org/W4293860921","https://openalex.org/W4383213595","https://openalex.org/W4400268749","https://openalex.org/W4415057329","https://openalex.org/W4415308168","https://openalex.org/W6959438159"],"related_works":[],"abstract_inverted_index":{"Efficient":[0],"algorithms":[1],"for":[2],"convex":[3,36],"optimization,":[4],"such":[5,39],"as":[6],"the":[7,16,22],"ellipsoid":[8],"method,":[9],"require":[10,69],"an":[11,27,73],"a":[12,19],"priori":[13],"bound":[14],"on":[15],"radius":[17],"of":[18,46,51,76],"ball":[20],"around":[21],"origin":[23],"guaranteed":[24],"to":[25,62,90],"contain":[26],"optimal":[28,47,66],"solution":[29,40],"if":[30,79],"one":[31],"exists.":[32],"For":[33,54],"linear":[34,52],"and":[35],"quadratic":[37],"programming,":[38],"bounds":[41],"follow":[42],"from":[43],"classical":[44],"characterizations":[45],"solutions":[48,67],"by":[49],"systems":[50],"equations.":[53],"other":[55],"programs,":[56],"e.g.,":[57],"semidefinite":[58,84],"ones,":[59],"examples":[60],"due":[61],"Khachiyan":[63],"show":[64],"that":[65],"may":[68],"huge":[70],"coefficients":[71],"with":[72],"exponential":[74],"number":[75],"bits,":[77],"even":[78,88],"we":[80],"allow":[81],"approximations.":[82],"Correspondingly,":[83],"programming":[85],"is":[86],"not":[87],"known":[89],"be":[91],"in":[92],"NP.":[93]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-06-10T00:00:00"}