{"id":"https://openalex.org/W2782737825","doi":"https://doi.org/10.1109/allerton.2017.8262870","title":"Sequential smoothing framework for convex-concave saddle point problems with application to large-scale constrained optimization","display_name":"Sequential smoothing framework for convex-concave saddle point problems with application to large-scale constrained optimization","publication_year":2017,"publication_date":"2017-10-01","ids":{"openalex":"https://openalex.org/W2782737825","doi":"https://doi.org/10.1109/allerton.2017.8262870","mag":"2782737825"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2017.8262870","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2017.8262870","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-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/A5043926494","display_name":"Le Thi Khanh Hien","orcid":"https://orcid.org/0000-0003-2532-4637"},"institutions":[{"id":"https://openalex.org/I67357951","display_name":"KIIT University","ror":"https://ror.org/00k8zt527","country_code":"IN","type":"education","lineage":["https://openalex.org/I67357951"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Le Thi Khanh Hien","raw_affiliation_strings":["School of Electrical Engineering RS, KIIT University, Bhubaneswar, India"],"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering RS, KIIT University, Bhubaneswar, India","institution_ids":["https://openalex.org/I67357951"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5019863108","display_name":"William B. Haskell","orcid":"https://orcid.org/0000-0002-9518-4310"},"institutions":[{"id":"https://openalex.org/I20791572","display_name":"Indira Gandhi Institute of Technology","ror":"https://ror.org/0010jkx06","country_code":"IN","type":"education","lineage":["https://openalex.org/I20791572"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"William B. Haskell","raw_affiliation_strings":["Electrical Engineering Department, IGIT, Sarang, Odisha, India"],"affiliations":[{"raw_affiliation_string":"Electrical Engineering Department, IGIT, Sarang, Odisha, India","institution_ids":["https://openalex.org/I20791572"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5043926494"],"corresponding_institution_ids":["https://openalex.org/I67357951"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.20453948,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"16","issue":null,"first_page":"1176","last_page":"1183"},"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.9994999766349792,"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/T11413","display_name":"Risk and Portfolio Optimization","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/saddle-point","display_name":"Saddle point","score":0.7431626915931702},{"id":"https://openalex.org/keywords/smoothing","display_name":"Smoothing","score":0.7387484312057495},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7042810916900635},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5762835144996643},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.5034539103507996},{"id":"https://openalex.org/keywords/saddle","display_name":"Saddle","score":0.4836946129798889},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4835769534111023},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.474504679441452},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4700157940387726},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4545213580131531},{"id":"https://openalex.org/keywords/conic-optimization","display_name":"Conic optimization","score":0.43083661794662476},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4287567734718323},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.427801251411438},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.331822007894516},{"id":"https://openalex.org/keywords/convex-combination","display_name":"Convex combination","score":0.3109712302684784}],"concepts":[{"id":"https://openalex.org/C2681867","wikidata":"https://www.wikidata.org/wiki/Q690935","display_name":"Saddle point","level":2,"score":0.7431626915931702},{"id":"https://openalex.org/C3770464","wikidata":"https://www.wikidata.org/wiki/Q775963","display_name":"Smoothing","level":2,"score":0.7387484312057495},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7042810916900635},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5762835144996643},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.5034539103507996},{"id":"https://openalex.org/C2777127463","wikidata":"https://www.wikidata.org/wiki/Q10862618","display_name":"Saddle","level":2,"score":0.4836946129798889},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4835769534111023},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.474504679441452},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4700157940387726},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4545213580131531},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.43083661794662476},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4287567734718323},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.427801251411438},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.331822007894516},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.3109712302684784},{"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/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/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"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/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/allerton.2017.8262870","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2017.8262870","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-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/W807201702","https://openalex.org/W1699262394","https://openalex.org/W1762223960","https://openalex.org/W1890144115","https://openalex.org/W1939652453","https://openalex.org/W1971942712","https://openalex.org/W2000955051","https://openalex.org/W2021548137","https://openalex.org/W2047152541","https://openalex.org/W2090068900","https://openalex.org/W2092851214","https://openalex.org/W2107438106","https://openalex.org/W2131116400","https://openalex.org/W2132820034","https://openalex.org/W2167732364","https://openalex.org/W2172030407","https://openalex.org/W2296319761","https://openalex.org/W2408675156","https://openalex.org/W3151826485","https://openalex.org/W4250589301","https://openalex.org/W4251616545","https://openalex.org/W6676105031","https://openalex.org/W6679854563"],"related_works":["https://openalex.org/W4236459141","https://openalex.org/W4205304778","https://openalex.org/W2020252434","https://openalex.org/W73248859","https://openalex.org/W2584253892","https://openalex.org/W2350324449","https://openalex.org/W1572705989","https://openalex.org/W119381072","https://openalex.org/W2034033896","https://openalex.org/W4256242347"],"abstract_inverted_index":{"In":[0],"this":[1,20],"paper,":[2],"we":[3],"propose":[4],"a":[5],"sequential":[6],"smoothing":[7],"algorithm":[8,61],"for":[9],"solving":[10],"large":[11],"scale":[12],"convex-concave":[13],"saddle":[14],"point":[15],"problems.":[16],"We":[17,56],"prove":[18],"that":[19],"class":[21],"of":[22],"algorithms":[23],"achieves":[24],"the":[25,30,48],"convergence":[26],"rate":[27],"O(1/\u221a\u03b5)":[28,34],"in":[29,47,65],"deterministic":[31],"setting":[32],"and":[33],"with":[35],"probability":[36],"at":[37],"least":[38],"1":[39],"-":[40],"\u03b4,":[41],"where":[42],"\u03b4":[43],"\u03f5":[44],"(0,":[45],"1),":[46],"stochastic":[49],"setting,":[50],"to":[51,62],"obtain":[52],"an":[53],"g-optimal":[54],"solution.":[55],"then":[57],"apply":[58],"our":[59],"general":[60],"specific":[63],"problems":[64],"large-scale":[66],"convex":[67],"constrained":[68],"optimization.":[69]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}