{"id":"https://openalex.org/W2327639451","doi":"https://doi.org/10.1137/14098524x","title":"A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints","display_name":"A Polynomial-Time Descent Method for Separable Convex Optimization Problems with Linear Constraints","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2327639451","doi":"https://doi.org/10.1137/14098524x","mag":"2327639451"},"language":"en","primary_location":{"id":"doi:10.1137/14098524x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/14098524x","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/A5007996626","display_name":"Sergei Chubanov","orcid":"https://orcid.org/0000-0003-3164-3415"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Sergei Chubanov","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5007996626"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.7375,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.88754686,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"26","issue":"1","first_page":"856","last_page":"889"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991000294685364,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.7654913067817688},{"id":"https://openalex.org/keywords/ellipsoid-method","display_name":"Ellipsoid method","score":0.6079484820365906},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.5542230606079102},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5477849245071411},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5423494577407837},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5397722125053406},{"id":"https://openalex.org/keywords/differentiable-function","display_name":"Differentiable function","score":0.498760461807251},{"id":"https://openalex.org/keywords/criss-cross-algorithm","display_name":"Criss-cross algorithm","score":0.49377211928367615},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47655704617500305},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.47095781564712524},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.45718997716903687},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.4398333430290222},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.42348551750183105},{"id":"https://openalex.org/keywords/linear-fractional-programming","display_name":"Linear-fractional programming","score":0.401854008436203},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3161393404006958},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"Convex analysis","score":0.3037763833999634},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.29391270875930786},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.13699781894683838},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.0795045793056488}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7654913067817688},{"id":"https://openalex.org/C205451395","wikidata":"https://www.wikidata.org/wiki/Q378574","display_name":"Ellipsoid method","level":5,"score":0.6079484820365906},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.5542230606079102},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5477849245071411},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5423494577407837},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5397722125053406},{"id":"https://openalex.org/C202615002","wikidata":"https://www.wikidata.org/wiki/Q783507","display_name":"Differentiable function","level":2,"score":0.498760461807251},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.49377211928367615},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47655704617500305},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.47095781564712524},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.45718997716903687},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.4398333430290222},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.42348551750183105},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.401854008436203},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3161393404006958},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.3037763833999634},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.29391270875930786},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.13699781894683838},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0795045793056488},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/14098524x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/14098524x","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1517483307","https://openalex.org/W1573199930","https://openalex.org/W1990735605","https://openalex.org/W2015142254","https://openalex.org/W2020361255","https://openalex.org/W2040392433","https://openalex.org/W2046715803","https://openalex.org/W2051716090","https://openalex.org/W2053352956","https://openalex.org/W2060676537","https://openalex.org/W2074792936","https://openalex.org/W2080375462","https://openalex.org/W2114965319","https://openalex.org/W2139182243","https://openalex.org/W2146953632","https://openalex.org/W2156347727","https://openalex.org/W2187299368","https://openalex.org/W2911796152"],"related_works":["https://openalex.org/W4205348974","https://openalex.org/W2007464938","https://openalex.org/W2784100870","https://openalex.org/W2293098548","https://openalex.org/W2337360258","https://openalex.org/W4205854323","https://openalex.org/W2133667137","https://openalex.org/W2101734857","https://openalex.org/W2214462370","https://openalex.org/W2079268432"],"abstract_inverted_index":{"We":[0,14],"propose":[1],"a":[2,6],"polynomial":[3,30,47,89],"algorithm":[4,45,73,90],"for":[5,29,77,91],"separable":[7],"convex":[8],"optimization":[9],"problem":[10,60,67],"with":[11,64],"linear":[12,82,92],"constraints.":[13],"do":[15],"not":[16],"make":[17],"any":[18,88],"additional":[19],"assumptions":[20],"about":[21],"the":[22,25,34,49,52,59,62,66],"structure":[23],"of":[24,43,51,55,58,81],"objective":[26,35],"function":[27,36],"except":[28],"computability.":[31],"That":[32],"is,":[33],"can":[37,86],"be":[38,70,87],"non-differentiable.":[39],"The":[40],"running":[41],"time":[42],"our":[44],"is":[46,68],"in":[48],"size":[50],"input":[53],"consisting":[54],"an":[56,75],"instance":[57],"and":[61],"accuracy":[63],"which":[65],"to":[69],"solved.":[71],"Our":[72],"uses":[74],"oracle":[76,85],"solving":[78],"auxiliary":[79],"systems":[80],"inequalities.":[83],"This":[84],"programming.":[93]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}