{"id":"https://openalex.org/W2883309838","doi":"https://doi.org/10.1137/17m1125157","title":"An Inexact Variable Metric Proximal Point Algorithm for Generic Quasi-Newton Acceleration","display_name":"An Inexact Variable Metric Proximal Point Algorithm for Generic Quasi-Newton Acceleration","publication_year":2019,"publication_date":"2019-01-01","ids":{"openalex":"https://openalex.org/W2883309838","doi":"https://doi.org/10.1137/17m1125157","mag":"2883309838"},"language":"en","primary_location":{"id":"doi:10.1137/17m1125157","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1125157","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/1610.00960","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5083701507","display_name":"Hongzhou Lin","orcid":"https://orcid.org/0000-0002-1226-9029"},"institutions":[{"id":"https://openalex.org/I126820664","display_name":"Vassar College","ror":"https://ror.org/022x6qg61","country_code":"US","type":"education","lineage":["https://openalex.org/I126820664"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Hongzhou Lin","raw_affiliation_strings":["Thoth  - Apprentissage de mod\u00e8les \u00e0 partir de donn\u00e9es massives (France)","CSAIL - Computer Science and Artificial Intelligence Laboratory [Cambridge] (The Stata Center, Building 32 32 Vassar Street Cambridge, MA 02139 - United States)"],"affiliations":[{"raw_affiliation_string":"Thoth  - Apprentissage de mod\u00e8les \u00e0 partir de donn\u00e9es massives (France)","institution_ids":[]},{"raw_affiliation_string":"CSAIL - Computer Science and Artificial Intelligence Laboratory [Cambridge] (The Stata Center, Building 32 32 Vassar Street Cambridge, MA 02139 - United States)","institution_ids":["https://openalex.org/I126820664"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5062817741","display_name":"Julien Mairal","orcid":"https://orcid.org/0000-0001-6991-2110"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Julien Mairal","raw_affiliation_strings":["Thoth  - Apprentissage de mod\u00e8les \u00e0 partir de donn\u00e9es massives (France)"],"affiliations":[{"raw_affiliation_string":"Thoth  - Apprentissage de mod\u00e8les \u00e0 partir de donn\u00e9es massives (France)","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010613767","display_name":"Za\u00efd Harchaoui","orcid":"https://orcid.org/0000-0003-1186-1343"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Zaid Harchaoui","raw_affiliation_strings":["University of Washington [Seattle] (Seattle, Washington 98105 - United States)"],"affiliations":[{"raw_affiliation_string":"University of Washington [Seattle] (Seattle, Washington 98105 - United States)","institution_ids":["https://openalex.org/I201448701"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5083701507"],"corresponding_institution_ids":["https://openalex.org/I126820664"],"apc_list":null,"apc_paid":null,"fwci":0.7001,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.76802106,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"29","issue":"2","first_page":"1408","last_page":"1443"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9998999834060669,"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.9998999834060669,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9865999817848206,"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.7087780237197876},{"id":"https://openalex.org/keywords/broyden\u2013fletcher\u2013goldfarb\u2013shanno-algorithm","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","score":0.6128709316253662},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5848040580749512},{"id":"https://openalex.org/keywords/proximal-gradient-methods","display_name":"Proximal Gradient Methods","score":0.5778738856315613},{"id":"https://openalex.org/keywords/regularization","display_name":"Regularization (linguistics)","score":0.554915189743042},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5531981587409973},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.5435178279876709},{"id":"https://openalex.org/keywords/metric","display_name":"Metric (unit)","score":0.5283268690109253},{"id":"https://openalex.org/keywords/proximal-gradient-methods-for-learning","display_name":"Proximal gradient methods for learning","score":0.513542652130127},{"id":"https://openalex.org/keywords/frank\u2013wolfe-algorithm","display_name":"Frank\u2013Wolfe algorithm","score":0.4966335892677307},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.4773419201374054},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.46682021021842957},{"id":"https://openalex.org/keywords/stochastic-gradient-descent","display_name":"Stochastic gradient descent","score":0.4532817006111145},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4334769546985626},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.4332493245601654},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4151262044906616},{"id":"https://openalex.org/keywords/acceleration","display_name":"Acceleration","score":0.4135814607143402},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.32387107610702515},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2616519331932068},{"id":"https://openalex.org/keywords/convex-combination","display_name":"Convex combination","score":0.14394834637641907},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11706399917602539},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.11359471082687378},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.09143069386482239}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7087780237197876},{"id":"https://openalex.org/C132721684","wikidata":"https://www.wikidata.org/wiki/Q2877013","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","level":3,"score":0.6128709316253662},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5848040580749512},{"id":"https://openalex.org/C10494615","wikidata":"https://www.wikidata.org/wiki/Q17086765","display_name":"Proximal Gradient Methods","level":4,"score":0.5778738856315613},{"id":"https://openalex.org/C2776135515","wikidata":"https://www.wikidata.org/wiki/Q17143721","display_name":"Regularization (linguistics)","level":2,"score":0.554915189743042},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5531981587409973},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.5435178279876709},{"id":"https://openalex.org/C176217482","wikidata":"https://www.wikidata.org/wiki/Q860554","display_name":"Metric (unit)","level":2,"score":0.5283268690109253},{"id":"https://openalex.org/C79248915","wikidata":"https://www.wikidata.org/wiki/Q17086776","display_name":"Proximal gradient methods for learning","level":5,"score":0.513542652130127},{"id":"https://openalex.org/C122268817","wikidata":"https://www.wikidata.org/wiki/Q2020318","display_name":"Frank\u2013Wolfe algorithm","level":5,"score":0.4966335892677307},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.4773419201374054},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.46682021021842957},{"id":"https://openalex.org/C206688291","wikidata":"https://www.wikidata.org/wiki/Q7617819","display_name":"Stochastic gradient descent","level":3,"score":0.4532817006111145},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4334769546985626},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.4332493245601654},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4151262044906616},{"id":"https://openalex.org/C117896860","wikidata":"https://www.wikidata.org/wiki/Q11376","display_name":"Acceleration","level":2,"score":0.4135814607143402},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.32387107610702515},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2616519331932068},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.14394834637641907},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11706399917602539},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.11359471082687378},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.09143069386482239},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.0},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","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/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","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},{"id":"https://openalex.org/C74650414","wikidata":"https://www.wikidata.org/wiki/Q11397","display_name":"Classical mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/17m1125157","is_oa":false,"landing_page_url":"https://doi.org/10.1137/17m1125157","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:1610.00960","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1610.00960","pdf_url":"https://arxiv.org/pdf/1610.00960","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":"","raw_type":"text"},{"id":"pmh:oai:HAL:hal-01376079v4","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-01376079","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Optimization, 2019, 29 (2), pp.1408-1443. ⟨10.1137/17M1125157⟩","raw_type":"Journal articles"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1610.00960","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1610.00960","pdf_url":"https://arxiv.org/pdf/1610.00960","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":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3872856709","display_name":null,"funder_award_id":"714381","funder_id":"https://openalex.org/F4320338335","funder_display_name":"H2020 European Research Council"},{"id":"https://openalex.org/G754625635","display_name":null,"funder_award_id":"ANR-14-CE23-0003-01","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320309949","display_name":"Canadian Institute for Advanced Research","ror":"https://ror.org/01sdtdd95"},{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320338335","display_name":"H2020 European Research Council","ror":"https://ror.org/0472cxd90"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":37,"referenced_works":["https://openalex.org/W1751687266","https://openalex.org/W1972010412","https://openalex.org/W2015163302","https://openalex.org/W2021789026","https://openalex.org/W2030161963","https://openalex.org/W2036748616","https://openalex.org/W2037679050","https://openalex.org/W2038497950","https://openalex.org/W2040017185","https://openalex.org/W2045968916","https://openalex.org/W2047152541","https://openalex.org/W2050968963","https://openalex.org/W2051434435","https://openalex.org/W2051669046","https://openalex.org/W2057681237","https://openalex.org/W2061570747","https://openalex.org/W2075146859","https://openalex.org/W2095984592","https://openalex.org/W2100556411","https://openalex.org/W2112820497","https://openalex.org/W2117686388","https://openalex.org/W2118545728","https://openalex.org/W2120717492","https://openalex.org/W2122825543","https://openalex.org/W2137633966","https://openalex.org/W2153635508","https://openalex.org/W2162870776","https://openalex.org/W2167732364","https://openalex.org/W2951948474","https://openalex.org/W2962720772","https://openalex.org/W2962748029","https://openalex.org/W2963156201","https://openalex.org/W2963573197","https://openalex.org/W2963941964","https://openalex.org/W3101644375","https://openalex.org/W3103657382","https://openalex.org/W4206310440"],"related_works":["https://openalex.org/W2963086517","https://openalex.org/W2564735875","https://openalex.org/W3123504125","https://openalex.org/W3147739796","https://openalex.org/W1983212821","https://openalex.org/W3000303000","https://openalex.org/W2970498479","https://openalex.org/W1543207628","https://openalex.org/W2034189051","https://openalex.org/W313469610"],"abstract_inverted_index":{"We":[0,91],"propose":[1],"an":[2],"inexact":[3],"variable-metric":[4],"proximal":[5],"point":[6],"algorithm":[7,33],"to":[8,22,53],"accelerate":[9],"gradient-based":[10],"optimization":[11,38,78],"algorithms.":[12,39],"The":[13],"proposed":[14],"scheme,":[15],"called":[16],"QNing,":[17],"can":[18],"notably":[19],"be":[20],"applied":[21],"incremental":[23,37],"first-order":[24],"methods":[25,102,107],"such":[26],"as":[27],"the":[28,51,59],"stochastic":[29],"variance-reduced":[30],"gradient":[31],"descent":[32],"and":[34,111],"other":[35],"randomized":[36],"QNing":[40,71,96],"is":[41,72],"also":[42],"compatible":[43],"with":[44,67],"composite":[45],"objectives,":[46],"meaning":[47],"that":[48],"it":[49],"has":[50],"ability":[52],"provide":[54],"exactly":[55],"sparse":[56],"solutions":[57],"when":[58],"objective":[60],"involves":[61],"a":[62,82],"sparsity-inducing":[63],"regularization.":[64],"When":[65],"combined":[66],"limited-memory":[68],"BFGS":[69],"rules,":[70],"particularly":[73],"effective":[74],"at":[75],"solving":[76],"high-dimensional":[77],"problems":[79],"while":[80],"enjoying":[81],"worst-case":[83],"linear":[84],"convergence":[85],"rate":[86],"for":[87,103],"strongly":[88],"convex":[89],"problems.":[90],"present":[92],"experimental":[93],"results":[94],"where":[95],"gives":[97],"significant":[98],"improvements":[99],"over":[100],"competing":[101],"training":[104],"machine":[105],"learning":[106],"on":[108],"large":[109],"samples":[110],"in":[112],"high":[113],"dimensions.":[114]},"counts_by_year":[{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}