{"id":"https://openalex.org/W2510358906","doi":"https://doi.org/10.1137/16m1092015","title":"A First-Order Primal-Dual Algorithm with Linesearch","display_name":"A First-Order Primal-Dual Algorithm with Linesearch","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2510358906","doi":"https://doi.org/10.1137/16m1092015","mag":"2510358906"},"language":"en","primary_location":{"id":"doi:10.1137/16m1092015","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1092015","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/1608.08883","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108689235","display_name":"Yura Malitsky","orcid":null},"institutions":[{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Yura Malitsky","raw_affiliation_strings":["Institute for Computer Graphics and Vision, Graz University of Technology, 8010 Graz,Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Computer Graphics and Vision, Graz University of Technology, 8010 Graz,Austria","institution_ids":["https://openalex.org/I4092182"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5032205387","display_name":"Thomas Pock","orcid":"https://orcid.org/0000-0001-6120-1058"},"institutions":[{"id":"https://openalex.org/I4092182","display_name":"Graz University of Technology","ror":"https://ror.org/00d7xrm67","country_code":"AT","type":"education","lineage":["https://openalex.org/I4092182"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Thomas Pock","raw_affiliation_strings":["Institute for Computer Graphics and Vision, Graz University of Technology, 8010 Graz,Austria"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Computer Graphics and Vision, Graz University of Technology, 8010 Graz,Austria","institution_ids":["https://openalex.org/I4092182"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4092182"],"apc_list":null,"apc_paid":null,"fwci":18.9976,"has_fulltext":true,"cited_by_count":132,"citation_normalized_percentile":{"value":0.99840595,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"28","issue":"1","first_page":"411","last_page":"432"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998000264167786,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9986000061035156,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.9980999827384949,"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/mathematics","display_name":"Mathematics","score":0.8232207298278809},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.6682441830635071},{"id":"https://openalex.org/keywords/saddle-point","display_name":"Saddle point","score":0.6506684422492981},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.5543472170829773},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5382772088050842},{"id":"https://openalex.org/keywords/ergodic-theory","display_name":"Ergodic theory","score":0.4766674339771271},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47236281633377075},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4453773498535156},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4278794527053833},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4205533564090729},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.3493126928806305},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.21875670552253723},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.14460960030555725},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.061859846115112305}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8232207298278809},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.6682441830635071},{"id":"https://openalex.org/C2681867","wikidata":"https://www.wikidata.org/wiki/Q690935","display_name":"Saddle point","level":2,"score":0.6506684422492981},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.5543472170829773},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5382772088050842},{"id":"https://openalex.org/C122044880","wikidata":"https://www.wikidata.org/wiki/Q5498822","display_name":"Ergodic theory","level":2,"score":0.4766674339771271},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47236281633377075},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4453773498535156},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4278794527053833},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4205533564090729},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3493126928806305},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.21875670552253723},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.14460960030555725},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.061859846115112305},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","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/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","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":2,"locations":[{"id":"doi:10.1137/16m1092015","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1092015","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:1608.08883","is_oa":true,"landing_page_url":"https://arxiv.org/abs/1608.08883","pdf_url":"https://arxiv.org/pdf/1608.08883","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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:1608.08883","is_oa":true,"landing_page_url":"https://arxiv.org/abs/1608.08883","pdf_url":"https://arxiv.org/pdf/1608.08883","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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/G4318390797","display_name":"Efficient algorithms for nonsmooth optimization in imaging","funder_award_id":"I1148","funder_id":"https://openalex.org/F4320321181","funder_display_name":"Austrian Science Fund"}],"funders":[{"id":"https://openalex.org/F4320321181","display_name":"Austrian Science Fund","ror":"https://ror.org/013tf3c58"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W205960364","https://openalex.org/W1562101002","https://openalex.org/W1856374787","https://openalex.org/W1874232560","https://openalex.org/W1922442141","https://openalex.org/W1998991750","https://openalex.org/W2021548137","https://openalex.org/W2039957107","https://openalex.org/W2055467852","https://openalex.org/W2092663520","https://openalex.org/W2100556411","https://openalex.org/W2114423093","https://openalex.org/W2126607811","https://openalex.org/W2158449358","https://openalex.org/W2183572835","https://openalex.org/W2241435520","https://openalex.org/W2405803404","https://openalex.org/W2516732819","https://openalex.org/W2559655401","https://openalex.org/W2950866122","https://openalex.org/W2951718507","https://openalex.org/W3101497372","https://openalex.org/W4229650096","https://openalex.org/W4300678681"],"related_works":["https://openalex.org/W2390585021","https://openalex.org/W412641959","https://openalex.org/W50969306","https://openalex.org/W4292101436","https://openalex.org/W2341040961","https://openalex.org/W4287207389","https://openalex.org/W2779828239","https://openalex.org/W2558128491","https://openalex.org/W2898838759","https://openalex.org/W3200004281"],"abstract_inverted_index":{"The":[0],"paper":[1],"proposes":[2],"a":[3,6,84,91,94],"linesearch":[4,13,34,92],"for":[5,29,61,93],"primal-dual":[7],"method.":[8,63],"Each":[9],"iteration":[10],"of":[11,17,45,59,71,108],"the":[12,19,33,46,65,72,106],"requires":[14],"an":[15,55,98],"update":[16],"only":[18],"dual":[20],"(or":[21],"primal)":[22],"variable.":[23],"For":[24],"many":[25],"problems,":[26],"in":[27],"particular":[28],"regularized":[30],"least":[31],"squares,":[32],"does":[35],"not":[36],"require":[37],"any":[38],"additional":[39,99],"matrix-vector":[40],"multiplications.":[41],"We":[42,52],"prove":[43],"convergence":[44,60,86],"proposed":[47,110],"method":[48,81],"under":[49],"standard":[50],"assumptions.":[51],"also":[53],"show":[54],"ergodic":[56],"$O(1/N)$":[57],"rate":[58],"our":[62,79,109],"In":[64],"case":[66],"when":[67],"one":[68],"or":[69],"both":[70],"prox-functions":[73],"are":[74],"strongly":[75],"convex,":[76],"we":[77,89],"modify":[78],"basic":[80],"to":[82],"get":[83],"better":[85],"rate.":[87],"Finally,":[88],"propose":[90],"saddle-point":[95],"problem":[96],"with":[97],"smooth":[100],"term.":[101],"Several":[102],"numerical":[103],"experiments":[104],"confirm":[105],"efficiency":[107],"methods.":[111]},"counts_by_year":[{"year":2026,"cited_by_count":11},{"year":2025,"cited_by_count":16},{"year":2024,"cited_by_count":12},{"year":2023,"cited_by_count":14},{"year":2022,"cited_by_count":15},{"year":2021,"cited_by_count":23},{"year":2020,"cited_by_count":14},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":5}],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2025-10-10T00:00:00"}