{"id":"https://openalex.org/W2053757987","doi":"https://doi.org/10.1080/10556780500098565","title":"Mean value cross decomposition for nonlinear convex problems","display_name":"Mean value cross decomposition for nonlinear convex problems","publication_year":2006,"publication_date":"2006-01-17","ids":{"openalex":"https://openalex.org/W2053757987","doi":"https://doi.org/10.1080/10556780500098565","mag":"2053757987"},"language":"en","primary_location":{"id":"doi:10.1080/10556780500098565","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780500098565","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","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/A5070929452","display_name":"Kaj Holmberg","orcid":"https://orcid.org/0000-0001-5907-0087"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]},{"id":"https://openalex.org/I4210087410","display_name":"Engineering Link (Canada)","ror":"https://ror.org/00zvn3z28","country_code":"CA","type":"company","lineage":["https://openalex.org/I4210087410"]}],"countries":["CA","SE"],"is_corresponding":true,"raw_author_name":"Kaj Holmberg","raw_affiliation_strings":["Link\u00f6ping Institute of Technology, Link\u00f6ping University, SE-581 83, Link\u00f6ping, Sweden","Link\u00f6ping Institute of Technology, Link\u00f6ping University , SE-581 83, Link\u00f6ping, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Link\u00f6ping Institute of Technology, Link\u00f6ping University, SE-581 83, Link\u00f6ping, Sweden","institution_ids":["https://openalex.org/I102134673","https://openalex.org/I4210087410"]},{"raw_affiliation_string":"Link\u00f6ping Institute of Technology, Link\u00f6ping University , SE-581 83, Link\u00f6ping, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111734100","display_name":"Krzysztof C. Kiwiel","orcid":null},"institutions":[{"id":"https://openalex.org/I66083562","display_name":"Systems Research Institute","ror":"https://ror.org/0111cp837","country_code":"PL","type":"facility","lineage":["https://openalex.org/I66083562","https://openalex.org/I99542240"]},{"id":"https://openalex.org/I99542240","display_name":"Polish Academy of Sciences","ror":"https://ror.org/01dr6c206","country_code":"PL","type":"government","lineage":["https://openalex.org/I99542240"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Krzysztof C. Kiwiel","raw_affiliation_strings":["Systems Research Institute, Polish Academy of Sciences, Newelska 6, 01-447, Warsaw, Poland","Systems Research Institute, Polish Academy of Sciences , Newelska 6, 01-447, Warsaw, Poland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Systems Research Institute, Polish Academy of Sciences, Newelska 6, 01-447, Warsaw, Poland","institution_ids":["https://openalex.org/I66083562","https://openalex.org/I99542240"]},{"raw_affiliation_string":"Systems Research Institute, Polish Academy of Sciences , Newelska 6, 01-447, Warsaw, Poland","institution_ids":["https://openalex.org/I66083562","https://openalex.org/I99542240"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5070929452"],"corresponding_institution_ids":["https://openalex.org/I102134673","https://openalex.org/I4210087410"],"apc_list":null,"apc_paid":null,"fwci":13.3392,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.98315535,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"21","issue":"3","first_page":"401","last_page":"417"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9922000169754028,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.9850999712944031,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.7635736465454102},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6970318555831909},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6634794473648071},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.6501755714416504},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.5567740201950073},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5506200790405273},{"id":"https://openalex.org/keywords/decomposition-method","display_name":"Decomposition method (queueing theory)","score":0.49300095438957214},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.48445773124694824},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.48262080550193787},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.47644880414009094},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.46072912216186523},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.0822041928768158}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7635736465454102},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6970318555831909},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6634794473648071},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.6501755714416504},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.5567740201950073},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5506200790405273},{"id":"https://openalex.org/C2778258933","wikidata":"https://www.wikidata.org/wiki/Q16918986","display_name":"Decomposition method (queueing theory)","level":2,"score":0.49300095438957214},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.48445773124694824},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.48262080550193787},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.47644880414009094},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.46072912216186523},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.0822041928768158},{"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","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/C124952713","wikidata":"https://www.wikidata.org/wiki/Q8242","display_name":"Literature","level":1,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/10556780500098565","is_oa":false,"landing_page_url":"https://doi.org/10.1080/10556780500098565","pdf_url":null,"source":{"id":"https://openalex.org/S103047102","display_name":"Optimization methods & software","issn_l":"1026-7670","issn":["1026-7670","1029-4937","1055-6788"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Optimization Methods and Software","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":20,"referenced_works":["https://openalex.org/W316323024","https://openalex.org/W1964166152","https://openalex.org/W1966829877","https://openalex.org/W1995577535","https://openalex.org/W2020317140","https://openalex.org/W2061962896","https://openalex.org/W2086308214","https://openalex.org/W2094427801","https://openalex.org/W2095099106","https://openalex.org/W2102581600","https://openalex.org/W2110056918","https://openalex.org/W2117722264","https://openalex.org/W2139211712","https://openalex.org/W2149254401","https://openalex.org/W2169855002","https://openalex.org/W2326781756","https://openalex.org/W3122911341","https://openalex.org/W4242130683","https://openalex.org/W4249667877","https://openalex.org/W6610998073"],"related_works":["https://openalex.org/W4238350222","https://openalex.org/W2151484740","https://openalex.org/W1965407751","https://openalex.org/W3003165794","https://openalex.org/W2067263127","https://openalex.org/W1967503645","https://openalex.org/W4287899549","https://openalex.org/W2026518960","https://openalex.org/W2358522314","https://openalex.org/W2747249330"],"abstract_inverted_index":{"Mean":[0],"value":[1],"cross":[2],"decomposition":[3,8,79,103],"is":[4,37,48,105],"a":[5,51,64,71,112],"symmetric":[6],"primal\u2013dual":[7],"method":[9],"suitable":[10],"for":[11,33,50,63],"optimization":[12,45],"problems":[13],"with":[14,68,75,81,111],"both":[15,80],"primal":[16],"and":[17,26,85,98],"dual":[18],"structures.":[19],"It":[20],"uses":[21],"only":[22],"easily":[23],"solvable":[24],"subproblems":[25],"no":[27],"difficult":[28],"master":[29],"problems.":[30,46],"Originally":[31],"developed":[32],"linear":[34],"problems,":[35],"it":[36],"in":[38],"this":[39,102],"paper":[40],"extended":[41],"to":[42,83,94,99],"nonlinear":[43,73],"convex":[44],"Convergence":[47],"proved":[49],"somewhat":[52],"generalized":[53],"version,":[54],"allowing":[55],"more":[56,106],"general":[57,115],"weights.":[58],"Computational":[59],"results":[60],"are":[61,93],"presented":[62],"network":[65],"routing":[66],"problem":[67,74],"congestion":[69],"costs,":[70],"large-scale":[72],"structures":[76],"that":[77,101],"enable":[78],"respect":[82],"variables":[84],"constraints.":[86],"The":[87],"main":[88],"goals":[89],"of":[90],"the":[91,96],"tests":[92],"illustrate":[95],"procedure":[97],"indicate":[100],"approach":[104],"efficient":[107],"than":[108],"direct":[109],"solution":[110],"well":[113],"established":[114],"code.":[116]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}