{"id":"https://openalex.org/W2146519844","doi":"https://doi.org/10.1002/net.3230260202","title":"An exponential\u2010function reduction method for block\u2010angular convex programs","display_name":"An exponential\u2010function reduction method for block\u2010angular convex programs","publication_year":1995,"publication_date":"1995-09-01","ids":{"openalex":"https://openalex.org/W2146519844","doi":"https://doi.org/10.1002/net.3230260202","mag":"2146519844"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230260202","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230260202","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5084098678","display_name":"Michael D. Grigoriadis","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael D. Grigoriadis","raw_affiliation_strings":["Department of Computer Science, Rutgers University, New Brunswick, NJ 08903"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rutgers University, New Brunswick, NJ 08903","institution_ids":["https://openalex.org/I102322142"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5110103498","display_name":"Leonid G. Khachiyan","orcid":null},"institutions":[{"id":"https://openalex.org/I102322142","display_name":"Rutgers, The State University of New Jersey","ror":"https://ror.org/05vt9qd57","country_code":"US","type":"education","lineage":["https://openalex.org/I102322142"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Leonid G. Khachiyan","raw_affiliation_strings":["Department of Computer Science, Rutgers University, New Brunswick, NJ 08903"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Rutgers University, New Brunswick, NJ 08903","institution_ids":["https://openalex.org/I102322142"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I102322142"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":1.1159,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.78467635,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"26","issue":"2","first_page":"59","last_page":"68"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9958000183105469,"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.9958000183105469,"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.9904999732971191,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9537000060081482,"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.6264904141426086},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5915361642837524},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5890355110168457},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5567328333854675},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.545251190662384},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.5426763296127319},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.532741367816925},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.5016441345214844},{"id":"https://openalex.org/keywords/separable-space","display_name":"Separable space","score":0.4931018054485321},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4767383337020874},{"id":"https://openalex.org/keywords/solution-set","display_name":"Solution set","score":0.43409931659698486},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4291847348213196},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4148203730583191},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.3837957978248596},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.3130665123462677},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2574049234390259},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.20026332139968872}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6264904141426086},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5915361642837524},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5890355110168457},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5567328333854675},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.545251190662384},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.5426763296127319},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.532741367816925},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5016441345214844},{"id":"https://openalex.org/C70710897","wikidata":"https://www.wikidata.org/wiki/Q680081","display_name":"Separable space","level":2,"score":0.4931018054485321},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4767383337020874},{"id":"https://openalex.org/C60033838","wikidata":"https://www.wikidata.org/wiki/Q1751685","display_name":"Solution set","level":3,"score":0.43409931659698486},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4291847348213196},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4148203730583191},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.3837957978248596},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3130665123462677},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2574049234390259},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.20026332139968872},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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},{"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.1002/net.3230260202","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230260202","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.4699999988079071,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1481747975","https://openalex.org/W1625118583","https://openalex.org/W1983743030","https://openalex.org/W1993161326","https://openalex.org/W1994327654","https://openalex.org/W1997231674","https://openalex.org/W2005859793","https://openalex.org/W2015560695","https://openalex.org/W2035652501","https://openalex.org/W2052321453","https://openalex.org/W2065000345","https://openalex.org/W2077122251","https://openalex.org/W2104103056","https://openalex.org/W2108201835","https://openalex.org/W2121902703","https://openalex.org/W2159872727","https://openalex.org/W2182811131","https://openalex.org/W2406719037","https://openalex.org/W2991163709","https://openalex.org/W4242767541","https://openalex.org/W4253845129"],"related_works":["https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W4256429076","https://openalex.org/W4321064619","https://openalex.org/W2039504883","https://openalex.org/W2036012028","https://openalex.org/W4387870386","https://openalex.org/W2187449906","https://openalex.org/W3011190762","https://openalex.org/W2962818859"],"abstract_inverted_index":{"Abstract":[0],"An":[1],"exponential":[2,107],"potential\u2010function":[3],"reduction":[4],"algorithm":[5,92],"for":[6,184],"convex":[7,20,28,38],"block\u2010angular":[8],"optimization":[9,64],"problems":[10,14,52,74,176],"is":[11,41,75,112,135],"described.":[12],"These":[13],"are":[15,53],"characterized":[16],"by":[17,157],"K":[18,122,129],"disjoint":[19],"compact":[21],"sets":[22],"called":[23],"blocks":[24],"and":[25,47,171],"M":[26,124],"non\u2010negative\u2010valued":[27],"block\u2010separable":[29,39],"coupling":[30,85,143],"inequalities":[31],"with":[32,104,164],"a":[33,79,105,136,150,158,165],"nonempty":[34],"interior.":[35],"A":[36],"given":[37],"function":[40],"to":[42,66,77,83,94,114,141,188],"be":[43,182],"minimized.":[44],"Concurrent,":[45],"minimum\u2010cost,":[46],"generalized":[48],"multicommodity":[49,173],"network":[50,174],"flow":[51,175],"important":[54],"special":[55],"cases":[56],"of":[57,72,148,152,167],"this":[58,89],"model.":[59],"The":[60,70,91,110],"method":[61,111,180],"reduces":[62],"the":[63,84,96,100,142,179],"problem":[65,98],"two":[67],"resource\u2010sharing":[68],"problems.":[69],"first":[71],"these":[73],"solved":[76],"obtain":[78],"feasible":[80,137],"solution":[81,118,138],"interior":[82,140],"constraints.":[86],"Starting":[87],"from":[88],"solution,":[90],"proceeds":[93],"solve":[95],"second":[97],"on":[99],"original":[101],"constraints,":[102],"but":[103],"modified":[106],"potential":[108],"function.":[109],"shown":[113],"produce":[115],"an":[116],"\u03f5\u2010approximate":[117],"in":[119,128],"O":[120],"(":[121],"(In":[123],")(\u03f5":[125],"\u22122":[126],"+":[127],"))":[130],"iterations,":[131],"provided":[132],"that":[133,178],"there":[134],"sufficiently":[139],"inequalities.":[144],"Each":[145],"iteration":[146],"consists":[147],"solving":[149],"subset":[151],"independent":[153],"block":[154],"problems,":[155],"followed":[156],"simple":[159],"coordination":[160],"step.":[161],"Computational":[162],"experiments":[163],"set":[166],"large":[168,189],"linear":[169],"concurrent":[170],"minimum\u2010cost":[172],"suggest":[177],"can":[181],"practical":[183],"computing":[185],"fast":[186],"approximations":[187],"instances.":[190]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2013,"cited_by_count":3}],"updated_date":"2026-06-23T06:36:01.041984","created_date":"2025-10-10T00:00:00"}
