{"id":"https://openalex.org/W2013155105","doi":"https://doi.org/10.1137/s105262349528456x","title":"An Interior Random Vector Algorithm for MultiStage Stochastic Linear Programs","display_name":"An Interior Random Vector Algorithm for MultiStage Stochastic Linear Programs","publication_year":1998,"publication_date":"1998-11-01","ids":{"openalex":"https://openalex.org/W2013155105","doi":"https://doi.org/10.1137/s105262349528456x","mag":"2013155105"},"language":"en","primary_location":{"id":"doi:10.1137/s105262349528456x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s105262349528456x","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/A5025935990","display_name":"Eithan Schweitzer","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Eithan Schweitzer","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5025935990"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5461,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.67267911,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":"8","issue":"4","first_page":"956","last_page":"972"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12709","display_name":"Optimization and Mathematical Programming","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"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/T11976","display_name":"Capital Investment and Risk Analysis","score":0.9833999872207642,"subfield":{"id":"https://openalex.org/subfields/2003","display_name":"Finance"},"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/mathematics","display_name":"Mathematics","score":0.7238393425941467},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6387853026390076},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5634903311729431},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5197179317474365},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5076006650924683},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.5054588317871094},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.4950024485588074},{"id":"https://openalex.org/keywords/criss-cross-algorithm","display_name":"Criss-cross algorithm","score":0.455465167760849},{"id":"https://openalex.org/keywords/sample","display_name":"Sample (material)","score":0.4487445056438446},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.44107410311698914},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.43313083052635193},{"id":"https://openalex.org/keywords/linear-space","display_name":"Linear space","score":0.4323952794075012},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.4211888611316681},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.41212689876556396},{"id":"https://openalex.org/keywords/linear-fractional-programming","display_name":"Linear-fractional programming","score":0.2978852391242981},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2278258204460144},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.1390993893146515}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7238393425941467},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6387853026390076},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5634903311729431},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5197179317474365},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5076006650924683},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.5054588317871094},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.4950024485588074},{"id":"https://openalex.org/C52486349","wikidata":"https://www.wikidata.org/wiki/Q17006040","display_name":"Criss-cross algorithm","level":4,"score":0.455465167760849},{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.4487445056438446},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.44107410311698914},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.43313083052635193},{"id":"https://openalex.org/C176370821","wikidata":"https://www.wikidata.org/wiki/Q1826459","display_name":"Linear space","level":2,"score":0.4323952794075012},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.4211888611316681},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.41212689876556396},{"id":"https://openalex.org/C205658194","wikidata":"https://www.wikidata.org/wiki/Q4168281","display_name":"Linear-fractional programming","level":3,"score":0.2978852391242981},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2278258204460144},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.1390993893146515},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C43617362","wikidata":"https://www.wikidata.org/wiki/Q170050","display_name":"Chromatography","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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/s105262349528456x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s105262349528456x","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:CiteSeerX.psu:10.1.1.51.9382","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.51.9382","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.technion.ac.il/~eithan/sipm.ps.Z","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W47264501","https://openalex.org/W1632601927","https://openalex.org/W1965230003","https://openalex.org/W1973615364","https://openalex.org/W2014746566","https://openalex.org/W2016461703","https://openalex.org/W2022985590","https://openalex.org/W2038426159","https://openalex.org/W2045847740","https://openalex.org/W2074316151","https://openalex.org/W2074737897","https://openalex.org/W2087294763","https://openalex.org/W2116102848","https://openalex.org/W2118152326","https://openalex.org/W2127470768","https://openalex.org/W2132388847","https://openalex.org/W2138492203","https://openalex.org/W2143863355","https://openalex.org/W2168825111","https://openalex.org/W2483906107","https://openalex.org/W2491598486","https://openalex.org/W2502170570","https://openalex.org/W2912091644","https://openalex.org/W4251495539","https://openalex.org/W4255485769"],"related_works":["https://openalex.org/W4388279198","https://openalex.org/W61976518","https://openalex.org/W2114808974","https://openalex.org/W2181661122","https://openalex.org/W2357060777","https://openalex.org/W2030563458","https://openalex.org/W1709621369","https://openalex.org/W2006985686","https://openalex.org/W2350903564","https://openalex.org/W2318926272"],"abstract_inverted_index":{"In":[0,32,88],"this":[1,93],"paper,":[2,94],"an":[3,125],"interior":[4],"point":[5],"algorithm":[6,19,27,38,51,74,90,126,148],"for":[7,12,28,75,149],"linear":[8,16,30,40,77,152],"programs":[9,78,153],"is":[10,20,39,79,101],"adapted":[11],"solving":[13],"multistage":[14,150],"stochastic":[15,151],"programs.":[17,31],"The":[18,50,68,122],"based":[21],"on":[22],"Monteiro":[23],"and":[24,60,110],"Adler's":[25],"path-following":[26],"deterministic":[29,76],"practice,":[33],"the":[34,37,44,47,58,73,82,85,89,95,99,111,114,120,139,144,147],"complexity":[35,71],"of":[36,46,57,65,72,84,98,113,124,133,138,146,159],"with":[41,154],"respect":[42],"to":[43],"size":[45,112],"sample":[48,115,140],"space.":[49],"starts":[52],"from":[53,81],"a":[54,63,107,129,155],"feasible":[55],"solution":[56],"problem":[59,100],"proceeds":[61],"along":[62],"path":[64],"random":[66],"vectors.":[67],"cubic":[69],"polynomial":[70],"derived":[80],"calculations":[83],"Newton":[86,108],"steps.":[87],"developed":[91],"in":[92,119,136],"probabilistic":[96],"structure":[97],"taken":[102],"into":[103],"consideration":[104],"while":[105],"calculating":[106],"step":[109],"space":[116,141],"appears":[117],"linearly":[118],"complexity.":[121],"development":[123],"that":[127],"requires":[128],"relatively":[130],"small":[131],"number":[132,158],"arithmetic":[134],"operations,":[135],"terms":[137],"size,":[142],"allows":[143],"use":[145],"very":[156],"large":[157],"scenarios.":[160]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-08-26T07:47:46.906454","created_date":"2025-10-10T00:00:00"}