{"id":"https://openalex.org/W2054502357","doi":"https://doi.org/10.1002/net.3230250403","title":"On truncated\u2010newton methods for solving the spatial price equilibrium problem","display_name":"On truncated\u2010newton methods for solving the spatial price equilibrium problem","publication_year":1995,"publication_date":"1995-07-01","ids":{"openalex":"https://openalex.org/W2054502357","doi":"https://doi.org/10.1002/net.3230250403","mag":"2054502357"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230250403","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230250403","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/A5109004799","display_name":"Micha\u00ebl Florian","orcid":null},"institutions":[{"id":"https://openalex.org/I70931966","display_name":"Universit\u00e9 de Montr\u00e9al","ror":"https://ror.org/0161xgx34","country_code":"CA","type":"education","lineage":["https://openalex.org/I70931966"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"M. Florian","raw_affiliation_strings":["De\u0301partement d'informatique et de recherche ope\u0301rationnelle, Universite\u0301 de Montre\u0301al, Montreal, Quebec H3C 3J7, Canada","D\u00e9partement d\u2019informatique et de recherche op\u00e9rationnelle Universit\u00e9 de Montr\u00e9al, Montr\u00e9al, Qu\u00e9bec H3C 3J7, Canada"],"affiliations":[{"raw_affiliation_string":"De\u0301partement d'informatique et de recherche ope\u0301rationnelle, Universite\u0301 de Montre\u0301al, Montreal, Quebec H3C 3J7, Canada","institution_ids":["https://openalex.org/I70931966"]},{"raw_affiliation_string":"D\u00e9partement d\u2019informatique et de recherche op\u00e9rationnelle Universit\u00e9 de Montr\u00e9al, Montr\u00e9al, Qu\u00e9bec H3C 3J7, Canada","institution_ids":["https://openalex.org/I70931966"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059606373","display_name":"Stephen J. Thomas","orcid":"https://orcid.org/0000-0002-8368-7682"},"institutions":[{"id":"https://openalex.org/I70931966","display_name":"Universit\u00e9 de Montr\u00e9al","ror":"https://ror.org/0161xgx34","country_code":"CA","type":"education","lineage":["https://openalex.org/I70931966"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"S. J. Thomas","raw_affiliation_strings":["De\u0301partement d'informatique et de recherche ope\u0301rationnelle, Universite\u0301 de Montre\u0301al, Montreal, Quebec H3C 3J7, Canada","D\u00e9partement d\u2019informatique et de recherche op\u00e9rationnelle Universit\u00e9 de Montr\u00e9al, Montr\u00e9al, Qu\u00e9bec H3C 3J7, Canada"],"affiliations":[{"raw_affiliation_string":"De\u0301partement d'informatique et de recherche ope\u0301rationnelle, Universite\u0301 de Montre\u0301al, Montreal, Quebec H3C 3J7, Canada","institution_ids":["https://openalex.org/I70931966"]},{"raw_affiliation_string":"D\u00e9partement d\u2019informatique et de recherche op\u00e9rationnelle Universit\u00e9 de Montr\u00e9al, Montr\u00e9al, Qu\u00e9bec H3C 3J7, Canada","institution_ids":["https://openalex.org/I70931966"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5013387534","display_name":"R. V. M. Zahar","orcid":null},"institutions":[{"id":"https://openalex.org/I70931966","display_name":"Universit\u00e9 de Montr\u00e9al","ror":"https://ror.org/0161xgx34","country_code":"CA","type":"education","lineage":["https://openalex.org/I70931966"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"R. V. M. Zahar","raw_affiliation_strings":["De\u0301partement d'informatique et de recherche ope\u0301rationnelle, Universite\u0301 de Montre\u0301al, Montreal, Quebec H3C 3J7, Canada","D\u00e9partement d\u2019informatique et de recherche op\u00e9rationnelle Universit\u00e9 de Montr\u00e9al, Montr\u00e9al, Qu\u00e9bec H3C 3J7, Canada"],"affiliations":[{"raw_affiliation_string":"De\u0301partement d'informatique et de recherche ope\u0301rationnelle, Universite\u0301 de Montre\u0301al, Montreal, Quebec H3C 3J7, Canada","institution_ids":["https://openalex.org/I70931966"]},{"raw_affiliation_string":"D\u00e9partement d\u2019informatique et de recherche op\u00e9rationnelle Universit\u00e9 de Montr\u00e9al, Montr\u00e9al, Qu\u00e9bec H3C 3J7, Canada","institution_ids":["https://openalex.org/I70931966"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5109004799"],"corresponding_institution_ids":["https://openalex.org/I70931966"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.23243243,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"25","issue":"4","first_page":"177","last_page":"182"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.982699990272522,"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.982699990272522,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.9811999797821045,"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/T12137","display_name":"Economic theories and models","score":0.9735000133514404,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/newtons-method","display_name":"Newton's method","score":0.6743655204772949},{"id":"https://openalex.org/keywords/conjugate-gradient-method","display_name":"Conjugate gradient method","score":0.6418707966804504},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.604037880897522},{"id":"https://openalex.org/keywords/newtons-method-in-optimization","display_name":"Newton's method in optimization","score":0.5671618580818176},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.5519015789031982},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4795382022857666},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.47479739785194397},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.43643486499786377},{"id":"https://openalex.org/keywords/quasi-newton-method","display_name":"Quasi-Newton method","score":0.4252024292945862},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.422580748796463},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.4134117066860199},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34107735753059387},{"id":"https://openalex.org/keywords/local-convergence","display_name":"Local convergence","score":0.30316096544265747},{"id":"https://openalex.org/keywords/iterative-method","display_name":"Iterative method","score":0.16290190815925598},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.08450442552566528},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.07482227683067322}],"concepts":[{"id":"https://openalex.org/C85189116","wikidata":"https://www.wikidata.org/wiki/Q374195","display_name":"Newton's method","level":3,"score":0.6743655204772949},{"id":"https://openalex.org/C81184566","wikidata":"https://www.wikidata.org/wiki/Q1191895","display_name":"Conjugate gradient method","level":2,"score":0.6418707966804504},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.604037880897522},{"id":"https://openalex.org/C179127668","wikidata":"https://www.wikidata.org/wiki/Q17086396","display_name":"Newton's method in optimization","level":4,"score":0.5671618580818176},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.5519015789031982},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4795382022857666},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.47479739785194397},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.43643486499786377},{"id":"https://openalex.org/C114954040","wikidata":"https://www.wikidata.org/wiki/Q1476018","display_name":"Quasi-Newton method","level":4,"score":0.4252024292945862},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.422580748796463},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.4134117066860199},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34107735753059387},{"id":"https://openalex.org/C117898588","wikidata":"https://www.wikidata.org/wiki/Q6664310","display_name":"Local convergence","level":3,"score":0.30316096544265747},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.16290190815925598},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.08450442552566528},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.07482227683067322},{"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.1002/net.3230250403","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230250403","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W291003596","https://openalex.org/W1994722534","https://openalex.org/W2034755620","https://openalex.org/W2051434435","https://openalex.org/W2072170071","https://openalex.org/W2074860464","https://openalex.org/W2090963365","https://openalex.org/W2093151659","https://openalex.org/W2142738245","https://openalex.org/W2318113592","https://openalex.org/W4299512035","https://openalex.org/W6681611883"],"related_works":["https://openalex.org/W2350788688","https://openalex.org/W4297921956","https://openalex.org/W2951861326","https://openalex.org/W3001734434","https://openalex.org/W2020329095","https://openalex.org/W3048827262","https://openalex.org/W2075835091","https://openalex.org/W2196356369","https://openalex.org/W2731844756","https://openalex.org/W2259924831"],"abstract_inverted_index":{"Abstract":[0],"A":[1,72],"truncated\u2010Newton":[2,49,73],"method":[3,14,50],"is":[4,15,75],"applied":[5],"to":[6],"the":[7,13,23,28,32,40,48,62,79],"spatial":[8],"price":[9],"equilibrium":[10],"problem":[11],"and":[12],"compared":[16,52],"with":[17,53],"other":[18],"specialized":[19],"techniques":[20],"that":[21,61],"exploit":[22],"inherent":[24],"network":[25],"structure":[26],"of":[27,31,55],"problem.":[29],"Variants":[30],"linear":[33],"conjugate":[34],"gradient":[35],"algorithm":[36,74],"for":[37,47],"approximately":[38],"solving":[39],"Newton":[41],"equations":[42],"are":[43,51,65,70,82],"discussed.":[44],"Numerical":[45],"results":[46],"those":[54],"a":[56],"block\u2010SOR":[57],"method.":[58],"Tests":[59],"indicate":[60],"two":[63],"approaches":[64],"comparable":[66],"when":[67],"transportation":[68,80],"costs":[69,81],"linear.":[71],"far":[76],"superior":[77],"if":[78],"nonlinear.":[83]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}