{"id":"https://openalex.org/W2110164763","doi":"https://doi.org/10.1137/0801012","title":"A Simplicial Algorithm for the Nonlinear Stationary Point Problem on an Unbounded Polyhedron","display_name":"A Simplicial Algorithm for the Nonlinear Stationary Point Problem on an Unbounded Polyhedron","publication_year":1991,"publication_date":"1991-05-01","ids":{"openalex":"https://openalex.org/W2110164763","doi":"https://doi.org/10.1137/0801012","mag":"2110164763"},"language":"en","primary_location":{"id":"doi:10.1137/0801012","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0801012","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/A5025440962","display_name":"Yang Dai","orcid":"https://orcid.org/0000-0002-7638-849X"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Y. Dai","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110205642","display_name":"G. van der Laan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"G. van der Laan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112801039","display_name":"A.J.J. Talman","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"A. J. J. Talman","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5071256887","display_name":"Y. Yamamoto","orcid":"https://orcid.org/0000-0002-4150-6804"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Y. Yamamoto","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5025440962"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.7745,"has_fulltext":false,"cited_by_count":14,"citation_normalized_percentile":{"value":0.95482432,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"1","issue":"2","first_page":"151","last_page":"165"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9936000108718872,"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.9936000108718872,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9656999707221985,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T12504","display_name":"Mathematics and Applications","score":0.9333000183105469,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/polyhedron","display_name":"Polyhedron","score":0.9044322371482849},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8311386108398438},{"id":"https://openalex.org/keywords/piecewise-linear-function","display_name":"Piecewise linear function","score":0.6278391480445862},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6103772521018982},{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.5486767888069153},{"id":"https://openalex.org/keywords/convex-polytope","display_name":"Convex polytope","score":0.5232616662979126},{"id":"https://openalex.org/keywords/piecewise-linear-manifold","display_name":"Piecewise linear manifold","score":0.46220138669013977},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4598662853240967},{"id":"https://openalex.org/keywords/piecewise","display_name":"Piecewise","score":0.43871286511421204},{"id":"https://openalex.org/keywords/cartesian-product","display_name":"Cartesian product","score":0.42650121450424194},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.399614155292511},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.23966169357299805},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.2109372317790985},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"Convex analysis","score":0.15274745225906372},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.14581120014190674},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.09418877959251404}],"concepts":[{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.9044322371482849},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8311386108398438},{"id":"https://openalex.org/C17095337","wikidata":"https://www.wikidata.org/wiki/Q2375229","display_name":"Piecewise linear function","level":2,"score":0.6278391480445862},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6103772521018982},{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.5486767888069153},{"id":"https://openalex.org/C110943637","wikidata":"https://www.wikidata.org/wiki/Q4129097","display_name":"Convex polytope","level":5,"score":0.5232616662979126},{"id":"https://openalex.org/C184175843","wikidata":"https://www.wikidata.org/wiki/Q7191425","display_name":"Piecewise linear manifold","level":3,"score":0.46220138669013977},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4598662853240967},{"id":"https://openalex.org/C164660894","wikidata":"https://www.wikidata.org/wiki/Q2037833","display_name":"Piecewise","level":2,"score":0.43871286511421204},{"id":"https://openalex.org/C65236422","wikidata":"https://www.wikidata.org/wiki/Q173740","display_name":"Cartesian product","level":2,"score":0.42650121450424194},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.399614155292511},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.23966169357299805},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.2109372317790985},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.15274745225906372},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.14581120014190674},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.09418877959251404},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/0801012","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0801012","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:research.vu.nl:publications/bb488159-79b4-4f44-ab0f-071b0e214728","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400546","display_name":"Digital Academic REpository of VU University Amsterdam (Vrije Universiteit Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:tilburguniversity.edu:publications/82992276-1868-4b56-a937-0955e80520e6","is_oa":false,"landing_page_url":"https://pure.uvt.nl/portal/en/publications/a-simplicial-algorithm-for-the-nonlinear-stationary-point-problem-on-an-unbounded-polyhedron(82992276-1868-4b56-a937-0955e80520e6).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401490","display_name":"Research portal (Tilburg University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I193700539","host_organization_name":"Tilburg University","host_organization_lineage":["https://openalex.org/I193700539"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W101126772","https://openalex.org/W1494436834","https://openalex.org/W1547341193","https://openalex.org/W2047090956","https://openalex.org/W2050957891","https://openalex.org/W2121288269","https://openalex.org/W2121885849","https://openalex.org/W2728328203"],"related_works":["https://openalex.org/W2619539882","https://openalex.org/W4256576314","https://openalex.org/W1989138816","https://openalex.org/W57070652","https://openalex.org/W3105408998","https://openalex.org/W2886522954","https://openalex.org/W2774123355","https://openalex.org/W2260494922","https://openalex.org/W4206180239","https://openalex.org/W2005767551"],"abstract_inverted_index":{"A":[0,120],"path-following":[1],"algorithm":[2,23,40,141],"is":[3,41,62,132,146,152,163],"proposed":[4],"for":[5],"finding":[6],"a":[7,65,130,136,157],"solution":[8,131],"to":[9,35,98,129],"the":[10,31,39,44,82,88,124,140,144,150,153],"nonlinear":[11],"stationary":[12],"point":[13,29],"problem":[14,145],"on":[15,55],"an":[16,27,56,160],"unbounded,":[17],"convex,":[18],"and":[19,86,115,135,159],"pointed":[20],"polyhedron.":[21,32],"The":[22,33,72,101],"can":[24,76,108],"start":[25],"at":[26],"arbitrary":[28],"of":[30,46,48,69,74,105,126,138,156],"path":[34,45,73,104,125],"be":[36,77,109],"followed":[37,79],"by":[38,64,80,91,111],"described":[42],"as":[43],"zeros":[47,75,127],"some":[49],"piecewise":[50,93,102],"continuously":[51],"differentiable":[52],"function":[53,90,107],"defined":[54],"appropriate":[57],"subdivided":[58,70],"manifold.":[59],"This":[60],"manifold":[61],"induced":[63],"generalized":[66],"primal-dual":[67],"pair":[68],"manifolds.":[71],"approximately":[78],"dividing":[81],"polyhedron":[83,151,162],"into":[84],"simplices":[85],"replacing":[87],"original":[89],"its":[92],"linear":[94,103,116,147],"approximation":[95],"with":[96],"respect":[97],"this":[99,106],"subdivision.":[100],"generated":[110],"alternating":[112],"replacement":[113],"steps":[114],"programming":[117],"pivot":[118],"steps.":[119],"condition":[121],"under":[122],"which":[123],"converges":[128],"also":[133],"stated,":[134],"description":[137],"how":[139],"operates":[142],"when":[143,149],"or":[148],"Cartesian":[154],"product":[155],"polytope":[158],"unbounded":[161],"given.":[164]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-03-10T16:38:18.471706","created_date":"2025-10-10T00:00:00"}