{"id":"https://openalex.org/W3012187907","doi":"https://doi.org/10.1080/10556788.2020.1734806","title":"Projection-free accelerated method for convex optimization","display_name":"Projection-free accelerated method for convex optimization","publication_year":2020,"publication_date":"2020-03-09","ids":{"openalex":"https://openalex.org/W3012187907","doi":"https://doi.org/10.1080/10556788.2020.1734806","mag":"3012187907"},"language":"en","primary_location":{"id":"doi:10.1080/10556788.2020.1734806","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2020.1734806","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-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/A5005897658","display_name":"Max L. N. Gon\u00e7alves","orcid":"https://orcid.org/0000-0001-9563-1101"},"institutions":[{"id":"https://openalex.org/I68106152","display_name":"Universidade Federal de Goi\u00e1s","ror":"https://ror.org/0039d5757","country_code":"BR","type":"education","lineage":["https://openalex.org/I68106152"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Max L. N. Gon\u00e7alves","raw_affiliation_strings":["IME, Universidade Federal de Goi\u00e1s, Goi\u00e2nia-GO, Brazil"],"affiliations":[{"raw_affiliation_string":"IME, Universidade Federal de Goi\u00e1s, Goi\u00e2nia-GO, Brazil","institution_ids":["https://openalex.org/I68106152"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077524400","display_name":"Jefferson G. Melo","orcid":"https://orcid.org/0000-0002-9659-5437"},"institutions":[{"id":"https://openalex.org/I68106152","display_name":"Universidade Federal de Goi\u00e1s","ror":"https://ror.org/0039d5757","country_code":"BR","type":"education","lineage":["https://openalex.org/I68106152"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Jefferson G. Melo","raw_affiliation_strings":["IME, Universidade Federal de Goi\u00e1s, Goi\u00e2nia-GO, Brazil"],"affiliations":[{"raw_affiliation_string":"IME, Universidade Federal de Goi\u00e1s, Goi\u00e2nia-GO, Brazil","institution_ids":["https://openalex.org/I68106152"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108765688","display_name":"Renato D. C. Monteiro","orcid":null},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Renato D. C. Monteiro","raw_affiliation_strings":["School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA"],"affiliations":[{"raw_affiliation_string":"School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA, USA","institution_ids":["https://openalex.org/I130701444"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5077524400"],"corresponding_institution_ids":["https://openalex.org/I68106152"],"apc_list":null,"apc_paid":null,"fwci":0.8803,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.67929853,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"37","issue":"1","first_page":"214","last_page":"240"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9990000128746033,"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.998199999332428,"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.7458173036575317},{"id":"https://openalex.org/keywords/frank\u2013wolfe-algorithm","display_name":"Frank\u2013Wolfe algorithm","score":0.7085955142974854},{"id":"https://openalex.org/keywords/projection","display_name":"Projection (relational algebra)","score":0.6811035871505737},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5984622836112976},{"id":"https://openalex.org/keywords/proximal-gradient-methods","display_name":"Proximal Gradient Methods","score":0.5649783611297607},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.545903742313385},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.5281835794448853},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5138576030731201},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4917810261249542},{"id":"https://openalex.org/keywords/projection-method","display_name":"Projection method","score":0.4777223765850067},{"id":"https://openalex.org/keywords/gradient-method","display_name":"Gradient method","score":0.46003636717796326},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45854002237319946},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.41926804184913635},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.387138307094574},{"id":"https://openalex.org/keywords/dykstras-projection-algorithm","display_name":"Dykstra's projection algorithm","score":0.3609665036201477},{"id":"https://openalex.org/keywords/convex-set","display_name":"Convex set","score":0.2999788522720337},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2790074348449707},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19888707995414734},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09820356965065002}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7458173036575317},{"id":"https://openalex.org/C122268817","wikidata":"https://www.wikidata.org/wiki/Q2020318","display_name":"Frank\u2013Wolfe algorithm","level":5,"score":0.7085955142974854},{"id":"https://openalex.org/C57493831","wikidata":"https://www.wikidata.org/wiki/Q3134666","display_name":"Projection (relational algebra)","level":2,"score":0.6811035871505737},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5984622836112976},{"id":"https://openalex.org/C10494615","wikidata":"https://www.wikidata.org/wiki/Q17086765","display_name":"Proximal Gradient Methods","level":4,"score":0.5649783611297607},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.545903742313385},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.5281835794448853},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5138576030731201},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4917810261249542},{"id":"https://openalex.org/C65557600","wikidata":"https://www.wikidata.org/wiki/Q7249451","display_name":"Projection method","level":3,"score":0.4777223765850067},{"id":"https://openalex.org/C115680565","wikidata":"https://www.wikidata.org/wiki/Q5977448","display_name":"Gradient method","level":2,"score":0.46003636717796326},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45854002237319946},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.41926804184913635},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.387138307094574},{"id":"https://openalex.org/C202426404","wikidata":"https://www.wikidata.org/wiki/Q5318686","display_name":"Dykstra's projection algorithm","level":2,"score":0.3609665036201477},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.2999788522720337},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2790074348449707},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19888707995414734},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09820356965065002},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556788.2020.1734806","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556788.2020.1734806","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2446161","display_name":null,"funder_award_id":"408123/2018-4","funder_id":"https://openalex.org/F4320322025","funder_display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico"},{"id":"https://openalex.org/G4655343114","display_name":null,"funder_award_id":"1300221","funder_id":"https://openalex.org/F4320337391","funder_display_name":"Division of Civil, Mechanical and Manufacturing Innovation"},{"id":"https://openalex.org/G885840003","display_name":null,"funder_award_id":"201710267000532","funder_id":"https://openalex.org/F4320323204","funder_display_name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de Goi\u00e1s"},{"id":"https://openalex.org/G889269575","display_name":null,"funder_award_id":"302666/2017-6","funder_id":"https://openalex.org/F4320322025","funder_display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico"}],"funders":[{"id":"https://openalex.org/F4320322025","display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","ror":"https://ror.org/03swz6y49"},{"id":"https://openalex.org/F4320323204","display_name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de Goi\u00e1s","ror":"https://ror.org/00w8cq239"},{"id":"https://openalex.org/F4320337391","display_name":"Division of Civil, Mechanical and Manufacturing Innovation","ror":"https://ror.org/028yd4c30"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W905619","https://openalex.org/W1969244384","https://openalex.org/W1994569450","https://openalex.org/W2003146967","https://openalex.org/W2012769612","https://openalex.org/W2048841424","https://openalex.org/W2082366275","https://openalex.org/W2124541940","https://openalex.org/W2136885855","https://openalex.org/W2167732364","https://openalex.org/W2188195356","https://openalex.org/W2228647872","https://openalex.org/W2236131147","https://openalex.org/W2565382733","https://openalex.org/W2964177174","https://openalex.org/W4301435544"],"related_works":["https://openalex.org/W3123504125","https://openalex.org/W3147739796","https://openalex.org/W1983212821","https://openalex.org/W3000303000","https://openalex.org/W2364728921","https://openalex.org/W2384324953","https://openalex.org/W4385452046","https://openalex.org/W2378947361","https://openalex.org/W2388201208","https://openalex.org/W2993933029"],"abstract_inverted_index":{"In":[0],"this":[1,103],"paper,":[2],"we":[3],"propose":[4],"a":[5,36,75],"projection-free":[6],"accelerated":[7,22],"method":[8,19,96],"for":[9,93],"solving":[10],"convex":[11],"optimization":[12],"problems":[13],"with":[14],"unbounded":[15],"feasible":[16],"set.":[17],"The":[18],"is":[20,30,44,59],"an":[21,47,99],"gradient":[23,38,65],"scheme":[24,115],"such":[25],"that":[26,46],"each":[27],"projection":[28],"subproblem":[29],"approximately":[31],"solved":[32],"by":[33],"means":[34],"of":[35,56,77,86,112],"conditional":[37],"scheme.":[39],"Under":[40],"reasonable":[41],"assumptions,":[42],"it":[43],"shown":[45],"\u03f5-approximate":[48],"solution":[49,79,101],"(concept":[50],"related":[51],"to":[52,97],"the":[53,57,82,87,94,109,113],"optimal":[54],"value":[55],"problem)":[58],"obtained":[60],"in":[61,102],"at":[62],"most":[63],"O(1/\u03b5)":[64,68],"evaluations":[66],"and":[67,89],"linear":[69],"oracle":[70],"calls.":[71],"We":[72],"also":[73],"discuss":[74],"notion":[76],"approximate":[78,100],"based":[80],"on":[81],"first-order":[83],"optimality":[84],"condition":[85],"problem":[88],"present":[90],"iteration-complexity":[91],"results":[92],"proposed":[95,114],"obtain":[98],"sense.":[104],"Finally,":[105],"numerical":[106],"experiments":[107],"illustrating":[108],"practical":[110],"behaviour":[111],"are":[116],"discussed.":[117]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}