{"id":"https://openalex.org/W4220968412","doi":"https://doi.org/10.1007/s10957-022-02020-3","title":"On the Approximation of Unbounded Convex Sets by Polyhedra","display_name":"On the Approximation of Unbounded Convex Sets by Polyhedra","publication_year":2022,"publication_date":"2022-03-29","ids":{"openalex":"https://openalex.org/W4220968412","doi":"https://doi.org/10.1007/s10957-022-02020-3"},"language":"en","primary_location":{"id":"doi:10.1007/s10957-022-02020-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10957-022-02020-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10957-022-02020-3.pdf","source":{"id":"https://openalex.org/S52430896","display_name":"Journal of Optimization Theory and Applications","issn_l":"0022-3239","issn":["0022-3239","1573-2878"],"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":"Journal of Optimization Theory and Applications","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/s10957-022-02020-3.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5043896036","display_name":"Daniel D\u00f6rfler","orcid":"https://orcid.org/0000-0002-9503-3619"},"institutions":[{"id":"https://openalex.org/I76198965","display_name":"Friedrich Schiller University Jena","ror":"https://ror.org/05qpz1x62","country_code":"DE","type":"education","lineage":["https://openalex.org/I76198965"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Daniel D\u00f6rfler","raw_affiliation_strings":["Friedrich Schiller University Jena, Jena, Germany"],"raw_orcid":"https://orcid.org/0000-0002-9503-3619","affiliations":[{"raw_affiliation_string":"Friedrich Schiller University Jena, Jena, Germany","institution_ids":["https://openalex.org/I76198965"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5043896036"],"corresponding_institution_ids":["https://openalex.org/I76198965"],"apc_list":{"value":2390,"currency":"EUR","value_usd":2990},"apc_paid":{"value":2390,"currency":"EUR","value_usd":2990},"fwci":2.5619,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.8755512,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":"194","issue":"1","first_page":"265","last_page":"287"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.998199999332428,"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.998199999332428,"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/T12923","display_name":"Digital Image Processing Techniques","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11830","display_name":"Point processes and geometric inequalities","score":0.9921000003814697,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.9198182821273804},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.740845263004303},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6998465061187744},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6992359161376953},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.6260141134262085},{"id":"https://openalex.org/keywords/convex-polytope","display_name":"Convex polytope","score":0.4850115478038788},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4808381497859955},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4646337330341339},{"id":"https://openalex.org/keywords/approximations-of-\u03c0","display_name":"Approximations of \u03c0","score":0.4480385184288025},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3961167633533478},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.37973546981811523},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.3290349841117859},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.23207131028175354},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.2189837098121643},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.20358070731163025},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09457981586456299}],"concepts":[{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.9198182821273804},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.740845263004303},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6998465061187744},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6992359161376953},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.6260141134262085},{"id":"https://openalex.org/C110943637","wikidata":"https://www.wikidata.org/wiki/Q4129097","display_name":"Convex polytope","level":5,"score":0.4850115478038788},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4808381497859955},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4646337330341339},{"id":"https://openalex.org/C193386753","wikidata":"https://www.wikidata.org/wiki/Q1130396","display_name":"Approximations of \u03c0","level":2,"score":0.4480385184288025},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3961167633533478},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37973546981811523},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.3290349841117859},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.23207131028175354},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.2189837098121643},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.20358070731163025},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09457981586456299}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s10957-022-02020-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10957-022-02020-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10957-022-02020-3.pdf","source":{"id":"https://openalex.org/S52430896","display_name":"Journal of Optimization Theory and Applications","issn_l":"0022-3239","issn":["0022-3239","1573-2878"],"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":"Journal of Optimization Theory and Applications","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2207.06750","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2207.06750","pdf_url":"https://arxiv.org/pdf/2207.06750","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:RePEc:spr:joptap:v:194:y:2022:i:1:d:10.1007_s10957-022-02020-3","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s10957-022-02020-3","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"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":"article"}],"best_oa_location":{"id":"doi:10.1007/s10957-022-02020-3","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s10957-022-02020-3","pdf_url":"https://link.springer.com/content/pdf/10.1007/s10957-022-02020-3.pdf","source":{"id":"https://openalex.org/S52430896","display_name":"Journal of Optimization Theory and Applications","issn_l":"0022-3239","issn":["0022-3239","1573-2878"],"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":"Journal of Optimization Theory and Applications","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320313941","display_name":"Friedrich-Schiller-Universit\u00e4t Jena","ror":"https://ror.org/05qpz1x62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4220968412.pdf","grobid_xml":"https://content.openalex.org/works/W4220968412.grobid-xml"},"referenced_works_count":40,"referenced_works":["https://openalex.org/W50621378","https://openalex.org/W427674437","https://openalex.org/W805566928","https://openalex.org/W1966006482","https://openalex.org/W1982511487","https://openalex.org/W1999913571","https://openalex.org/W2007231110","https://openalex.org/W2012902555","https://openalex.org/W2031708465","https://openalex.org/W2048944090","https://openalex.org/W2058094600","https://openalex.org/W2064823886","https://openalex.org/W2065706751","https://openalex.org/W2066459185","https://openalex.org/W2069808690","https://openalex.org/W2071334094","https://openalex.org/W2083027876","https://openalex.org/W2086591901","https://openalex.org/W2089492119","https://openalex.org/W2212241622","https://openalex.org/W2414908802","https://openalex.org/W2467308020","https://openalex.org/W2527288957","https://openalex.org/W2590334092","https://openalex.org/W2610247417","https://openalex.org/W2613109276","https://openalex.org/W3037851372","https://openalex.org/W3100148269","https://openalex.org/W3101956660","https://openalex.org/W3102470477","https://openalex.org/W3103531705","https://openalex.org/W3130355952","https://openalex.org/W4243667692","https://openalex.org/W4248948761","https://openalex.org/W4249513058","https://openalex.org/W4250589301","https://openalex.org/W4291320530","https://openalex.org/W4299843966","https://openalex.org/W4301454587","https://openalex.org/W6836320567"],"related_works":["https://openalex.org/W4248823117","https://openalex.org/W2030718493","https://openalex.org/W2004058166","https://openalex.org/W2018708907","https://openalex.org/W2103429114","https://openalex.org/W2005538657","https://openalex.org/W2004897847","https://openalex.org/W2088151573","https://openalex.org/W4385474329","https://openalex.org/W2469464399"],"abstract_inverted_index":{"Abstract":[0],"This":[1],"article":[2],"is":[3,16,128],"concerned":[4],"with":[5],"the":[6,29,38,69,102,108,134],"approximation":[7,50],"of":[8,19,48,110,126,133],"unbounded":[9,30,70],"convex":[10,99],"sets":[11],"by":[12],"polyhedra.":[13],"While":[14],"there":[15],"an":[17,105],"abundance":[18],"literature":[20],"investigating":[21],"this":[22],"task":[23],"for":[24,97,107],"compact":[25],"sets,":[26],"results":[27,42,78],"on":[28],"case":[31,71],"are":[32,95,136],"scarce.":[33],"We":[34],"first":[35],"point":[36],"out":[37],"connections":[39],"between":[40],"existing":[41],"before":[43],"introducing":[44],"a":[45,73],"new":[46],"notion":[47],"polyhedral":[49],"called":[51],"$$\\left(":[52,80,111],"\\varepsilon":[53,81,112],",":[54,82,113],"\\delta":[55,83,114],"\\right)":[56,84,115],"$$":[57,85,116],"<mml:math":[58,86,117],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\">":[59,87,118],"<mml:mfenced>":[60,88,119],"<mml:mi>\u03b5</mml:mi>":[61,89,120],"<mml:mo>,</mml:mo>":[62,90,121],"<mml:mi>\u03b4</mml:mi>":[63,91,122],"</mml:mfenced>":[64,92,123],"</mml:math>":[65,93,124],"-approximation":[66],"that":[67],"integrates":[68],"in":[72],"meaningful":[74],"way.":[75],"Some":[76],"basic":[77],"about":[79],"-approximations":[94,125],"proved":[96],"general":[98],"sets.":[100],"In":[101],"last":[103],"section,":[104],"algorithm":[106,135],"computation":[109],"spectrahedra":[127],"presented.":[129],"Correctness":[130],"and":[131],"finiteness":[132],"proved.":[137]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}