{"id":"https://openalex.org/W3010959628","doi":"https://doi.org/10.1109/cdc40024.2019.9028953","title":"Robust Optimization via Discrete-Time Saddle Point Algorithm","display_name":"Robust Optimization via Discrete-Time Saddle Point Algorithm","publication_year":2019,"publication_date":"2019-12-01","ids":{"openalex":"https://openalex.org/W3010959628","doi":"https://doi.org/10.1109/cdc40024.2019.9028953","mag":"3010959628"},"language":"en","primary_location":{"id":"doi:10.1109/cdc40024.2019.9028953","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc40024.2019.9028953","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 58th Conference on Decision and Control (CDC)","raw_type":"proceedings-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/A5052039345","display_name":"Keivan Ebrahimi","orcid":null},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Keivan Ebrahimi","raw_affiliation_strings":["Department of Electrical & Computer Engineering, Iowa State University, Ames, IA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical & Computer Engineering, Iowa State University, Ames, IA","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5050749492","display_name":"Umesh Vaidya","orcid":"https://orcid.org/0000-0002-0483-4921"},"institutions":[{"id":"https://openalex.org/I8078737","display_name":"Clemson University","ror":"https://ror.org/037s24f05","country_code":"US","type":"education","lineage":["https://openalex.org/I8078737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Umesh Vaidya","raw_affiliation_strings":["Department of Mechanical Engineering, Clemson University, Clemson, SC"],"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, Clemson University, Clemson, SC","institution_ids":["https://openalex.org/I8078737"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020511287","display_name":"Nicola Elia","orcid":"https://orcid.org/0000-0002-9145-1848"},"institutions":[{"id":"https://openalex.org/I4210101327","display_name":"Twin Cities Orthopedics","ror":"https://ror.org/01en4s460","country_code":"US","type":"healthcare","lineage":["https://openalex.org/I4210101327"]},{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nicola Elia","raw_affiliation_strings":["Department of Elec. & Comp. Engineering, University of Minnesota, Twin Cities, MN"],"affiliations":[{"raw_affiliation_string":"Department of Elec. & Comp. Engineering, University of Minnesota, Twin Cities, MN","institution_ids":["https://openalex.org/I4210101327","https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5052039345"],"corresponding_institution_ids":["https://openalex.org/I173911158"],"apc_list":null,"apc_paid":null,"fwci":0.2062,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.63380693,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"2019","issue":null,"first_page":"2473","last_page":"2478"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9995999932289124,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9983999729156494,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9980999827384949,"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/saddle-point","display_name":"Saddle point","score":0.8126064538955688},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6445873975753784},{"id":"https://openalex.org/keywords/saddle","display_name":"Saddle","score":0.5545783638954163},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5532042980194092},{"id":"https://openalex.org/keywords/discrete-time-and-continuous-time","display_name":"Discrete time and continuous time","score":0.5298835039138794},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5241618156433105},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4945976436138153},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.48125192523002625},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.46510061621665955},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4466908276081085},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.44610658288002014},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.44320619106292725},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4114600121974945},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3718099594116211}],"concepts":[{"id":"https://openalex.org/C2681867","wikidata":"https://www.wikidata.org/wiki/Q690935","display_name":"Saddle point","level":2,"score":0.8126064538955688},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6445873975753784},{"id":"https://openalex.org/C2777127463","wikidata":"https://www.wikidata.org/wiki/Q10862618","display_name":"Saddle","level":2,"score":0.5545783638954163},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5532042980194092},{"id":"https://openalex.org/C55689738","wikidata":"https://www.wikidata.org/wiki/Q15963867","display_name":"Discrete time and continuous time","level":2,"score":0.5298835039138794},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5241618156433105},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4945976436138153},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.48125192523002625},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.46510061621665955},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4466908276081085},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44610658288002014},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.44320619106292725},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4114600121974945},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3718099594116211},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cdc40024.2019.9028953","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc40024.2019.9028953","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 IEEE 58th Conference on Decision and Control (CDC)","raw_type":"proceedings-article"},{"id":"mag:3088482306","is_oa":false,"landing_page_url":"https://jglobal.jst.go.jp/en/detail?JGLOBAL_ID=202002234684563100","pdf_url":null,"source":{"id":"https://openalex.org/S4306512817","display_name":"IEEE Conference Proceedings","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":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"IEEE Conference Proceedings","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.5699999928474426,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W150789891","https://openalex.org/W1542523037","https://openalex.org/W1710423945","https://openalex.org/W1972581644","https://openalex.org/W1990275757","https://openalex.org/W1993377828","https://openalex.org/W2042816232","https://openalex.org/W2120974482","https://openalex.org/W2131116400","https://openalex.org/W2967897454","https://openalex.org/W3016074254","https://openalex.org/W3125338181","https://openalex.org/W6606130288","https://openalex.org/W6637839537"],"related_works":["https://openalex.org/W4236459141","https://openalex.org/W4205304778","https://openalex.org/W2020252434","https://openalex.org/W73248859","https://openalex.org/W2584253892","https://openalex.org/W2350324449","https://openalex.org/W1572705989","https://openalex.org/W119381072","https://openalex.org/W2034033896","https://openalex.org/W2087062149"],"abstract_inverted_index":{"We":[0],"discover":[1],"discrete-time":[2,60],"counterpart":[3],"of":[4,45,57],"the":[5,19,22,28,36,46,50,58],"continuous-time":[6],"saddle":[7],"point":[8],"algorithm":[9,48,61],"developed":[10],"in":[11,27,35],"[1]":[12],"for":[13],"solving":[14],"robust":[15,37,51,66],"optimization":[16,38,67],"problems.":[17],"Under":[18],"assumption":[20],"that":[21],"cost":[23,71],"function":[24,72],"is":[25],"convex":[26],"decision":[29],"variable":[30],"and":[31,73],"uncertainties":[32],"enter":[33],"concavely":[34],"problem,":[39],"we":[40],"prove":[41],"global":[42],"asymptotic":[43],"convergence":[44],"saddle-point":[47],"to":[49,64],"optimal":[52],"solution.":[53],"The":[54],"sub-gradient":[55],"nature":[56],"proposed":[59],"allows":[62],"us":[63],"handle":[65],"problems":[68],"with":[69],"discontinuous":[70],"constraint.":[74]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}