{"id":"https://openalex.org/W2012819062","doi":"https://doi.org/10.1137/050622560","title":"On the Minimum Volume Covering Ellipsoid of Ellipsoids","display_name":"On the Minimum Volume Covering Ellipsoid of Ellipsoids","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2012819062","doi":"https://doi.org/10.1137/050622560","mag":"2012819062"},"language":"en","primary_location":{"id":"doi:10.1137/050622560","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050622560","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5057209882","display_name":"E. Alper Y\u0131ld\u0131r\u0131m","orcid":"https://orcid.org/0000-0003-4141-3189"},"institutions":[{"id":"https://openalex.org/I168864056","display_name":"Bilkent University","ror":"https://ror.org/02vh8a032","country_code":"TR","type":"education","lineage":["https://openalex.org/I168864056"]}],"countries":["TR"],"is_corresponding":true,"raw_author_name":"E. Alper Yildirim","raw_affiliation_strings":["Department of Industrial Engineering, Bilkent University, 06800 Bilkent, Ankara, Turkey"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Bilkent University, 06800 Bilkent, Ankara, Turkey","institution_ids":["https://openalex.org/I168864056"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5057209882"],"corresponding_institution_ids":["https://openalex.org/I168864056"],"apc_list":null,"apc_paid":null,"fwci":5.6798,"has_fulltext":false,"cited_by_count":55,"citation_normalized_percentile":{"value":0.95403087,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"17","issue":"3","first_page":"621","last_page":"641"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9965999722480774,"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"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9959999918937683,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8358049392700195},{"id":"https://openalex.org/keywords/ellipsoid","display_name":"Ellipsoid","score":0.8347176313400269},{"id":"https://openalex.org/keywords/ellipsoid-method","display_name":"Ellipsoid method","score":0.6676764488220215},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5748856663703918},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5039066672325134},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4262714385986328},{"id":"https://openalex.org/keywords/convex-hull","display_name":"Convex hull","score":0.41663044691085815},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.3262529969215393},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.31527218222618103},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.290808767080307},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.20043063163757324},{"id":"https://openalex.org/keywords/subderivative","display_name":"Subderivative","score":0.08363085985183716}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8358049392700195},{"id":"https://openalex.org/C57489055","wikidata":"https://www.wikidata.org/wiki/Q190046","display_name":"Ellipsoid","level":2,"score":0.8347176313400269},{"id":"https://openalex.org/C205451395","wikidata":"https://www.wikidata.org/wiki/Q378574","display_name":"Ellipsoid method","level":5,"score":0.6676764488220215},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5748856663703918},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5039066672325134},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4262714385986328},{"id":"https://openalex.org/C206194317","wikidata":"https://www.wikidata.org/wiki/Q1138624","display_name":"Convex hull","level":3,"score":0.41663044691085815},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.3262529969215393},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.31527218222618103},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.290808767080307},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.20043063163757324},{"id":"https://openalex.org/C200661725","wikidata":"https://www.wikidata.org/wiki/Q289500","display_name":"Subderivative","level":4,"score":0.08363085985183716},{"id":"https://openalex.org/C1276947","wikidata":"https://www.wikidata.org/wiki/Q333","display_name":"Astronomy","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/050622560","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050622560","pdf_url":null,"source":{"id":"https://openalex.org/S928796702","display_name":"SIAM Journal on Optimization","issn_l":"1052-6234","issn":["1052-6234","1095-7189"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Optimization","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.622.427","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.622.427","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://yildirim.bilkent.edu.tr/papers/62256.pdf","raw_type":"text"},{"id":"pmh:oai:repository.bilkent.edu.tr:11693/23637","is_oa":false,"landing_page_url":"http://hdl.handle.net/11693/23637","pdf_url":null,"source":{"id":"https://openalex.org/S4306400079","display_name":"Bilkent University Institutional Repository (Bilkent University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I168864056","host_organization_name":"Bilkent University","host_organization_lineage":["https://openalex.org/I168864056"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Optimization","raw_type":"Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5153012142","display_name":"CAREER:     A Unifying Interior-Point Approach to Sensitivity Analysis and Reoptimization in Conic Programming","funder_award_id":"0237415","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W16952281","https://openalex.org/W187211397","https://openalex.org/W1568307856","https://openalex.org/W1590002045","https://openalex.org/W1632601927","https://openalex.org/W1977263019","https://openalex.org/W1991813962","https://openalex.org/W1994666506","https://openalex.org/W2024318675","https://openalex.org/W2029494882","https://openalex.org/W2043507882","https://openalex.org/W2050958701","https://openalex.org/W2051314392","https://openalex.org/W2055356142","https://openalex.org/W2056124912","https://openalex.org/W2059651397","https://openalex.org/W2063176644","https://openalex.org/W2063549526","https://openalex.org/W2071846104","https://openalex.org/W2074859470","https://openalex.org/W2076445420","https://openalex.org/W2093790790","https://openalex.org/W2100440346","https://openalex.org/W2107454656","https://openalex.org/W2110540077","https://openalex.org/W2133629339","https://openalex.org/W2138663260","https://openalex.org/W2158713176","https://openalex.org/W2166076133","https://openalex.org/W2171970890","https://openalex.org/W2218835040","https://openalex.org/W2296319761","https://openalex.org/W3034208633","https://openalex.org/W3210839039","https://openalex.org/W4246985475","https://openalex.org/W4250667090"],"related_works":["https://openalex.org/W2235431948","https://openalex.org/W2031732959","https://openalex.org/W7739709","https://openalex.org/W2016090484","https://openalex.org/W2562629174","https://openalex.org/W1500330311","https://openalex.org/W2061711344","https://openalex.org/W2169170556","https://openalex.org/W2034124193","https://openalex.org/W2993619238"],"abstract_inverted_index":{"Let":[0],"${\\cal":[1,37,45,109,152,221,248],"S}$":[2,38,153,225],"denote":[3],"the":[4,23,31,49,68,126,135,146,156,165,172,190,199,227,230,242,251,254,260,264,271,279,301,311],"convex":[5,302],"hull":[6,303],"of":[7,25,36,44,52,73,77,87,108,130,137,151,159,167,177,180,192,195,204,209,235,247,253,273,300,304,315],"m":[8,181],"full\u2010dimensional":[9],"ellipsoids":[10,138,274],"in":[11,79,82,134,154,186,198,307,317],"$\\mathbb{R}^n$.":[12,308],"Given":[13],"$\\epsilon":[14,113],">":[15,19,114,118],"0$":[16,115],"and":[17,39,54,116,169,263,296],"$\\delta":[18,117],"0$,":[20,119],"we":[21,120],"study":[22],"problems":[24],"computing":[26],"a":[27,40,74,85,105,178,202,207,212,217,238],"$(1+":[28],"\\epsilon)$\u2010approximation":[29],"to":[30,67,170,206,241,281,288],"minimum":[32,69,147,173,231,243,292],"volume":[33,70,148,174,232,244,293],"covering":[34,71,149,175,233,245,294],"ellipsoid":[35,72,150,176,234,246,295],"$(1":[41,106],"+":[42],"\\delta)n$\u2010rounding":[43],"S}$.":[46,110,249],"We":[47,276,309],"extend":[48],"first\u2010order":[50],"algorithm":[51,89,101,143,166,200,215,284],"Kumar":[53,168],"[J.":[55],"Optim.":[56],"Theory":[57],"Appl.,":[58],"126":[59],"(2005),":[60],"pp.":[61,98],"1\u201321]":[62],"that":[63,162,229],"computes":[64],"an":[65,290,297],"approximation":[66,240,265],"finite":[75,218],"set":[76,179,203,208,220,256],"points":[78,205],"$\\mathbb{R}^n$,":[80],"which,":[81],"turn,":[83],"is":[84,132,189],"modification":[86],"Khachiyan\u2019s":[88],"[L.":[90],"G.":[91],"Khachiyan,":[92],"Math.":[93],"Oper.":[94],"Res.,":[95],"21":[96],"(1996),":[97],"307\u2013320].":[99],"Our":[100],"can":[102,144,285],"also":[103,277],"compute":[104,289],"+\\delta)n$\u2010rounding":[107],"For":[111],"fixed":[112],"establish":[121],"polynomial\u2010time":[122,193],"complexity":[123,194],"results":[124],"for":[125],"respective":[127],"problems,":[128],"each":[129],"which":[131,282],"linear":[133],"number":[136,158,272,313],"m.":[139,275],"In":[140],"particular,":[141],"our":[142,187,214,283,318],"approximate":[145,171,291,298],"asymptotically":[155],"same":[157],"iterations":[160],"as":[161],"required":[163],"by":[164],"points.":[182],"The":[183],"main":[184],"ingredient":[185],"analysis":[188],"extension":[191],"certain":[196],"subroutines":[197],"from":[201],"ellipsoids.":[210],"As":[211],"byproduct,":[213],"returns":[216],"\u201ccore\u201d":[219],"X}":[222],"\\subseteq":[223],"{\\cal":[224],"with":[226],"property":[228],"\u03c7":[236],"provides":[237],"good":[239],"Furthermore,":[250],"size":[252],"core":[255],"depends":[257],"only":[258],"on":[259,270],"dimension":[261],"n":[262],"parameter":[266],"\u03b5,":[267],"but":[268],"not":[269],"discuss":[278],"extent":[280],"be":[286],"used":[287],"n\u2010rounding":[299],"other":[305],"sets":[306],"adopt":[310],"real":[312],"model":[314],"computation":[316],"analysis.":[319]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}