{"id":"https://openalex.org/W2120467101","doi":"https://doi.org/10.1137/110854400","title":"A First-Order Smoothing Technique for a Class of Large-Scale Linear Programs","display_name":"A First-Order Smoothing Technique for a Class of Large-Scale Linear Programs","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2120467101","doi":"https://doi.org/10.1137/110854400","mag":"2120467101"},"language":"en","primary_location":{"id":"doi:10.1137/110854400","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110854400","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":["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/A5019122349","display_name":"Jieqiu Chen","orcid":null},"institutions":[{"id":"https://openalex.org/I1282105669","display_name":"Argonne National Laboratory","ror":"https://ror.org/05gvnxz63","country_code":"US","type":"facility","lineage":["https://openalex.org/I1282105669","https://openalex.org/I1330989302","https://openalex.org/I39565521","https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jieqiu Chen","raw_affiliation_strings":["argonne national laboratory"],"affiliations":[{"raw_affiliation_string":"argonne national laboratory","institution_ids":["https://openalex.org/I1282105669"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002663715","display_name":"Samuel Burer","orcid":"https://orcid.org/0000-0001-5886-458X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Samuel Burer","raw_affiliation_strings":["University of Iowa, "],"affiliations":[{"raw_affiliation_string":"University of Iowa, ","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5019122349"],"corresponding_institution_ids":["https://openalex.org/I1282105669"],"apc_list":null,"apc_paid":null,"fwci":0.9461,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.75622014,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"24","issue":"2","first_page":"598","last_page":"620"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":1.0,"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":1.0,"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":1.0,"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.9994999766349792,"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.7257372736930847},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.6470136046409607},{"id":"https://openalex.org/keywords/smoothing","display_name":"Smoothing","score":0.5983924269676208},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5865360498428345},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5786104798316956},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5641784071922302},{"id":"https://openalex.org/keywords/duality-gap","display_name":"Duality gap","score":0.5296891331672668},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.47411397099494934},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.4712907373905182},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.435281366109848},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34511715173721313},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.257293701171875},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.23649922013282776},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1628676950931549}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7257372736930847},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.6470136046409607},{"id":"https://openalex.org/C3770464","wikidata":"https://www.wikidata.org/wiki/Q775963","display_name":"Smoothing","level":2,"score":0.5983924269676208},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5865360498428345},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5786104798316956},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5641784071922302},{"id":"https://openalex.org/C5274546","wikidata":"https://www.wikidata.org/wiki/Q5310264","display_name":"Duality gap","level":3,"score":0.5296891331672668},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.47411397099494934},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.4712907373905182},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.435281366109848},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34511715173721313},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.257293701171875},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.23649922013282776},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1628676950931549},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"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/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/110854400","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110854400","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W2870135","https://openalex.org/W182881619","https://openalex.org/W1510190958","https://openalex.org/W1980392196","https://openalex.org/W2000955051","https://openalex.org/W2023722580","https://openalex.org/W2042860556","https://openalex.org/W2060649248","https://openalex.org/W2076428552","https://openalex.org/W2088411705","https://openalex.org/W2099891036","https://openalex.org/W2108004390","https://openalex.org/W2109943925","https://openalex.org/W2121210949","https://openalex.org/W2130698119","https://openalex.org/W2153631847","https://openalex.org/W2164933608","https://openalex.org/W2167732364","https://openalex.org/W2169713291","https://openalex.org/W2170744156","https://openalex.org/W3120740533","https://openalex.org/W3124114587","https://openalex.org/W3141595720"],"related_works":["https://openalex.org/W1978572805","https://openalex.org/W2383807498","https://openalex.org/W1997992934","https://openalex.org/W1987225439","https://openalex.org/W4238188170","https://openalex.org/W2125114371","https://openalex.org/W2019977573","https://openalex.org/W2149980199","https://openalex.org/W2053271671","https://openalex.org/W1991078291"],"abstract_inverted_index":{"We":[0,56],"study":[1],"a":[2,20,39],"class":[3],"of":[4,33,68,79],"linear":[5],"programming":[6],"(LP)":[7],"problems":[8,75],"motivated":[9],"by":[10],"large-scale":[11],"machine":[12,73],"learning":[13,74],"applications.":[14],"After":[15],"reformulating":[16],"the":[17,34,48,64,80],"LP":[18],"as":[19],"convex":[21],"nonsmooth":[22],"problem,":[23],"we":[24,45],"apply":[25],"Nesterov's":[26],"primal-dual":[27],"excessive-gap":[28,35,81],"technique.":[29],"The":[30,66],"iteration":[31],"complexity":[32],"technique":[36,82],"depends":[37],"on":[38],"parameter":[40],"$\\theta$":[41,60],"that":[42],"arises":[43],"because":[44],"must":[46],"bound":[47],"primal":[49],"feasible":[50],"set,":[51],"which":[52],"is":[53],"originally":[54],"unbounded.":[55],"also":[57],"dynamically":[58],"update":[59],"to":[61,71],"speed":[62],"up":[63],"convergence.":[65],"application":[67],"our":[69],"algorithm":[70],"two":[72],"demonstrates":[76],"several":[77],"advantages":[78],"over":[83],"existing":[84],"methods.":[85]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}