{"id":"https://openalex.org/W2157711174","doi":"https://doi.org/10.5555/1756006.1756045","title":"A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning","display_name":"A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning","publication_year":2010,"publication_date":"2010-03-01","ids":{"openalex":"https://openalex.org/W2157711174","doi":"https://doi.org/10.5555/1756006.1756045","mag":"2157711174"},"language":"en","primary_location":{"id":"pmh:oai:digital.library.adelaide.edu.au:2440/61402","is_oa":false,"landing_page_url":"http://hdl.handle.net/2440/61402","pdf_url":null,"source":{"id":"https://openalex.org/S4306401835","display_name":"Adelaide Research & Scholarship (AR&S) (University of Adelaide)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5681781","host_organization_name":"The University of Adelaide","host_organization_lineage":["https://openalex.org/I5681781"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal article"},"type":"article","indexed_in":[],"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/A5102875979","display_name":"Jin Yu","orcid":"https://orcid.org/0000-0003-3924-8858"},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"The University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Jin Yu","raw_affiliation_strings":["University of Adelaide"],"raw_orcid":"https://orcid.org/0000-0003-3924-8858","affiliations":[{"raw_affiliation_string":"University of Adelaide","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013623933","display_name":"S. V. N. Vishwanathan","orcid":null},"institutions":[{"id":"https://openalex.org/I219193219","display_name":"Purdue University West Lafayette","ror":"https://ror.org/02dqehb95","country_code":"US","type":"education","lineage":["https://openalex.org/I219193219"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. V. N. Vishwanathan","raw_affiliation_strings":["PURDUE UNIVERSITY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"PURDUE UNIVERSITY","institution_ids":["https://openalex.org/I219193219"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090844107","display_name":"Simon G\u00fcnter","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Simon G\u00fcnter","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5020757240","display_name":"Nicol N. Schraudolph","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nicol N. Schraudolph","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.753,"has_fulltext":false,"cited_by_count":97,"citation_normalized_percentile":{"value":0.96785931,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"11","issue":"39","first_page":"1145","last_page":"1200"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9997000098228455,"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.9994000196456909,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9958999752998352,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/broyden\u2013fletcher\u2013goldfarb\u2013shanno-algorithm","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","score":0.8340789079666138},{"id":"https://openalex.org/keywords/hinge-loss","display_name":"Hinge loss","score":0.7751393914222717},{"id":"https://openalex.org/keywords/line-search","display_name":"Line search","score":0.6914187669754028},{"id":"https://openalex.org/keywords/descent-direction","display_name":"Descent direction","score":0.5561641454696655},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5479018688201904},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5130797624588013},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4766683876514435},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.4612198770046234},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.440084308385849},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4365333914756775},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.43043211102485657},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4235434830188751},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3576139807701111},{"id":"https://openalex.org/keywords/gradient-descent","display_name":"Gradient descent","score":0.3230052590370178},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2737317383289337},{"id":"https://openalex.org/keywords/support-vector-machine","display_name":"Support vector machine","score":0.17082682251930237},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.09889531135559082}],"concepts":[{"id":"https://openalex.org/C132721684","wikidata":"https://www.wikidata.org/wiki/Q2877013","display_name":"Broyden\u2013Fletcher\u2013Goldfarb\u2013Shanno algorithm","level":3,"score":0.8340789079666138},{"id":"https://openalex.org/C39891107","wikidata":"https://www.wikidata.org/wiki/Q5767098","display_name":"Hinge loss","level":3,"score":0.7751393914222717},{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.6914187669754028},{"id":"https://openalex.org/C116149140","wikidata":"https://www.wikidata.org/wiki/Q2070951","display_name":"Descent direction","level":4,"score":0.5561641454696655},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5479018688201904},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5130797624588013},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4766683876514435},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.4612198770046234},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.440084308385849},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4365333914756775},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.43043211102485657},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4235434830188751},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3576139807701111},{"id":"https://openalex.org/C153258448","wikidata":"https://www.wikidata.org/wiki/Q1199743","display_name":"Gradient descent","level":3,"score":0.3230052590370178},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2737317383289337},{"id":"https://openalex.org/C12267149","wikidata":"https://www.wikidata.org/wiki/Q282453","display_name":"Support vector machine","level":2,"score":0.17082682251930237},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.09889531135559082},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:digital.library.adelaide.edu.au:2440/61402","is_oa":false,"landing_page_url":"http://hdl.handle.net/2440/61402","pdf_url":null,"source":{"id":"https://openalex.org/S4306401835","display_name":"Adelaide Research & Scholarship (AR&S) (University of Adelaide)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I5681781","host_organization_name":"The University of Adelaide","host_organization_lineage":["https://openalex.org/I5681781"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal article"},{"id":"mag:2157711174","is_oa":false,"landing_page_url":"http://jmlr.csail.mit.edu/papers/volume11/yu10a/yu10a.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S118988714","display_name":"Journal of Machine Learning Research","issn_l":"1532-4435","issn":["1532-4435","1533-7928"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310315718","host_organization_name":"The MIT Press","host_organization_lineage":["https://openalex.org/P4310315718"],"host_organization_lineage_names":["The MIT Press"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Journal of Machine Learning Research","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":35,"referenced_works":["https://openalex.org/W1484982917","https://openalex.org/W1524688041","https://openalex.org/W1545716422","https://openalex.org/W1553702074","https://openalex.org/W1568668329","https://openalex.org/W1581558595","https://openalex.org/W1593384057","https://openalex.org/W1931645998","https://openalex.org/W1983599491","https://openalex.org/W1988849934","https://openalex.org/W2001674163","https://openalex.org/W2008571296","https://openalex.org/W2009593947","https://openalex.org/W2020590137","https://openalex.org/W2025732832","https://openalex.org/W2028747718","https://openalex.org/W2035720976","https://openalex.org/W2051434435","https://openalex.org/W2064575768","https://openalex.org/W2089559088","https://openalex.org/W2105636360","https://openalex.org/W2105644991","https://openalex.org/W2105842272","https://openalex.org/W2107753812","https://openalex.org/W2112530506","https://openalex.org/W2115364117","https://openalex.org/W2147898188","https://openalex.org/W2167732364","https://openalex.org/W2296319761","https://openalex.org/W2318189574","https://openalex.org/W2399947893","https://openalex.org/W2407148655","https://openalex.org/W2798766386","https://openalex.org/W3029645440","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W3029645440","https://openalex.org/W1983599491","https://openalex.org/W2100556411","https://openalex.org/W2118163005","https://openalex.org/W2952865723","https://openalex.org/W2296319761","https://openalex.org/W2135046866","https://openalex.org/W2126607811","https://openalex.org/W3141595720","https://openalex.org/W2167732364","https://openalex.org/W2051434435","https://openalex.org/W56897548","https://openalex.org/W2798766386","https://openalex.org/W2109449402","https://openalex.org/W2000359198","https://openalex.org/W1994616650","https://openalex.org/W2146502635","https://openalex.org/W2107438106","https://openalex.org/W2039050532","https://openalex.org/W2028349405"],"abstract_inverted_index":{"We":[0,50,68,102,132],"extend":[1,84,120],"the":[2,13,34,38,45,57,79,88,127,135],"well-known":[3],"BFGS":[4,31],"quasi-Newton":[5],"method":[6,125],"and":[7,44,90,109,129],"its":[8,70,104],"memory-limited":[9,71],"variant":[10,72],"LBFGS":[11],"to":[12,32,74,87,119,126,141,156],"optimization":[14],"of":[15,30,40,138,166,175],"nonsmooth":[16],"convex":[17],"objectives.":[18],"This":[19],"is":[20,61,178],"done":[21],"in":[22,64],"a":[23,41,95,121,164],"rigorous":[24],"fashion":[25],"by":[26],"generalizing":[27],"three":[28],"components":[29],"subdifferentials:":[33],"local":[35],"quadratic":[36],"model,":[37],"identification":[39],"descent":[42],"direction,":[43],"Wolfe":[46],"line":[47,99,113],"search":[48,100,114],"conditions.":[49],"prove":[51,103],"that":[52,111],"under":[53],"some":[54],"technical":[55],"conditions,":[56],"resulting":[58],"subBFGS":[59],"algorithm":[60,86,140],"globally":[62],"convergent":[63],"objective":[65],"function":[66],"value.":[67],"apply":[69,134],"(subLBFGS)":[73],"L2-regularized":[75],"risk":[76,143],"minimization":[77,144],"with":[78,145],"binary":[80],"hinge":[81],"loss.":[82,147],"To":[83],"our":[85,112,139,152,176],"multiclass":[89,128],"multilabel":[91,130],"settings,":[92],"we":[93],"develop":[94],"new,":[96],"efficient,":[97],"exact":[98],"algorithm.":[101],"worst-case":[105],"time":[106],"complexity":[107],"bounds,":[108],"show":[110],"can":[115],"also":[116,133],"be":[117],"used":[118],"recently":[122],"developed":[123],"bundle":[124],"settings.":[131],"direction-finding":[136],"component":[137],"L1-regularized":[142],"logistic":[146],"In":[148],"all":[149],"these":[150],"contexts":[151],"methods":[153],"perform":[154],"comparable":[155],"or":[157],"better":[158],"than":[159],"specialized":[160],"state-of-the-art":[161],"solvers":[162],"on":[163],"number":[165],"publicly":[167],"available":[168],"data":[169],"sets.":[170],"An":[171],"open":[172],"source":[173],"implementation":[174],"algorithms":[177],"freely":[179],"available.":[180]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":13},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":5}],"updated_date":"2026-08-08T01:25:22.217667","created_date":"2025-10-10T00:00:00"}