{"id":"https://openalex.org/W2572016","doi":null,"title":"Trust region algorithms for optimization with nonlinear equality and inequality constraints","display_name":"Trust region algorithms for optimization with nonlinear equality and inequality constraints","publication_year":1990,"publication_date":"1990-01-03","ids":{"openalex":"https://openalex.org/W2572016","mag":"2572016"},"language":"en","primary_location":{"id":"mag:2572016","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=76519","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null},"parent_works":[],"lineage":["https://openalex.org/W2572016"],"child_works_count":0,"type":"article","is_traditional":true,"indexed_in":[],"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/A5078691157","display_name":"E. O. Omojokun","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"E. O. Omojokun","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5078691157"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":133,"citation_normalized_percentile":{"value":0.00075472,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":99},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9990000128746033,"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.9990000128746033,"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.00019999999494757503,"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/T10791","display_name":"Advanced Control Systems Optimization","score":0.00019999999494757503,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/trust-region-method","display_name":"trust region method","score":0.9390000104904175},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"nonlinear programming","score":0.8009999990463257},{"id":"https://openalex.org/keywords/nonlinear-equality-constraints","display_name":"nonlinear equality constraints","score":0.9679999947547913},{"id":"https://openalex.org/keywords/nonlinear-inequality-constraints","display_name":"nonlinear inequality constraints","score":0.9769999980926514},{"id":"https://openalex.org/keywords/sequential-quadratic-programming","display_name":"sequential quadratic programming","score":0.9779999852180481},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.847000002861023},{"id":"https://openalex.org/keywords/active-set-strategy","display_name":"active set strategy","score":0.8429999947547913},{"id":"https://openalex.org/keywords/local-convergence-analysis","display_name":"local convergence analysis","score":0.9610000252723694},{"id":"https://openalex.org/keywords/negative-curvature-directions","display_name":"negative curvature directions","score":0.9369999766349792}],"concepts":[{"id":"https://openalex.org/C198927703","wikidata":"https://www.wikidata.org/wiki/Q4373881","display_name":"Sequential quadratic programming","level":3,"score":0.7691227197647095},{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.7679715156555176},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6468188762664795},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.6095883846282959},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5717911124229431},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.5524805188179016},{"id":"https://openalex.org/C81845259","wikidata":"https://www.wikidata.org/wiki/Q290117","display_name":"Quadratic programming","level":2,"score":0.47833725810050964},{"id":"https://openalex.org/C85522705","wikidata":"https://www.wikidata.org/wiki/Q3278015","display_name":"Line search","level":3,"score":0.4708302319049835},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.44038134813308716},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41534367203712463},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.316520094871521},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"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":1,"locations":[{"id":"mag:2572016","doi":null,"is_oa":false,"landing_page_url":"https://dl.acm.org/citation.cfm?id=76519","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W7214603854","https://openalex.org/W2080005375","https://openalex.org/W2393708956","https://openalex.org/W7097985787","https://openalex.org/W11792638","https://openalex.org/W2080419468","https://openalex.org/W1512804140","https://openalex.org/W2389157665","https://openalex.org/W2400562750","https://openalex.org/W2351487514"],"abstract_inverted_index":{"We":[0,105],"consider":[1],"the":[2,56,71,79,83,90,95,116,124,154,168,176,186,200,217],"general":[3],"nonlinear":[4,11,22,72,86,126],"optimization":[5],"problem":[6,125],"defined":[7],"as,":[8],"minimize":[9],"a":[10,19,107,112,129,138,189],"real-valued":[12],"function":[13],"of":[14,21,29,85,115,123,158,188,202,208,216],"several":[15],"variables,":[16],"subject":[17,118],"to":[18,60,81,119,205],"set":[20,143],"equality":[23,73],"and":[24,45,101,128,145,167,183,227],"inequality":[25,87],"constraints.":[26],"This":[27],"class":[28],"problems":[30],"arise":[31],"in":[32,39,89,198,212],"many":[33],"real":[34],"life":[35],"applications,":[36],"for":[37,69],"example":[38],"engineering":[40],"design,":[41],"chemical":[42],"equilibrium,":[43],"simulation":[44],"data":[46],"fitting.":[47],"In":[48],"this":[49],"research,":[50],"we":[51,65,77],"present":[52],"algorithms":[53,93,160,164],"that":[54,221],"use":[55,94,206],"trust":[57,102,130],"region":[58,103,131],"technique":[59],"solve":[61],"these":[62],"problems.":[63],"First,":[64],"develop":[66],"an":[67,141],"algorithm":[68,80],"solving":[70],"constrained":[74],"optimization,":[75],"then":[76],"generalize":[78],"handle":[82],"inclusion":[84],"constraints":[88,127,134],"problem.":[91],"The":[92,163],"successive":[96],"quadratic":[97,113],"programming":[98],"(SQP)":[99],"approach":[100],"technique.":[104,149],"define":[106],"model":[108,169],"subproblem":[109,147],"which":[110,152,199],"minimizes":[111],"approximation":[114],"Lagrangian":[117],"modified":[120],"relaxed":[121],"linearizations":[122],"constraint.":[132],"Inequality":[133],"are":[135,165,181,196],"handled":[136],"by":[137,174],"compromise":[139],"between":[140],"active":[142],"strategy":[144],"IQP":[146],"solution":[148],"An":[150],"analysis":[151],"describes":[153],"local":[155],"convergence":[156],"properties":[157],"our":[159,203,222],"is":[161,171,224],"presented.":[162],"implemented":[166],"minimization":[170],"done":[172],"approximately":[173],"using":[175],"dogleg":[177],"approach.":[178],"Numerical":[179],"results":[180,187,211],"presented":[182,197],"compared":[184],"with":[185],"popular":[190],"line":[191],"search":[192],"method.":[193],"Some":[194],"examples":[195],"ability":[201],"method":[204,223],"directions":[207],"negative":[209],"curvature":[210],"greater":[213],"reliability.":[214],"Results":[215],"numerical":[218],"experiments":[219],"indicate":[220],"very":[225],"robust":[226],"reasonably":[228],"efficient.":[229]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":5},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":13},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":7}],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2016-06-24T00:00:00"}