{"id":"https://openalex.org/W1996025842","doi":"https://doi.org/10.1017/s0004972700008595","title":"Sequential algorithms in nonlinear programming","display_name":"Sequential algorithms in nonlinear programming","publication_year":1978,"publication_date":"1978-08-01","ids":{"openalex":"https://openalex.org/W1996025842","doi":"https://doi.org/10.1017/s0004972700008595","mag":"1996025842"},"language":"en","primary_location":{"id":"doi:10.1017/s0004972700008595","doi":"https://doi.org/10.1017/s0004972700008595","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0004972700008595","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/6A6F653F3DF33EF8A8D70B6DAD7ACB6A/S0004972700008595a.pdf/div-class-title-sequential-algorithms-in-nonlinear-programming-div.pdf","source":{"id":"https://openalex.org/S141318850","display_name":"Bulletin of the Australian Mathematical Society","issn_l":"0004-9727","issn":["0004-9727","1755-1633"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-c","jufo-1","norway-1","poland-40","russia-white-list-3"],"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bulletin of the Australian Mathematical Society","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/6A6F653F3DF33EF8A8D70B6DAD7ACB6A/S0004972700008595a.pdf/div-class-title-sequential-algorithms-in-nonlinear-programming-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023667169","display_name":"Krisorn Jittorntrum","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Krisorn Jittorntrum","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5023667169"],"corresponding_institution_ids":[],"apc_list":{"value":3550,"currency":"USD","value_usd":3550},"apc_paid":{"value":3550,"currency":"USD","value_usd":3550},"fwci":1.3513,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.76124567,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":96},"biblio":{"volume":"19","issue":"1","first_page":"151","last_page":"153"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9961000084877014,"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.9961000084877014,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.00279999990016222,"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"}},{"id":"https://openalex.org/T12661","display_name":"Iterative Methods for Nonlinear Equations","score":0.00019999999494757503,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"nonlinear programming","score":0.7910000085830688},{"id":"https://openalex.org/keywords/sequential-unconstrained-minimization","display_name":"sequential unconstrained minimization","score":0.8650000095367432},{"id":"https://openalex.org/keywords/isolated-solutions","display_name":"isolated solutions","score":0.6629999876022339},{"id":"https://openalex.org/keywords/sensitivity-analysis","display_name":"sensitivity analysis","score":0.8009999990463257},{"id":"https://openalex.org/keywords/barrier-function-method","display_name":"barrier function method","score":0.8399999737739563},{"id":"https://openalex.org/keywords/logarithmic-barrier-function","display_name":"logarithmic barrier function","score":0.7889999747276306},{"id":"https://openalex.org/keywords/order-of-convergence","display_name":"convergence order","score":0.5389999747276306},{"id":"https://openalex.org/keywords/extrapolation","display_name":"extrapolation","score":0.7310000061988831},{"id":"https://openalex.org/keywords/augmented-lagrangian-method","display_name":"augmented Lagrangian method","score":0.8920000195503235},{"id":"https://openalex.org/keywords/equality-constraints","display_name":"equality constraints","score":0.36899998784065247},{"id":"https://openalex.org/keywords/convergence-analysis","display_name":"convergence analysis","score":0.3869999945163727},{"id":"https://openalex.org/keywords/karush-kuhn-tucker-conditions","display_name":"Karush-Kuhn-Tucker conditions","score":0.41100001335144043},{"id":"https://openalex.org/keywords/degeneracy","display_name":"degeneracy","score":0.3630000054836273},{"id":"https://openalex.org/keywords/sensitivity-measures","display_name":"sensitivity measures","score":0.4519999921321869}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8071295022964478},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5691593885421753},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.48580288887023926},{"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/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s0004972700008595","doi":"https://doi.org/10.1017/s0004972700008595","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0004972700008595","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/6A6F653F3DF33EF8A8D70B6DAD7ACB6A/S0004972700008595a.pdf/div-class-title-sequential-algorithms-in-nonlinear-programming-div.pdf","source":{"id":"https://openalex.org/S141318850","display_name":"Bulletin of the Australian Mathematical Society","issn_l":"0004-9727","issn":["0004-9727","1755-1633"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-c","jufo-1","norway-1","poland-40","russia-white-list-3"],"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bulletin of the Australian Mathematical Society","raw_type":"journal-article"},{"id":"pmh:oai:openresearch-repository.anu.edu.au:1885/10914","doi":null,"is_oa":false,"landing_page_url":"http://hdl.handle.net/1885/10914","pdf_url":null,"source":{"id":"https://openalex.org/S4306402539","display_name":"ANU Open Research (Australian National University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I118347636","host_organization_name":"Australian National University","host_organization_lineage":["https://openalex.org/I118347636"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Thesis (PhD)"},{"id":"doi:10.25911/5d76368247318","doi":"https://doi.org/10.25911/5d76368247318","is_oa":true,"landing_page_url":"https://doi.org/10.25911/5d76368247318","pdf_url":null,"source":{"id":"https://openalex.org/S7407050548","display_name":"The Australian National University","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Other"}],"best_oa_location":{"id":"doi:10.1017/s0004972700008595","doi":"https://doi.org/10.1017/s0004972700008595","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0004972700008595","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/6A6F653F3DF33EF8A8D70B6DAD7ACB6A/S0004972700008595a.pdf/div-class-title-sequential-algorithms-in-nonlinear-programming-div.pdf","source":{"id":"https://openalex.org/S141318850","display_name":"Bulletin of the Australian Mathematical Society","issn_l":"0004-9727","issn":["0004-9727","1755-1633"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-c","jufo-1","norway-1","poland-40","russia-white-list-3"],"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bulletin of the Australian Mathematical Society","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1996025842.pdf","grobid_xml":"https://content.openalex.org/works/W1996025842.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2906865694","https://openalex.org/W1970282330","https://openalex.org/W1971405736","https://openalex.org/W2545218399","https://openalex.org/W2015417145","https://openalex.org/W2041684917","https://openalex.org/W4206970661","https://openalex.org/W7009434532","https://openalex.org/W2017558614","https://openalex.org/W2012832821"],"abstract_inverted_index":{"In":[0],"this":[1,107,237,255,479,527],"thesis,":[2],"a":[3,43,125,154,192,276,287,313,420,425,455,494,504],"class":[4,28],"of":[5,29,34,45,73,88,92,105,128,149,186,218,245,266,278,294,303,315,339,380,443,450,467,490],"methods":[6,30,50,352,524],"for":[7,54,83,142,157,214,251,275,312,342,398,410,439,513,522],"solving":[8],"the":[9,35,39,69,85,93,102,113,145,182,187,196,203,226,243,257,264,281,295,304,307,324,330,343,349,381,407,431,441,444,460,470,486,491,523],"following":[10],"non-linear":[11],"programming":[12],"problem:":[13],"minimize":[14],"f(x)":[15],"subject":[16],"to":[17,42,62,80,124,205,231,242,249,355,396,428,464,484],"x":[18],"e":[19],"S":[20],"=":[21,386],"{hi(x)=O,i=l,...\u2113;gj(x)":[22],"\u2265o,":[23],"j=l,...,m}":[24],"is":[25,61,109,173,199,207,220,229,234,240,284,289,310,368,375,403,454,482,502],"investigated.":[26,171],"The":[27,59,300,448,498],"under":[31],"investigation":[32],"consists":[33],"ones":[36],"which":[37,222],"reduce":[38],"computational":[40],"process":[41],"sequence":[44],"unconstrained":[46,378],"minimization":[47],"subproblems.":[48],"These":[49],"arc":[51,180,335,353,437,529],"generally":[52],"noted":[53],"their":[55],"simplicity":[56],"and":[57,64,71,97,118,135,139,147,153,263,286,292,306,320,329,348,517,536],"robustness.":[58],"aim":[60],"analyse":[63],"extend":[65],"existing":[66,89],"results":[67,341,508],"on":[68,101,191,413,459],"structure":[70],"convergence":[72,204,293,340,442],"these":[74,451],"methods,":[75,162,168,322,334],"and,":[76],"in":[77,280,526],"certain":[78,177],"cases,":[79],"introduce":[81],"modifications":[82],"improving":[84,440],"numerical":[86,103,301],"performance":[87,104,302],"algorithms.":[90],"Because":[91],"possible":[94,520],"effects":[95],"degeneracy":[96],"near-degeneracy":[98],"may":[99],"have":[100],"algorithms,":[106],"thesis":[108,528],"initially":[110],"concerned":[111],"with":[112,211,247,358,394,475,540],"structural":[114,131],"differences":[115,132],"between":[116,133],"degenerate":[117,134,158,359],"nondegenerate":[119],"problems.":[120,159,317],"This":[121],"leads":[122],"naturally":[123],"new":[126],"interpretation":[127],"degeneracy,":[129],"some":[130],"non-degenerate":[136],"problems,":[137],"necessary":[138],"sufficient":[140],"conditions":[141,179],"'isolated'":[143],"solutions,":[144],"concept":[146],"properties":[148],"an":[150,363,371,377],"'extended'":[151],"problem,":[152,366],"sensitivity":[155,219,238],"analysis":[156],"Barrier":[160],"function":[161,319,327,347],"specifically":[163,323],"first":[164,449],"order":[165,208,212],"(logarithmic":[166],"function)":[167],"are":[169,298,515],"then":[170,202],"It":[172,233,402],"shown":[174,235,405],"that,":[175],"if":[176],"regularity":[178],"satisfied,":[181,201],"succcssive":[183],"estimates":[184],"x(r)":[185],"solution":[188],"x(0)":[189,206],"lie":[190],"smooth":[193],"trajectory.":[194],"If":[195],"non-degeneracy":[197,227],"assumption":[198,228],"not":[200],"r\u00bd":[209],"compared":[210,311],"r":[213],"non-degeneracy.":[215],"A":[216,273],"measure":[217,239],"introduced":[221],"becomes":[223],"large":[224,400],"when":[225],"close":[230],"violation.":[232],"that":[236,370,406],"related":[241],"growth":[244],"d\u2071(x)/dr\u2071":[246],"respect":[248,395],"i":[250],"fixed":[252],"r.":[253],"Using":[254],"information":[256,468],"extrapolation":[258,268],"procedure":[259],"can":[260,270,416],"be":[261,271,417],"analysed":[262],"number":[265,277],"useful":[267],"steps":[269],"predicted.":[272],"source":[274],"shortcomings":[279],"classical":[282,305],"algorithm":[283,297],"identified,":[285],"modification":[288],"proposed.":[290],"Properties":[291],"modified":[296,308],"analysed.":[299],"algorithms":[309],"range":[314],"test":[316],"Penalty":[318],"multiplier":[321,446],"quadratic":[325,344],"penalty":[326,346],"method":[328,374],"corresponding":[331],"augmented":[332,350,372,382],"Lagrangian":[333,351,373],"treated":[336],"next.":[337],"Order":[338],"loss":[345],"extended":[354],"include":[356],"problems":[357,474,539],"inequality":[360],"constraints.":[361,542],"For":[362,473],"equality":[364],"constrained":[365,532],"it":[367],"known":[369],"just":[376,503],"maximization":[379],"dual":[383],"function,":[384],"D\u03c3(v)":[385,415],"min":[387],"(x)":[388],"{f(x)-V\u1d40\u00b7h":[389],"+":[390],"\u03c3/2":[391],"h\u1d40\u00b7h}":[392],",":[393],"v":[397,411,514],"\u03c3":[399],"enough.":[401],"now":[404],"Newton":[408],"iteration":[409,422,463],"based":[412],"maximizing":[414],"decomposed":[418],"into":[419],"Powell/Hestenes":[421,445,462],"followed":[423],"by":[424,493],"Newtonlike":[426],"correction":[427],"v.":[429],"Utilizing":[430],"decomposition":[432,492],"result,":[433],"two":[434,452],"acceleration":[435,480,500],"techniques":[436,453],"proposed":[438],"method.":[447],"simple":[456],"device":[457],"superimposed":[458],"original":[461],"make":[465],"use":[466],"from":[469],"previous":[471],"iteration.":[472],"only":[476],"one":[477],"constraint,":[478],"technique":[481,501],"equivalent":[483],"replacing":[485],"second":[487],"(Newton-like)":[488],"part":[489],"finite":[495],"difference":[496],"approximation.":[497],"other":[499],"quasi-Newton":[505],"technique.":[506],"Numerical":[507],"using":[509],"various":[510],"updating":[511],"schemes":[512],"reported":[516],"discussed.":[518],"Finally,":[519],"uses":[521],"developed":[525],"discussed":[530],"including":[531],"optimization":[533],"without":[534],"derivatives":[535],"optimal":[537],"control":[538],"terminal":[541]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}