{"id":"https://openalex.org/W2058475249","doi":"https://doi.org/10.1137/s1064827595284403","title":"A Trust Region Method for Nonlinear Programming Based on Primal Interior-Point Techniques","display_name":"A Trust Region Method for Nonlinear Programming Based on Primal Interior-Point Techniques","publication_year":1998,"publication_date":"1998-01-01","ids":{"openalex":"https://openalex.org/W2058475249","doi":"https://doi.org/10.1137/s1064827595284403","mag":"2058475249"},"language":"en","primary_location":{"id":"doi:10.1137/s1064827595284403","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1064827595284403","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"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 Scientific Computing","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/A5056261087","display_name":"Todd Plantenga","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Todd Plantenga","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5056261087"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.7631,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.90966863,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"20","issue":"1","first_page":"282","last_page":"305"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9998999834060669,"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.9998999834060669,"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/T10792","display_name":"Matrix Theory and Algorithms","score":0.9990000128746033,"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.988099992275238,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"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/interior-point-method","display_name":"Interior point method","score":0.8702870607376099},{"id":"https://openalex.org/keywords/trust-region","display_name":"Trust region","score":0.8254563808441162},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.7396669387817383},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6536951065063477},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5819240808486938},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.545087993144989},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.5442670583724976},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5057110786437988},{"id":"https://openalex.org/keywords/scale","display_name":"Scale (ratio)","score":0.48874950408935547},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.48381394147872925},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4790129065513611},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.43108242750167847},{"id":"https://openalex.org/keywords/matrix","display_name":"Matrix (chemical analysis)","score":0.4107135832309723},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.36195921897888184},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34263360500335693}],"concepts":[{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.8702870607376099},{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.8254563808441162},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.7396669387817383},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6536951065063477},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5819240808486938},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.545087993144989},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.5442670583724976},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5057110786437988},{"id":"https://openalex.org/C2778755073","wikidata":"https://www.wikidata.org/wiki/Q10858537","display_name":"Scale (ratio)","level":2,"score":0.48874950408935547},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.48381394147872925},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4790129065513611},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.43108242750167847},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.4107135832309723},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36195921897888184},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34263360500335693},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"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},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.0},{"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/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s1064827595284403","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1064827595284403","pdf_url":null,"source":{"id":"https://openalex.org/S165512578","display_name":"SIAM Journal on Scientific Computing","issn_l":"1064-8275","issn":["1064-8275","1095-7197"],"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 Scientific Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10","score":0.5400000214576721}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W2572016","https://openalex.org/W1486245746","https://openalex.org/W1968553199","https://openalex.org/W1972223440","https://openalex.org/W1978554456","https://openalex.org/W1980384412","https://openalex.org/W1981053712","https://openalex.org/W1981315194","https://openalex.org/W1984633545","https://openalex.org/W1986942951","https://openalex.org/W1989033306","https://openalex.org/W2000389939","https://openalex.org/W2010511518","https://openalex.org/W2017666390","https://openalex.org/W2022234616","https://openalex.org/W2026021734","https://openalex.org/W2026939622","https://openalex.org/W2033758151","https://openalex.org/W2036622774","https://openalex.org/W2038904236","https://openalex.org/W2041684917","https://openalex.org/W2046222402","https://openalex.org/W2046763850","https://openalex.org/W2049421260","https://openalex.org/W2057667075","https://openalex.org/W2058839679","https://openalex.org/W2071467620","https://openalex.org/W2077658674","https://openalex.org/W2080419468","https://openalex.org/W2083940610","https://openalex.org/W2107501462","https://openalex.org/W2157590940","https://openalex.org/W2313084557","https://openalex.org/W2340242413","https://openalex.org/W2527781137","https://openalex.org/W2733179301","https://openalex.org/W2808829785","https://openalex.org/W3012317737","https://openalex.org/W4212997115"],"related_works":["https://openalex.org/W2965106131","https://openalex.org/W2114808974","https://openalex.org/W2094757704","https://openalex.org/W25030584","https://openalex.org/W29231041","https://openalex.org/W2610104823","https://openalex.org/W1970997620","https://openalex.org/W2092044038","https://openalex.org/W2144582354","https://openalex.org/W2058475249"],"abstract_inverted_index":{"This":[0],"paper":[1],"describes":[2],"a":[3,59,80],"new":[4,20],"trust":[5],"region":[6],"method":[7],"for":[8,30,74],"solving":[9],"large-scale":[10,86],"optimization":[11,87],"problems":[12],"with":[13,84],"nonlinear":[14,33],"equality":[15],"and":[16,61,76,79],"inequality":[17],"constraints.":[18],"The":[19,46],"algorithm":[21],"employs":[22],"interior-point":[23],"techniques":[24],"from":[25],"linear":[26],"programming,":[27],"adapting":[28],"them":[29],"more":[31],"general":[32],"problems.":[34,69],"A":[35],"software":[36,47],"implementation":[37],"based":[38],"entirely":[39],"on":[40],"sparse":[41],"matrix":[42],"methods":[43],"is":[44,82],"described.":[45],"handles":[48],"infeasible":[49],"start":[50],"points,":[51],"identifies":[52],"the":[53],"active":[54],"set":[55],"of":[56],"constraints":[57],"at":[58],"solution,":[60],"can":[62],"use":[63],"second":[64],"derivative":[65],"information":[66],"to":[67],"solve":[68],"Numerical":[70],"results":[71],"are":[72],"reported":[73],"large":[75],"small":[77],"problems,":[78],"comparison":[81],"made":[83],"other":[85],"codes.":[88]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}