{"id":"https://openalex.org/W1593678739","doi":"https://doi.org/10.1109/cdc.2003.1272802","title":"Optimal, worst case filter design via convex optimization","display_name":"Optimal, worst case filter design via convex optimization","publication_year":2004,"publication_date":"2004-07-08","ids":{"openalex":"https://openalex.org/W1593678739","doi":"https://doi.org/10.1109/cdc.2003.1272802","mag":"1593678739"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2003.1272802","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2003.1272802","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5014934594","display_name":"Kunpeng Sun","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kunpeng Sun","raw_affiliation_strings":["Department of Mechanical Engineering, University of California, Berkeley, CA, USA","[Dept. of Mech. Eng., California Univ., Berkeley, CA, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, University of California, Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"[Dept. of Mech. Eng., California Univ., Berkeley, CA, USA]","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076844884","display_name":"Andrew Packard","orcid":null},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Packard","raw_affiliation_strings":["Department of Mechanical Engineering, University of California, Berkeley, CA, USA","[Dept. of Mech. Eng., California Univ., Berkeley, CA, USA]"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, University of California, Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]},{"raw_affiliation_string":"[Dept. of Mech. Eng., California Univ., Berkeley, CA, USA]","institution_ids":["https://openalex.org/I95457486"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I95457486"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":"2","issue":null,"first_page":"1380","last_page":"1385"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10928","display_name":"Probabilistic and Robust Engineering Design","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1804","display_name":"Statistics, Probability and Uncertainty"},"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/T11236","display_name":"Control Systems and Identification","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"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.6550222635269165},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6368669271469116},{"id":"https://openalex.org/keywords/filter","display_name":"Filter (signal processing)","score":0.6320328712463379},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6168718338012695},{"id":"https://openalex.org/keywords/optimal-design","display_name":"Optimal design","score":0.5516694784164429},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5188585519790649},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48415833711624146},{"id":"https://openalex.org/keywords/filter-design","display_name":"Filter design","score":0.4758443832397461},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.45246952772140503},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35134410858154297}],"concepts":[{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.6550222635269165},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6368669271469116},{"id":"https://openalex.org/C106131492","wikidata":"https://www.wikidata.org/wiki/Q3072260","display_name":"Filter (signal processing)","level":2,"score":0.6320328712463379},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6168718338012695},{"id":"https://openalex.org/C186394612","wikidata":"https://www.wikidata.org/wiki/Q7098942","display_name":"Optimal design","level":2,"score":0.5516694784164429},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5188585519790649},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48415833711624146},{"id":"https://openalex.org/C22597639","wikidata":"https://www.wikidata.org/wiki/Q5449227","display_name":"Filter design","level":3,"score":0.4758443832397461},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.45246952772140503},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35134410858154297},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc.2003.1272802","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2003.1272802","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1504891015","https://openalex.org/W1572031236","https://openalex.org/W1967073510","https://openalex.org/W2031467798","https://openalex.org/W2048922416","https://openalex.org/W2103313140","https://openalex.org/W2106988738","https://openalex.org/W2109320662","https://openalex.org/W2130515279","https://openalex.org/W2142542010","https://openalex.org/W2160958903","https://openalex.org/W2162719021","https://openalex.org/W2163630364","https://openalex.org/W6684293833"],"related_works":["https://openalex.org/W4360764540","https://openalex.org/W4231657010","https://openalex.org/W2395986200","https://openalex.org/W1994552539","https://openalex.org/W2007917622","https://openalex.org/W2385305544","https://openalex.org/W2157464222","https://openalex.org/W1985852812","https://openalex.org/W2066539480","https://openalex.org/W3153752017"],"abstract_inverted_index":{"We":[0],"propose":[1],"a":[2,79],"convex":[3,27],"optimization":[4],"method":[5],"for":[6,96],"optimal":[7,47],"robust":[8,73],"linear":[9],"filter":[10],"design.":[11],"This":[12],"is":[13,23,26,32,90],"based":[14],"on":[15],"the":[16,19,29,46,86],"observation":[17],"that":[18,34],"design":[20,50],"problem,":[21],"which":[22],"infinite":[24],"dimensional,":[25],"in":[28,104],"filter.":[30],"It":[31],"shown":[33],"finite":[35,54],"dimensional":[36,55],"relaxations":[37],"can":[38],"be":[39],"used":[40],"to":[41,45,61],"get":[42,62],"arbitrary":[43],"close":[44],"solution.":[48],"The":[49,88,99],"procedure":[51],"constitutes":[52],"successive":[53],"approximations,":[56],"involving":[57],"worst":[58],"case":[59],"analysis":[60],"converging":[63],"upper":[64,83],"and":[65],"lower":[66],"bounds.":[67],"Our":[68],"approach":[69],"differs":[70],"from":[71],"standard":[72],"filtering":[74],"techniques.":[75],"Usually,":[76],"these":[77],"minimize":[78],"specific":[80],"choice":[81,89],"of":[82,85],"bound":[84],".":[87],"usually":[91],"well-motivated,":[92],"but":[93],"partially":[94],"made":[95],"computational":[97,100],"simplicity.":[98],"demands":[101],"put":[102],"forth":[103],"this":[105],"paper":[106],"are":[107],"much":[108],"larger.":[109]},"counts_by_year":[{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}