{"id":"https://openalex.org/W1978368079","doi":"https://doi.org/10.1137/0805018","title":"A Robust Trust-Region Algorithm with a Nonmonotonic Penalty Parameter Scheme for Constrained Optimization","display_name":"A Robust Trust-Region Algorithm with a Nonmonotonic Penalty Parameter Scheme for Constrained Optimization","publication_year":1995,"publication_date":"1995-05-01","ids":{"openalex":"https://openalex.org/W1978368079","doi":"https://doi.org/10.1137/0805018","mag":"1978368079"},"language":"en","primary_location":{"id":"doi:10.1137/0805018","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0805018","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/A5003694882","display_name":"Mahmoud El-Alem","orcid":"https://orcid.org/0000-0001-9634-6046"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Mahmoud El-Alem","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5003694882"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":6.1477,"has_fulltext":false,"cited_by_count":49,"citation_normalized_percentile":{"value":0.96354853,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"5","issue":"2","first_page":"348","last_page":"378"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9979000091552734,"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.9979000091552734,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9805999994277954,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10851","display_name":"Optical Wireless Communication Technologies","score":0.9684000015258789,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/augmented-lagrangian-method","display_name":"Augmented Lagrangian method","score":0.8251841068267822},{"id":"https://openalex.org/keywords/trust-region","display_name":"Trust region","score":0.7888858914375305},{"id":"https://openalex.org/keywords/hessian-matrix","display_name":"Hessian matrix","score":0.7214398980140686},{"id":"https://openalex.org/keywords/penalty-method","display_name":"Penalty method","score":0.7048875093460083},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.683347225189209},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.6298781633377075},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5800340175628662},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5554674863815308},{"id":"https://openalex.org/keywords/quadratic-equation","display_name":"Quadratic equation","score":0.4785481095314026},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.47347962856292725},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4527112543582916},{"id":"https://openalex.org/keywords/symbolic-convergence-theory","display_name":"Symbolic convergence theory","score":0.4270781874656677},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.22240480780601501},{"id":"https://openalex.org/keywords/applied-mathematics","display_name":"Applied mathematics","score":0.21609842777252197}],"concepts":[{"id":"https://openalex.org/C150452318","wikidata":"https://www.wikidata.org/wiki/Q4820432","display_name":"Augmented Lagrangian method","level":2,"score":0.8251841068267822},{"id":"https://openalex.org/C89109886","wikidata":"https://www.wikidata.org/wiki/Q1535924","display_name":"Trust region","level":3,"score":0.7888858914375305},{"id":"https://openalex.org/C203616005","wikidata":"https://www.wikidata.org/wiki/Q620495","display_name":"Hessian matrix","level":2,"score":0.7214398980140686},{"id":"https://openalex.org/C6180225","wikidata":"https://www.wikidata.org/wiki/Q3411771","display_name":"Penalty method","level":2,"score":0.7048875093460083},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.683347225189209},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.6298781633377075},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5800340175628662},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5554674863815308},{"id":"https://openalex.org/C129844170","wikidata":"https://www.wikidata.org/wiki/Q41299","display_name":"Quadratic equation","level":2,"score":0.4785481095314026},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.47347962856292725},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4527112543582916},{"id":"https://openalex.org/C64980692","wikidata":"https://www.wikidata.org/wiki/Q16191959","display_name":"Symbolic convergence theory","level":3,"score":0.4270781874656677},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.22240480780601501},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.21609842777252197},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0805018","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0805018","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:scholarship.rice.edu:1911/101770","is_oa":false,"landing_page_url":"http://hdl.handle.net/1911/101770","pdf_url":null,"source":{"id":"https://openalex.org/S4306401268","display_name":"Rice Digital Scholarship Archive (Rice University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I74775410","host_organization_name":"Rice University","host_organization_lineage":["https://openalex.org/I74775410"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Technical report"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.46000000834465027,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1264261","https://openalex.org/W79353284","https://openalex.org/W1485207068","https://openalex.org/W1516152711","https://openalex.org/W1538293189","https://openalex.org/W1771302106","https://openalex.org/W1976222070","https://openalex.org/W1989033306","https://openalex.org/W1993553082","https://openalex.org/W1994603587","https://openalex.org/W1996881663","https://openalex.org/W2007195025","https://openalex.org/W2013722634","https://openalex.org/W2038904236","https://openalex.org/W2048637459","https://openalex.org/W2068484625","https://openalex.org/W2070513764","https://openalex.org/W2094879958","https://openalex.org/W2108814972","https://openalex.org/W2482779561","https://openalex.org/W2565079037","https://openalex.org/W3118870036"],"related_works":["https://openalex.org/W2352811179","https://openalex.org/W2373906883","https://openalex.org/W2115477667","https://openalex.org/W633727474","https://openalex.org/W2089168582","https://openalex.org/W2026387094","https://openalex.org/W1989684674","https://openalex.org/W2122918402","https://openalex.org/W2788600501","https://openalex.org/W1978368079"],"abstract_inverted_index":{"An":[0],"algorithm":[1,18,67,117,125,159],"for":[2,43,115,157],"solving":[3],"the":[4,25,35,44,51,62,69,72,85,89,94,131,175,179],"problem":[5],"of":[6,61,65,91,106,143,171,178],"minimizing":[7],"a":[8,20,28,57,169,188],"nonlinear":[9],"function":[10,186],"subject":[11],"to":[12,38,41,88,97],"equality":[13],"constraints":[14,180],"is":[15,19,31,54,68,75,102,110,118,121,126,145,150],"introduced.":[16],"This":[17,148],"trust-region":[21,36],"algorithm.":[22],"In":[23],"computing":[24],"trial":[26],"step,":[27],"projected-Hessian":[29],"technique":[30],"used":[32],"that":[33,42,71,82,123,130,154,160],"converts":[34],"subproblem":[37],"one":[39],"similar":[40],"unconstrained":[45],"case.":[46],"To":[47],"force":[48],"global":[49],"convergence,":[50],"augmented":[52],"Lagrangian":[53],"employed":[55],"as":[56,187],"merit":[58,189],"function.":[59,190],"One":[60],"main":[63],"advantages":[64],"this":[66,107,116,124],"way":[70],"penalty":[73,95,108,185],"parameter":[74,96,109],"updated.":[76],"We":[77],"introduce":[78],"an":[79],"updating":[80],"scheme":[81],"allows":[83],"(for":[84],"first":[86],"time,":[87],"best":[90],"our":[92],"knowledge)":[93],"be":[98],"decreased":[99],"whenever":[100],"it":[101,155],"warranted.":[103],"The":[104,140],"behavior":[105],"studied.":[111],"A":[112],"convergence":[113,144],"theory":[114,149],"presented.":[119],"It":[120],"shown":[122],"globally":[127],"convergent":[128],"and":[129,181],"globalization":[132],"strategy":[133],"will":[134],"not":[135],"disrupt":[136],"fast":[137],"local":[138,141],"convergence.":[139],"rate":[142],"also":[146],"discussed.":[147],"sufficiently":[151],"general":[152],"so":[153],"holds":[156],"any":[158],"generates":[161],"steps":[162],"whose":[163],"normal":[164],"components":[165],"give":[166],"at":[167],"least":[168],"fraction":[170],"Cauchy":[172],"decrease":[173],"in":[174],"quadratic":[176],"model":[177],"uses":[182],"Fletcher\u2019s":[183],"exact":[184]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}