{"id":"https://openalex.org/W2021207880","doi":"https://doi.org/10.1137/s1052623499357945","title":"Convergent Infeasible Interior-Point Trust-Region Methods for Constrained Minimization","display_name":"Convergent Infeasible Interior-Point Trust-Region Methods for Constrained Minimization","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W2021207880","doi":"https://doi.org/10.1137/s1052623499357945","mag":"2021207880"},"language":"en","primary_location":{"id":"doi:10.1137/s1052623499357945","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623499357945","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/A5110258450","display_name":"Paul Tseng","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Paul Tseng","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5110258450"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.0305,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.84498382,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"13","issue":"2","first_page":"432","last_page":"469"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":1.0,"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":1.0,"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.9980000257492065,"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/T10545","display_name":"Optimization and Variational Analysis","score":0.9912999868392944,"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/mathematics","display_name":"Mathematics","score":0.7962433099746704},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.7461652159690857},{"id":"https://openalex.org/keywords/saddle-point","display_name":"Saddle point","score":0.5989347696304321},{"id":"https://openalex.org/keywords/stationary-point","display_name":"Stationary point","score":0.5973264575004578},{"id":"https://openalex.org/keywords/interior-point-method","display_name":"Interior point method","score":0.5218290686607361},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.519240140914917},{"id":"https://openalex.org/keywords/trust-region","display_name":"Trust region","score":0.5169012546539307},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5052953362464905},{"id":"https://openalex.org/keywords/feasible-region","display_name":"Feasible region","score":0.4652577042579651},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.4264662265777588},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.423748642206192},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4157911539077759},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.34205710887908936},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.19471031427383423},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1128496527671814},{"id":"https://openalex.org/keywords/radius","display_name":"RADIUS","score":0.08595636487007141}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7962433099746704},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.7461652159690857},{"id":"https://openalex.org/C2681867","wikidata":"https://www.wikidata.org/wiki/Q690935","display_name":"Saddle point","level":2,"score":0.5989347696304321},{"id":"https://openalex.org/C189237950","wikidata":"https://www.wikidata.org/wiki/Q2500758","display_name":"Stationary point","level":2,"score":0.5973264575004578},{"id":"https://openalex.org/C155253501","wikidata":"https://www.wikidata.org/wiki/Q461992","display_name":"Interior point method","level":2,"score":0.5218290686607361},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.519240140914917},{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.5169012546539307},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5052953362464905},{"id":"https://openalex.org/C177067428","wikidata":"https://www.wikidata.org/wiki/Q17013331","display_name":"Feasible region","level":2,"score":0.4652577042579651},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.4264662265777588},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.423748642206192},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4157911539077759},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.34205710887908936},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.19471031427383423},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1128496527671814},{"id":"https://openalex.org/C178635117","wikidata":"https://www.wikidata.org/wiki/Q747499","display_name":"RADIUS","level":2,"score":0.08595636487007141},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s1052623499357945","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s1052623499357945","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"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","score":0.4099999964237213,"id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W147998453","https://openalex.org/W158697232","https://openalex.org/W1495350211","https://openalex.org/W1497494571","https://openalex.org/W1508335918","https://openalex.org/W1518039036","https://openalex.org/W1588059640","https://openalex.org/W1632601927","https://openalex.org/W1748199557","https://openalex.org/W1963753244","https://openalex.org/W1971536112","https://openalex.org/W1976831027","https://openalex.org/W1978554456","https://openalex.org/W1979352634","https://openalex.org/W1982269962","https://openalex.org/W1987778712","https://openalex.org/W1991182684","https://openalex.org/W2004596681","https://openalex.org/W2007179152","https://openalex.org/W2010511518","https://openalex.org/W2014101933","https://openalex.org/W2014746566","https://openalex.org/W2015530812","https://openalex.org/W2032024979","https://openalex.org/W2041684917","https://openalex.org/W2053019105","https://openalex.org/W2061607408","https://openalex.org/W2071467620","https://openalex.org/W2075184363","https://openalex.org/W2077441282","https://openalex.org/W2079135578","https://openalex.org/W2083431695","https://openalex.org/W2094299970","https://openalex.org/W2121445773","https://openalex.org/W2127959492","https://openalex.org/W2157036632","https://openalex.org/W2174004662","https://openalex.org/W2326806701","https://openalex.org/W2798766386","https://openalex.org/W2912522929","https://openalex.org/W4234343832","https://openalex.org/W4240022917","https://openalex.org/W4245055410","https://openalex.org/W4254755288"],"related_works":["https://openalex.org/W2044632916","https://openalex.org/W2025573552","https://openalex.org/W2058475249","https://openalex.org/W2062042185","https://openalex.org/W3065284018","https://openalex.org/W3125179639","https://openalex.org/W2079260672","https://openalex.org/W4214812386","https://openalex.org/W2364423770","https://openalex.org/W2767233518"],"abstract_inverted_index":{"We":[0,29],"study":[1],"an":[2,91],"infeasible":[3],"primal-dual":[4],"interior-point":[5],"trust-region":[6],"method":[7,12,127,132],"for":[8,17],"constrained":[9],"minimization.":[10],"This":[11],"uses":[13],"a":[14,33,76,118],"log-barrier":[15],"function":[16],"the":[18,23,37,43,48,52,62,73,87,98,105,114,126],"slack":[19,24],"variables":[20,25],"and":[21,42,68,133],"updates":[22],"using":[26],"second-order":[27,93,119],"correction.":[28],"show":[30],"that":[31,113],"if":[32],"certain":[34],"set":[35],"containing":[36],"initial":[38],"iterate":[39],"is":[40,45,75,117,128,140],"bounded":[41],"origin":[44],"not":[46],"in":[47,65],"convex":[49],"hull":[50],"of":[51,72,83],"nearly":[53],"active":[54,106],"constraint":[55,99,107],"gradients":[56,108],"everywhere":[57],"on":[58],"this":[59,66],"set,":[60,67],"then":[61],"iterates":[63,74,84],"remain":[64],"any":[69,81],"cluster":[70,88,115],"point":[71,89,116],"first-order":[77],"stationary":[78,120],"point.":[79,121],"Moreover,":[80],"subsequence":[82],"converging":[85],"to":[86,136],"has":[90],"asymptotic":[92],"stationarity":[94],"property,":[95],"which,":[96],"when":[97,104],"functions":[100],"are":[101,109],"affine":[102],"or":[103],"linearly":[110],"independent,":[111],"implies":[112],"Preliminary":[122],"numerical":[123],"experience":[124],"with":[125],"reported.":[129],"A":[130],"primal":[131],"its":[134],"extension":[135],"semidefinite":[137],"nonlinear":[138],"programming":[139],"also":[141],"discussed.":[142]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}