{"id":"https://openalex.org/W6921727772","doi":"https://doi.org/10.7907/db29-am33","title":"Frameworks for High Dimensional Convex Optimization","display_name":"Frameworks for High Dimensional Convex Optimization","publication_year":2020,"publication_date":"2020-09-14","ids":{"openalex":"https://openalex.org/W6921727772","doi":"https://doi.org/10.7907/db29-am33"},"language":"en","primary_location":{"id":"pmh:oai:thesis.library.caltech.edu:13856","is_oa":true,"landing_page_url":null,"pdf_url":"https://thesis.library.caltech.edu/13856/1/london_palma_2020.pdf","source":{"id":"https://openalex.org/S4306402402","display_name":"CaltechTHESIS (California Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122411786","host_organization_name":"California Institute of Technology","host_organization_lineage":["https://openalex.org/I122411786"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},"type":"dissertation","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://thesis.library.caltech.edu/13856/1/london_palma_2020.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"London, Palma Alise den Nijs","orcid":"https://orcid.org/0000-0001-6472-8293"},"institutions":[{"id":"https://openalex.org/I122411786","display_name":"California Institute of Technology","ror":"https://ror.org/05dxps055","country_code":"US","type":"education","lineage":["https://openalex.org/I122411786"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"London, Palma Alise den Nijs","raw_affiliation_strings":["California Institute of Technology"],"raw_orcid":"https://orcid.org/0000-0001-6472-8293","affiliations":[{"raw_affiliation_string":"California Institute of Technology","institution_ids":["https://openalex.org/I122411786"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I122411786"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.7401999831199646,"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.7401999831199646,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.04149999842047691,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.03610000014305115,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/bottleneck","display_name":"Bottleneck","score":0.6582000255584717},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.583899974822998},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.5515999794006348},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5375999808311462},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.46630001068115234},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4174000024795532},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.3961000144481659},{"id":"https://openalex.org/keywords/quality","display_name":"Quality (philosophy)","score":0.3499999940395355}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7372000217437744},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.6582000255584717},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.583899974822998},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.5515999794006348},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5375999808311462},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.48330000042915344},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.46630001068115234},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4174000024795532},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.3961000144481659},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.3499999940395355},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3353999853134155},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.30820000171661377},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.30630001425743103},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.304500013589859},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.3028999865055084},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3021000027656555},{"id":"https://openalex.org/C3019722297","wikidata":"https://www.wikidata.org/wiki/Q4440864","display_name":"High dimensional","level":2,"score":0.2782000005245209},{"id":"https://openalex.org/C75684735","wikidata":"https://www.wikidata.org/wiki/Q858810","display_name":"Big data","level":2,"score":0.27709999680519104},{"id":"https://openalex.org/C58489278","wikidata":"https://www.wikidata.org/wiki/Q1172284","display_name":"Data set","level":2,"score":0.2696000039577484},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26919999718666077},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2517000138759613},{"id":"https://openalex.org/C21080849","wikidata":"https://www.wikidata.org/wiki/Q13611879","display_name":"Data point","level":2,"score":0.250900000333786}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:thesis.library.caltech.edu:13856","is_oa":true,"landing_page_url":null,"pdf_url":"https://thesis.library.caltech.edu/13856/1/london_palma_2020.pdf","source":{"id":"https://openalex.org/S4306402402","display_name":"CaltechTHESIS (California Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122411786","host_organization_name":"California Institute of Technology","host_organization_lineage":["https://openalex.org/I122411786"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},{"id":"doi:10.7907/db29-am33","is_oa":true,"landing_page_url":"https://doi.org/10.7907/db29-am33","pdf_url":null,"source":{"id":"https://openalex.org/S7407050848","display_name":"Caltech Library","issn_l":null,"issn":[],"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":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"thesis"}],"best_oa_location":{"id":"pmh:oai:thesis.library.caltech.edu:13856","is_oa":true,"landing_page_url":null,"pdf_url":"https://thesis.library.caltech.edu/13856/1/london_palma_2020.pdf","source":{"id":"https://openalex.org/S4306402402","display_name":"CaltechTHESIS (California Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I122411786","host_organization_name":"California Institute of Technology","host_organization_lineage":["https://openalex.org/I122411786"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W6921727772.pdf"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,76,225,239,269,359],"present":[1,37],"novel,":[2],"efficient":[3,433],"algorithms":[4],"for":[5,90,99,112,214,337,383,395,431],"solving":[6,434],"extremely":[7],"large":[8],"optimization":[9,31,41,216],"problems.":[10,32,42],"A":[11],"significant":[12],"bottleneck":[13,343],"today":[14],"is":[15,46,106,115,133,149,154,273,346],"that":[16,190,271,307,312,375,416],"as":[17,52],"the":[18,81,126,137,178,181,184,231,237,244,249,256,259,279,308,347,365,396,403,407,421,425],"size":[19],"of":[20,58,110,128,139,183,201,251,258,286,293,313,354,406,424,438],"datasets":[21],"grow,":[22],"researchers":[23],"across":[24],"disciplines":[25],"desire":[26],"to":[27,39,47,66,80,121,157,248,278,349,363],"solve":[28,350],"prohibitively":[29],"massive":[30],"In":[33,123,142,291,385,412],"this":[34,78,147,272],"thesis,":[35],"we":[36,86,172,188,209,324,387,414],"methods":[38],"compress":[40],"The":[43,261,340],"general":[44],"goal":[45],"represent":[48],"a":[49,53,88,108,143,205,211,227,299,328,351,389,436],"huge":[50],"problem":[51,55,232],"smaller":[54,59,135],"or":[56,119],"set":[57],"problems,":[60],"while":[61,164,203,318],"still":[62],"retaining":[63],"enough":[64],"information":[65],"ensure":[67],"provable":[68],"guarantees":[69,175,242],"on":[70,107,176,243,435],"solution":[71,185,294],"quality":[72,182,257],"and":[73,96,160,180,255,326,428],"run":[74],"time.":[75],"apply":[77],"approach":[79,213,418],"following":[82],"three":[83],"settings.":[84],"First,":[85],"propose":[87,210,325,388],"framework":[89,192],"accelerating":[91],"both":[92,177],"linear":[93,102,338,352,366,397,426],"program":[94],"solvers":[95,98,197,380],"convex":[97],"problems":[100,111,374],"with":[101,246,266],"constraints.":[103],"Our":[104,399],"focus":[105],"class":[109],"which":[113,217,230],"data":[114,129,233],"either":[116],"very":[117],"costly,":[118],"hard":[120],"obtain.":[122],"these":[124],"situations,":[125],"number":[127,138,405,423],"points":[130],"m":[131],"available":[132],"much":[134],"than":[136,222],"variables,":[140],"n.":[141],"machine":[144],"learning":[145],"setting,":[146],"regime":[148],"increasingly":[150],"prevalent":[151],"since":[152],"it":[153,253],"often":[155],"advantageous":[156],"consider":[158,226],"larger":[159,161],"feature":[162],"spaces,":[163],"not":[165],"necessarily":[166],"obtaining":[167],"proportionally":[168],"more":[169,432],"data.":[170],"Analytically,":[171],"provide":[173,240],"worst-case":[174,241],"runtime":[179],"produced.":[186],"Empirically,":[187],"show":[189],"our":[191,296,417],"speeds":[193],"up":[194],"state-of-the-art":[195],"commercial":[196],"by":[198,370],"two":[199],"orders":[200],"magnitude,":[202],"maintaining":[204],"near-optimal":[206],"solution.":[207,260,303],"Second,":[208],"novel":[212],"distributed":[215,235],"uses":[218,263],"far":[219],"fewer":[220],"messages":[221,265],"existing":[223],"methods.":[224],"setting":[228],"in":[229,315,344,381],"are":[234],"over":[236],"nodes.":[238],"performance":[245],"respect":[247],"amount":[250],"communication":[252,281],"requires":[254],"algorithm":[262,297],"O(log(n+m))":[264],"high":[267],"probability.":[268],"note":[270],"an":[274],"exponential":[275],"reduction":[276],"compared":[277],"O(n)":[280],"required":[282],"during":[283],"each":[284,357],"round":[285],"traditional":[287],"consensus":[288],"based":[289],"approaches.":[290],"terms":[292],"quality,":[295],"produces":[298],"feasible,":[300],"near":[301],"optimal":[302],"Numeric":[304],"results":[305],"demonstrate":[306,415],"approximation":[309],"error":[310],"matches":[311],"ADMM":[314],"many":[316],"cases,":[317],"using":[319,378],"orders-of-magnitude":[320],"less":[321],"communication.":[322],"Lastly,":[323],"analyze":[327],"provably":[329,410],"accurate":[330],"long-step":[331],"infeasible":[332],"Interior":[333],"Point":[334],"Algorithm":[335],"(IPM)":[336],"programming.":[339],"core":[341],"computational":[342],"IPMs":[345,382],"need":[348],"system":[353,367,409],"equations":[355],"at":[356],"iteration.":[358],"employ":[360],"sketching":[361,400],"techniques":[362],"make":[364],"computation":[368],"lighter,":[369],"handling":[371],"well-known":[372],"ill-conditioning":[373],"occur":[376],"when":[377],"iterative":[379,393],"LPs.":[384],"particular,":[386],"preconditioned":[390,408],"Conjugate":[391],"Gradient":[392],"solver":[394],"system.":[398],"strategy":[401],"makes":[402],"condition":[404,422],"small.":[411],"practice":[413],"significantly":[419],"reduces":[420],"system,":[427],"thus":[429],"allows":[430],"range":[437],"benchmark":[439],"datasets.":[440]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2025-10-10T00:00:00"}