{"id":"https://openalex.org/W2097460613","doi":"https://doi.org/10.1137/15m1009597","title":"Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints","display_name":"Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2097460613","doi":"https://doi.org/10.1137/15m1009597","mag":"2097460613"},"language":"en","primary_location":{"id":"doi:10.1137/15m1009597","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1009597","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":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1408.3595","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Laurent Lessard","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Laurent Lessard","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Benjamin Recht","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Benjamin Recht","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Andrew Packard","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Andrew Packard","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":35.514,"has_fulltext":true,"cited_by_count":364,"citation_normalized_percentile":{"value":0.99708078,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"26","issue":"1","first_page":"57","last_page":"95"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.3862000107765198,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.3862000107765198,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.36340001225471497,"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.06759999692440033,"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/semidefinite-programming","display_name":"Semidefinite programming","score":0.77920001745224},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.6064000129699707},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5774999856948853},{"id":"https://openalex.org/keywords/quadratically-constrained-quadratic-program","display_name":"Quadratically constrained quadratic program","score":0.5511000156402588},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5271000266075134},{"id":"https://openalex.org/keywords/semidefinite-embedding","display_name":"Semidefinite embedding","score":0.5230000019073486},{"id":"https://openalex.org/keywords/sequential-quadratic-programming","display_name":"Sequential quadratic programming","score":0.5184000134468079},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.5164999961853027},{"id":"https://openalex.org/keywords/stability","display_name":"Stability (learning theory)","score":0.4927000105381012},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4596000015735626}],"concepts":[{"id":"https://openalex.org/C101901036","wikidata":"https://www.wikidata.org/wiki/Q2269096","display_name":"Semidefinite programming","level":2,"score":0.77920001745224},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.690500020980835},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6301000118255615},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.6064000129699707},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5774999856948853},{"id":"https://openalex.org/C65148998","wikidata":"https://www.wikidata.org/wiki/Q7268373","display_name":"Quadratically constrained quadratic program","level":3,"score":0.5511000156402588},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5271000266075134},{"id":"https://openalex.org/C206818286","wikidata":"https://www.wikidata.org/wiki/Q7449403","display_name":"Semidefinite embedding","level":4,"score":0.5230000019073486},{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.5184000134468079},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.5164999961853027},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.4927000105381012},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4596000015735626},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.40799999237060547},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39259999990463257},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.3693000078201294},{"id":"https://openalex.org/C193254401","wikidata":"https://www.wikidata.org/wiki/Q2160088","display_name":"Robust optimization","level":2,"score":0.36469998955726624},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3596999943256378},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.34139999747276306},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.34060001373291016},{"id":"https://openalex.org/C201829737","wikidata":"https://www.wikidata.org/wiki/Q2022760","display_name":"Linear matrix inequality","level":2,"score":0.32820001244544983},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.328000009059906},{"id":"https://openalex.org/C111397411","wikidata":"https://www.wikidata.org/wiki/Q7442977","display_name":"Second-order cone programming","level":4,"score":0.3278000056743622},{"id":"https://openalex.org/C92995354","wikidata":"https://www.wikidata.org/wiki/Q5165499","display_name":"Continuous optimization","level":4,"score":0.3276999890804291},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.32519999146461487},{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.3246999979019165},{"id":"https://openalex.org/C122268817","wikidata":"https://www.wikidata.org/wiki/Q2020318","display_name":"Frank\u2013Wolfe algorithm","level":5,"score":0.32089999318122864},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.3149000108242035},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.3052000105381012},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.28619998693466187},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.2854999899864197},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.27900001406669617},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.27549999952316284},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.2711000144481659},{"id":"https://openalex.org/C10494615","wikidata":"https://www.wikidata.org/wiki/Q17086765","display_name":"Proximal Gradient Methods","level":4,"score":0.266400009393692},{"id":"https://openalex.org/C3309286","wikidata":"https://www.wikidata.org/wiki/Q4907693","display_name":"Bilevel optimization","level":3,"score":0.2572999894618988},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.25690001249313354},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2531999945640564},{"id":"https://openalex.org/C91575142","wikidata":"https://www.wikidata.org/wiki/Q1971426","display_name":"Optimal control","level":2,"score":0.2500999867916107}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/15m1009597","is_oa":false,"landing_page_url":"https://doi.org/10.1137/15m1009597","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:arXiv.org:1408.3595","is_oa":true,"landing_page_url":"https://arxiv.org/abs/1408.3595","pdf_url":"https://arxiv.org/pdf/1408.3595","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"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1408.3595","is_oa":true,"landing_page_url":"https://arxiv.org/abs/1408.3595","pdf_url":"https://arxiv.org/pdf/1408.3595","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"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1523888516","display_name":null,"funder_award_id":"FA9550-","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"},{"id":"https://openalex.org/G2014875580","display_name":null,"funder_award_id":"NRA NNX12AM55A","funder_id":"https://openalex.org/F4320306101","funder_display_name":"National Aeronautics and Space Administration"},{"id":"https://openalex.org/G3484715154","display_name":null,"funder_award_id":"FA9550-13-1-0138","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G3655843343","display_name":null,"funder_award_id":"N00014-13-1-0129","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G3995450870","display_name":null,"funder_award_id":"FA9550-13-1-0138","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4093999059","display_name":"INCREASED FLIGHT SAFETY IS KEY TO REDUCING THE FREQUENCY AND SEVERITY OF AIRCRAFT ACCIDENTS. FLIGHT SAFETY SYSTEM RELIABILITY AND INTEGRITY REQUIREME","funder_award_id":"NNX12AM55A","funder_id":"https://openalex.org/F4320306101","funder_display_name":"National Aeronautics and Space Administration"},{"id":"https://openalex.org/G4332978919","display_name":null,"funder_award_id":"N00014-13-1-0129","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4654920669","display_name":null,"funder_award_id":"CCF-1139158","funder_id":"https://openalex.org/F4320332169","funder_display_name":"Directorate for Computer and Information Science and Engineering"},{"id":"https://openalex.org/G4713059963","display_name":null,"funder_award_id":"FA8750","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"id":"https://openalex.org/G4891291996","display_name":null,"funder_award_id":"CCF-1148243","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G495230355","display_name":null,"funder_award_id":"N00014-13-1-0129","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"},{"id":"https://openalex.org/G5809100787","display_name":null,"funder_award_id":"FA9550","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"},{"id":"https://openalex.org/G6071252945","display_name":null,"funder_award_id":"FA9550-12","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"},{"id":"https://openalex.org/G6098521345","display_name":null,"funder_award_id":"FA9550","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G6398089940","display_name":"Making Sense at Scale with Algorithms, Machines, and People","funder_award_id":"1139158","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6591627824","display_name":null,"funder_award_id":"N00014-11-1-0723","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G7103680314","display_name":null,"funder_award_id":"FA8750-12-2-0331","funder_id":"https://openalex.org/F4320332180","funder_display_name":"Defense Advanced Research Projects Agency"},{"id":"https://openalex.org/G7999580237","display_name":null,"funder_award_id":"FA9550-12-1","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"},{"id":"https://openalex.org/G825210325","display_name":null,"funder_award_id":"FA9550-13-1-0138","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"},{"id":"https://openalex.org/G8370895489","display_name":"CAREER: Efficient Atomic Decompositions of Massive Data Sets","funder_award_id":"1148243","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8560804567","display_name":null,"funder_award_id":"7076018","funder_id":"https://openalex.org/F4320338292","funder_display_name":"Lawrence Berkeley National Laboratory"},{"id":"https://openalex.org/G8876996369","display_name":null,"funder_award_id":"N00014","funder_id":"https://openalex.org/F4320337345","funder_display_name":"Office of Naval Research"},{"id":"https://openalex.org/G900736768","display_name":null,"funder_award_id":"CCF-1139158","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"},{"id":"https://openalex.org/F4320306101","display_name":"National Aeronautics and Space Administration","ror":"https://ror.org/027ka1x80"},{"id":"https://openalex.org/F4320307791","display_name":"Cisco Systems","ror":"https://ror.org/03yt1ez60"},{"id":"https://openalex.org/F4320310598","display_name":"Amazon Web Services","ror":"https://ror.org/04mv4n011"},{"id":"https://openalex.org/F4320312638","display_name":"Thomas and Stacey Siebel Foundation","ror":null},{"id":"https://openalex.org/F4320316505","display_name":"NetApp","ror":"https://ror.org/05c4cm338"},{"id":"https://openalex.org/F4320316785","display_name":"VMware","ror":null},{"id":"https://openalex.org/F4320332169","display_name":"Directorate for Computer and Information Science and Engineering","ror":"https://ror.org/025kzpk63"},{"id":"https://openalex.org/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"},{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"},{"id":"https://openalex.org/F4320338279","display_name":"Air Force Office of Scientific Research","ror":"https://ror.org/011e9bt93"},{"id":"https://openalex.org/F4320338292","display_name":"Lawrence Berkeley National Laboratory","ror":"https://ror.org/02jbv0t02"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2097460613.pdf","grobid_xml":"https://content.openalex.org/works/W2097460613.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W1496537269","https://openalex.org/W1979896658","https://openalex.org/W1992208280","https://openalex.org/W2003658506","https://openalex.org/W2004470537","https://openalex.org/W2009253901","https://openalex.org/W2030161963","https://openalex.org/W2045427092","https://openalex.org/W2046874050","https://openalex.org/W2062704118","https://openalex.org/W2063493327","https://openalex.org/W2076467525","https://openalex.org/W2089024379","https://openalex.org/W2095477585","https://openalex.org/W2095984592","https://openalex.org/W2097944741","https://openalex.org/W2100556411","https://openalex.org/W2103313140","https://openalex.org/W2119058682","https://openalex.org/W2124768887","https://openalex.org/W2151779884","https://openalex.org/W2154834860","https://openalex.org/W2163182586","https://openalex.org/W2809808592","https://openalex.org/W4243620103"],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"develops":[2],"a":[3,65,127],"new":[4,58,128],"framework":[5],"to":[6,49,53,117],"analyze":[7],"and":[8,37,63,97],"design":[9],"iterative":[10],"optimization":[11,55,74,120],"algorithms":[12,121],"built":[13],"on":[14,84],"the":[15,31,88,91],"notion":[16],"of":[17,33,67],"integral":[18],"quadratic":[19],"constraints":[20],"(IQCs)":[21],"from":[22],"robust":[23],"control":[24],"theory.":[25],"IQCs":[26],"provide":[27],"sufficient":[28],"conditions":[29,39],"for":[30,71,87,119,130],"stability":[32],"complicated":[34],"interconnected":[35],"systems,":[36],"these":[38,77,112],"can":[40,114],"be":[41,115],"checked":[42],"by":[43,73,100],"semidefinite":[44,104],"programming.":[45],"We":[46,107],"discuss":[47],"how":[48,111],"adapt":[50],"IQC":[51,68],"theory":[52,69],"study":[54],"algorithms,":[56],"proving":[57],"inequalities":[59],"about":[60],"convex":[61],"functions":[62],"providing":[64],"version":[66],"adapted":[70],"use":[72],"researchers.":[75],"Using":[76],"inequalities,":[78],"we":[79],"derive":[80],"numerical":[81],"upper":[82],"bounds":[83],"convergence":[85],"rates":[86],"Gradient":[89],"method,":[90,93,96],"Heavy-ball":[92],"Nesterov's":[94],"accelerated":[95],"related":[98],"variants":[99],"solving":[101],"small,":[102],"simple":[103],"programming":[105],"problems.":[106],"also":[108],"briefly":[109],"show":[110],"techniques":[113],"used":[116],"search":[118],"with":[122],"desired":[123],"performance":[124],"characteristics,":[125],"establishing":[126],"methodology":[129],"algorithm":[131],"design.":[132]},"counts_by_year":[{"year":2026,"cited_by_count":15},{"year":2025,"cited_by_count":39},{"year":2024,"cited_by_count":42},{"year":2023,"cited_by_count":51},{"year":2022,"cited_by_count":50},{"year":2021,"cited_by_count":41},{"year":2020,"cited_by_count":43},{"year":2019,"cited_by_count":38},{"year":2018,"cited_by_count":22},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2016-06-24T00:00:00"}