{"id":"https://openalex.org/W1988415892","doi":"https://doi.org/10.1137/s1052623402361447","title":"A Decomposition Method Based on SQP for a Class of Multistage Stochastic Nonlinear Programs","display_name":"A Decomposition Method Based on SQP for a Class of Multistage Stochastic Nonlinear Programs","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W1988415892","doi":"https://doi.org/10.1137/s1052623402361447","mag":"1988415892"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623402361447","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623402361447","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/A5100461515","display_name":"Xinwei Liu","orcid":"https://orcid.org/0000-0002-9829-3395"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Xinwei Liu","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5111436924","display_name":"Gongyun Zhao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gongyun Zhao","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100461515"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8847,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.75785426,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"14","issue":"1","first_page":"200","last_page":"222"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.9991000294685364,"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.9991000294685364,"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.9937000274658203,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9922999739646912,"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/sequential-quadratic-programming","display_name":"Sequential quadratic programming","score":0.8558746576309204},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.7631587982177734},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6877442598342896},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.5457112789154053},{"id":"https://openalex.org/keywords/stochastic-programming","display_name":"Stochastic programming","score":0.5224648714065552},{"id":"https://openalex.org/keywords/quadratic-programming","display_name":"Quadratic programming","score":0.5056467056274414},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.4715438187122345},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.47134846448898315},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.26267576217651367}],"concepts":[{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.8558746576309204},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.7631587982177734},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6877442598342896},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.5457112789154053},{"id":"https://openalex.org/C137631369","wikidata":"https://www.wikidata.org/wiki/Q7617831","display_name":"Stochastic programming","level":2,"score":0.5224648714065552},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.5056467056274414},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.4715438187122345},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.47134846448898315},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.26267576217651367},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/s1052623402361447","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623402361447","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:scholarbank.nus.edu.sg:10635/114292","is_oa":false,"landing_page_url":"http://scholarbank.nus.edu.sg/handle/10635/114292","pdf_url":null,"source":{"id":"https://openalex.org/S7407052290","display_name":"National University of Singapore","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Scopus","raw_type":"Article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.6.5480","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.5480","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.nus.edu.sg/~matzgy/papers/sqpsp.ps","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":40,"referenced_works":["https://openalex.org/W80788423","https://openalex.org/W199387772","https://openalex.org/W347166089","https://openalex.org/W1481747975","https://openalex.org/W1569990960","https://openalex.org/W1748199557","https://openalex.org/W1936682102","https://openalex.org/W1968926137","https://openalex.org/W1969007958","https://openalex.org/W1978001564","https://openalex.org/W1981336262","https://openalex.org/W1991182684","https://openalex.org/W1991482609","https://openalex.org/W1994707765","https://openalex.org/W1997231674","https://openalex.org/W2001962902","https://openalex.org/W2003492573","https://openalex.org/W2006311627","https://openalex.org/W2014746566","https://openalex.org/W2016461703","https://openalex.org/W2019340883","https://openalex.org/W2027041028","https://openalex.org/W2038178878","https://openalex.org/W2039677845","https://openalex.org/W2041684917","https://openalex.org/W2042725681","https://openalex.org/W2049068112","https://openalex.org/W2050705002","https://openalex.org/W2060281378","https://openalex.org/W2063030016","https://openalex.org/W2105560970","https://openalex.org/W2149416133","https://openalex.org/W2165321101","https://openalex.org/W2994321377","https://openalex.org/W3000651840","https://openalex.org/W3106992008","https://openalex.org/W4212973943","https://openalex.org/W4231257920","https://openalex.org/W4235779194","https://openalex.org/W4254106911"],"related_works":["https://openalex.org/W4206704743","https://openalex.org/W436931041","https://openalex.org/W2019128690","https://openalex.org/W1495847109","https://openalex.org/W2390817143","https://openalex.org/W2106813160","https://openalex.org/W2355743697","https://openalex.org/W16121019","https://openalex.org/W2894731288","https://openalex.org/W2384138382"],"abstract_inverted_index":{"Multistage":[0],"stochastic":[1,73],"programming":[2,44,90],"problems":[3,27],"arise":[4],"in":[5],"many":[6],"practical":[7],"situations,":[8],"such":[9],"as":[10],"production":[11],"and":[12,17,32],"manpower":[13],"planning,":[14],"portfolio":[15],"selections,":[16],"so":[18],"on.":[19],"In":[20],"general,":[21],"the":[22,57,80,97,111,114,119,124,133,143],"deterministic":[23],"equivalents":[24],"of":[25,71,88,113],"these":[26],"can":[28,106],"be":[29,35,107],"very":[30,48],"large":[31],"may":[33],"not":[34],"solvable":[36],"directly":[37],"by":[38,83],"general-purpose":[39],"optimization":[40],"approaches.":[41],"Sequential":[42],"quadratic":[43,89],"(SQP)":[45],"methods":[46,105],"are":[47,153],"effective":[49],"for":[50,67],"solving":[51,68,84],"medium-size":[52],"nonlinear":[53,74],"programming.":[54],"By":[55,122],"using":[56],"scenario":[58],"analysis":[59],"technique,":[60],"a":[61,69,86],"decomposition":[62],"method":[63],"based":[64],"on":[65],"SQP":[66],"class":[70],"multistage":[72],"programs":[75],"is":[76],"proposed,":[77],"which":[78],"generates":[79],"search":[81],"direction":[82],"parallelly":[85],"set":[87],"subproblems":[91],"with":[92,118,145],"much":[93],"less":[94],"size":[95],"than":[96],"original":[98],"problem":[99,144],"at":[100,137],"each":[101],"iteration.":[102],"Conjugate":[103],"gradient":[104],"introduced":[108],"to":[109,126,142],"derive":[110],"estimates":[112],"dual":[115],"multiplier":[116],"associated":[117],"nonanticipativity":[120],"constraints.":[121],"selecting":[123],"step-size":[125],"reduce":[127],"an":[128,138],"exact":[129],"penalty":[130],"function":[131],"sufficiently,":[132],"algorithm":[134],"terminates":[135],"finitely":[136],"approximate":[139],"optimal":[140],"solution":[141],"any":[146],"desirable":[147],"accuracy.":[148],"Some":[149],"preliminary":[150],"numerical":[151],"results":[152],"reported.":[154]},"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}