{"id":"https://openalex.org/W1906995641","doi":"https://doi.org/10.1137/07069729x","title":"Separable Convex Optimization Problems with Linear Ascending Constraints","display_name":"Separable Convex Optimization Problems with Linear Ascending Constraints","publication_year":2009,"publication_date":"2009-08-19","ids":{"openalex":"https://openalex.org/W1906995641","doi":"https://doi.org/10.1137/07069729x","mag":"1906995641"},"language":"en","primary_location":{"id":"doi:10.1137/07069729x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/07069729x","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/0707.2265","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Arun Padakandla","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Arun Padakandla","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Rajesh Sundaresan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rajesh Sundaresan","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.355,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.58956151,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"20","issue":"3","first_page":"1185","last_page":"1204"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.321399986743927,"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"}},"topics":[{"id":"https://openalex.org/T10545","display_name":"Optimization and Variational Analysis","score":0.321399986743927,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.20110000669956207,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.07069999724626541,"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/proper-convex-function","display_name":"Proper convex function","score":0.6735000014305115},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.6575000286102295},{"id":"https://openalex.org/keywords/subderivative","display_name":"Subderivative","score":0.6427000164985657},{"id":"https://openalex.org/keywords/linear-matrix-inequality","display_name":"Linear matrix inequality","score":0.6220999956130981},{"id":"https://openalex.org/keywords/conic-optimization","display_name":"Conic optimization","score":0.614300012588501},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.602400004863739},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.6017000079154968},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"Convex analysis","score":0.5672000050544739},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.4733999967575073},{"id":"https://openalex.org/keywords/convex-combination","display_name":"Convex combination","score":0.4693000018596649}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8537999987602234},{"id":"https://openalex.org/C50862404","wikidata":"https://www.wikidata.org/wiki/Q3075259","display_name":"Proper convex function","level":5,"score":0.6735000014305115},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6575000286102295},{"id":"https://openalex.org/C200661725","wikidata":"https://www.wikidata.org/wiki/Q289500","display_name":"Subderivative","level":4,"score":0.6427000164985657},{"id":"https://openalex.org/C201829737","wikidata":"https://www.wikidata.org/wiki/Q2022760","display_name":"Linear matrix inequality","level":2,"score":0.6220999956130981},{"id":"https://openalex.org/C79187972","wikidata":"https://www.wikidata.org/wiki/Q2654791","display_name":"Conic optimization","level":5,"score":0.614300012588501},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.602400004863739},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.6017000079154968},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.5672000050544739},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5432000160217285},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.4733999967575073},{"id":"https://openalex.org/C111110010","wikidata":"https://www.wikidata.org/wiki/Q2627315","display_name":"Convex combination","level":4,"score":0.4693000018596649},{"id":"https://openalex.org/C49870271","wikidata":"https://www.wikidata.org/wiki/Q193657","display_name":"Convex set","level":4,"score":0.46140000224113464},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.39430001378059387},{"id":"https://openalex.org/C205451395","wikidata":"https://www.wikidata.org/wiki/Q378574","display_name":"Ellipsoid method","level":5,"score":0.38609999418258667},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.3815000057220459},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3407000005245209},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.30730000138282776},{"id":"https://openalex.org/C6018138","wikidata":"https://www.wikidata.org/wiki/Q332715","display_name":"Absolutely convex set","level":5,"score":0.2921999990940094},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.2896000146865845},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.27810001373291016},{"id":"https://openalex.org/C10494615","wikidata":"https://www.wikidata.org/wiki/Q17086765","display_name":"Proximal Gradient Methods","level":4,"score":0.2759999930858612},{"id":"https://openalex.org/C84135550","wikidata":"https://www.wikidata.org/wiki/Q3154022","display_name":"Linear inequality","level":3,"score":0.27239999175071716},{"id":"https://openalex.org/C110943637","wikidata":"https://www.wikidata.org/wiki/Q4129097","display_name":"Convex polytope","level":5,"score":0.27219998836517334},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.27140000462532043},{"id":"https://openalex.org/C122268817","wikidata":"https://www.wikidata.org/wiki/Q2020318","display_name":"Frank\u2013Wolfe algorithm","level":5,"score":0.2703999876976013},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.2678999900817871},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.26660001277923584},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.26179999113082886},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.25600001215934753},{"id":"https://openalex.org/C2778023678","wikidata":"https://www.wikidata.org/wiki/Q554403","display_name":"Duality (order theory)","level":2,"score":0.25519999861717224},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.25110000371932983}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/07069729x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/07069729x","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:0707.2265","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0707.2265","pdf_url":"https://arxiv.org/pdf/0707.2265","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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:0707.2265","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0707.2265","pdf_url":"https://arxiv.org/pdf/0707.2265","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W32682462","https://openalex.org/W1969757890","https://openalex.org/W1984187882","https://openalex.org/W1993822182","https://openalex.org/W1998823999","https://openalex.org/W1999244290","https://openalex.org/W2069384116","https://openalex.org/W2070911930","https://openalex.org/W2073250707","https://openalex.org/W2086427885","https://openalex.org/W2101957348","https://openalex.org/W2102395039","https://openalex.org/W2123074269","https://openalex.org/W2130509920","https://openalex.org/W2143277915","https://openalex.org/W2144421688","https://openalex.org/W2144771500","https://openalex.org/W2169693117","https://openalex.org/W2169813715"],"related_works":[],"abstract_inverted_index":{"Separable":[0],"convex":[1,55,97,110],"optimization":[2,111],"problems":[3],"with":[4,40,56,107],"linear":[5],"ascending":[6],"inequality":[7],"and":[8,71,79,81],"equality":[9],"constraints":[10],"are":[11,113],"addressed":[12],"in":[13,24],"this":[14],"paper.":[15],"An":[16],"algorithm":[17,106],"that":[18,102],"explicitly":[19],"characterizes":[20],"the":[21,47,51,64,104],"optimum":[22,33,52],"point":[23],"a":[25,43,92,108],"finite":[26],"number":[27],"of":[28,67,95],"steps":[29],"is":[30,35,54],"described.":[31],"The":[32],"value":[34,53],"shown":[36],"to":[37,42,58,91],"be":[38],"monotone":[39],"respect":[41,57],"partial":[44],"order":[45],"on":[46],"constraint":[48],"parameters.":[49,60],"Moreover,":[50],"these":[59],"This":[61],"work":[62],"generalizes":[63],"existing":[65],"algorithms":[66],"Morton,":[68],"von":[69],"Randow,":[70],"Ringwald":[72],"[Math.":[73],"Programming,":[74],"32":[75],"(1985),":[76],"pp.":[77,89],"238\u2013241]":[78],"Viswanath":[80],"Anantharam":[82],"[IEEE":[83],"Trans.":[84],"Inform.":[85],"Theory,":[86],"48":[87],"(2002),":[88],"1295\u20131318]":[90],"wider":[93],"class":[94],"separable":[96],"objective":[98],"functions.":[99],"Computational":[100],"experiments":[101],"compare":[103],"proposed":[105],"standard":[109],"tool":[112],"also":[114],"provided.":[115]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":4}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2016-06-24T00:00:00"}