{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T16:57:17Z","timestamp":1781283437744,"version":"3.54.1"},"reference-count":57,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,12,1]],"date-time":"2026-12-01T00:00:00Z","timestamp":1796083200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100009827","name":"Alexandria University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100009827","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computational and Applied Mathematics"],"published-print":{"date-parts":[[2026,12]]},"DOI":"10.1016\/j.cam.2026.117844","type":"journal-article","created":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T15:55:00Z","timestamp":1780070100000},"page":"117844","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["CHKS interior-point trust-region algorithm to solve a nonlinear constrained optimization problem"],"prefix":"10.1016","volume":"488","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5267-8700","authenticated-orcid":false,"given":"B.","family":"El-Sobky","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Y.","family":"Abo-Elnaga","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"G.","family":"Ashry","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M.F.","family":"Zidan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.cam.2026.117844_bib0001","series-title":"Constrained Optimization and Lagrange Multiplier Method","author":"Bertsekas","year":"1996"},{"key":"10.1016\/j.cam.2026.117844_bib0002","series-title":"Technical Report","article-title":"A Trust-Region Method Based on Interior Point Techniques for Nonlinear Programming","author":"Byrd","year":"1988"},{"key":"10.1016\/j.cam.2026.117844_bib0003","series-title":"Nonlinear Programming Theory and Algorithms","author":"Bazaraa","year":"2006"},{"key":"10.1016\/j.cam.2026.117844_bib0004","series-title":"Technical Report","article-title":"Trust-Region Interior-Point SQP Algorithms for a Class of Nonlinear Programming Problems","author":"Dennis","year":"1994"},{"issue":"3","key":"10.1016\/j.cam.2026.117844_bib0005","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1007\/BF02275347","article-title":"On the formulation and theory of the Newton interior-point method for nonlinear programming","volume":"89","author":"El-Bakry","year":"1996","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/j.cam.2026.117844_bib0006","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1016\/j.cam.2018.03.004","article-title":"A penalty method with trust-region mechanism for nonlinear bilevel optimization problem","volume":"340","author":"El-Sobky","year":"2018","journal-title":"J. Comput. Appl. Math."},{"issue":"13","key":"10.1016\/j.cam.2026.117844_bib0007","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3390\/math9131551","article-title":"Trust-region based penalty barrier algorithm for constrained nonlinear programming problems: an application of design of minimum cost canal sections","volume":"9","author":"El-Sobky","year":"2021","journal-title":"Mathematics"},{"key":"10.1016\/j.cam.2026.117844_bib0008","series-title":"An Interior-Point Trust-Region Algorithm to Solve a Nonlinear Bilevel Programming Problem","volume":"7","author":"El-Sobky","year":"2022"},{"key":"10.1016\/j.cam.2026.117844_bib0009","first-page":"127","article-title":"A global convergence theory for an active trust region algorithm for solving the general nonlinear programming problem","volume":"144","author":"El-Sobky","year":"2003","journal-title":"Appl. Math. Comput. Arch."},{"issue":"1","key":"10.1016\/j.cam.2026.117844_bib0010","first-page":"928","article-title":"A multiplier active trust-region algorithm for solving general nonlinear programming problem","volume":"219","author":"El-Sobky","year":"2012","journal-title":"Appl. Math. Comput."},{"key":"10.1016\/j.cam.2026.117844_bib0011","first-page":"125","article-title":"An active-set interior-point trust-region algorithm","volume":"14","author":"El-Sobky","year":"2018","journal-title":"Pacific J. Optim."},{"key":"10.1016\/j.cam.2026.117844_bib0012","doi-asserted-by":"crossref","first-page":"2605","DOI":"10.1007\/s40314-017-0468-3","article-title":"An active-set algorithm and a trust-region approach in constrained minimax problem","volume":"37","author":"El-Sobky","year":"2018","journal-title":"Comp. Appl. Math."},{"key":"10.1016\/j.cam.2026.117844_bib0013","doi-asserted-by":"crossref","first-page":"881","DOI":"10.4208\/jcm.1705-m2016-0735","article-title":"A trust-region algorithm for solving mini-max problem","volume":"36","author":"El-Sobky","year":"2018","journal-title":"J. Comput. Math."},{"issue":"8","key":"10.1016\/j.cam.2026.117844_bib0014","doi-asserted-by":"crossref","first-page":"412","DOI":"10.3390\/fractalfract6080412","article-title":"An active-set Fischer-Burmeister trust-region algorithm to solve a nonlinear bilevel optimization problem","volume":"6","author":"El-Sobky","year":"2022","journal-title":"Fractal Fract."},{"key":"10.1016\/j.cam.2026.117844_bib0015","doi-asserted-by":"crossref","first-page":"16112","DOI":"10.3934\/math.2022882","article-title":"An active-set with barrier method and trust-region mechanism to solve a nonlinear Bilevel programming problem","volume":"7","author":"El-Sobky","year":"2022","journal-title":"AIMS Math."},{"key":"10.1016\/j.cam.2026.117844_bib0016","doi-asserted-by":"crossref","first-page":"13706","DOI":"10.3934\/math.2023696","article-title":"A trust-region based an active-set interior-point algorithm for fuzzy continuous static games","volume":"8","author":"El-Sobky","year":"2023","journal-title":"AIMS Math."},{"issue":"4","key":"10.1016\/j.cam.2026.117844_bib0017","doi-asserted-by":"crossref","first-page":"6528","DOI":"10.3934\/math.2024318","article-title":"A nonmonton active interior point trust region algorithm based on CHKS smoothing function for solving nonlinear bilevel programming problems","volume":"9","author":"El-Sobky","year":"2024","journal-title":"AIMS Math."},{"key":"10.1016\/j.cam.2026.117844_bib0018","doi-asserted-by":"crossref","first-page":"672","DOI":"10.1016\/j.joems.2016.04.003","article-title":"An interior-point penalty active-set trust-region algorithm","volume":"24","author":"El-Sobky","year":"2016","journal-title":"J. Egypt. Math. Soc."},{"key":"10.1016\/j.cam.2026.117844_bib0019","doi-asserted-by":"crossref","first-page":"1168","DOI":"10.1137\/0614081","article-title":"A non-interior-point continuation method for linear complementarity problem","volume":"14","author":"Chen","year":"1993","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/j.cam.2026.117844_bib0020","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1137\/S0895479894273134","article-title":"Some noninterior continuation methods for linear complementarity problems","volume":"17","author":"Kanzow","year":"1996","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"10.1016\/j.cam.2026.117844_bib0021","series-title":"Proceeding of International Congress of Mathematicians","first-page":"72","article-title":"Algorithms for solving equations","author":"Smale","year":"1987"},{"key":"10.1016\/j.cam.2026.117844_bib0022","doi-asserted-by":"crossref","first-page":"418","DOI":"10.1137\/0806023","article-title":"An interior trust region approach for nonlinear minimization subject to bounds","volume":"6","author":"Coleman","year":"1996","journal-title":"SIAM J. Optim."},{"issue":"4","key":"10.1016\/j.cam.2026.117844_bib0023","doi-asserted-by":"crossref","first-page":"1847","DOI":"10.1137\/120892362","article-title":"A trust-region algorithm with adaptive stochastic collocation for PDE optimization under uncertainty","volume":"35","author":"Kouri","year":"2020","journal-title":"SIAM J. Sci. Comput."},{"key":"10.1016\/j.cam.2026.117844_bib0024","article-title":"A stochastic trust-region method for unconstrained optimization problems","author":"Li","year":"2019","journal-title":"Math. Probl. Eng."},{"key":"10.1016\/j.cam.2026.117844_bib0025","series-title":"Nonlinear Programming: Sequential Unconstrained Minimization Techniques","author":"Fiacco","year":"1968"},{"key":"10.1016\/j.cam.2026.117844_bib0026","series-title":"Numerical Methods for Unconstrained Optimization and Nonlinear Equations","author":"Dennis","year":"1983"},{"key":"10.1016\/j.cam.2026.117844_bib0027","article-title":"Test Examples for Nonlinear Programming Codes","volume":"187","author":"Hock","year":"1981"},{"key":"10.1016\/j.cam.2026.117844_bib0028","article-title":"More Test Examples for Nonlinear Programming Codes","volume":"282","author":"Schittkowski","year":"1987"},{"key":"10.1016\/j.cam.2026.117844_bib0029","unstructured":"MATHWORKS, Natick, Massachusetts, matlab version 6.0.0.88, release 12, optimization toolbox 2.1, 2001, (https:\/\/www.mathworks.com\/access\/helpdesk\/help\/toolbox\/optim\/fmincon.shtml)."},{"key":"10.1016\/j.cam.2026.117844_bib0030","article-title":"(LANCELOT): A Fortran Package for Large-Scale Nonlinear (Release A) Optimization","volume":"17","author":"Conn","year":"1992"},{"issue":"2","key":"10.1016\/j.cam.2026.117844_bib0031","doi-asserted-by":"crossref","first-page":"2509","DOI":"10.3934\/math.2025117","article-title":"A nonmonotone trust region technique with active-set and interior-point methods to solve nonlinearly constrained optimization problems","volume":"10","author":"El-Sobky","year":"2025","journal-title":"AIMS Math."},{"key":"10.1016\/j.cam.2026.117844_bib0032","doi-asserted-by":"crossref","first-page":"837","DOI":"10.1080\/10556788.2013.858156","article-title":"An interior point method for nonlinear programming with infeasibility detection capabilities","volume":"29","author":"Nocedal","year":"2014","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"10.1016\/j.cam.2026.117844_bib0033","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","article-title":"Benchmarking optimization software with performance profiles","volume":"91","author":"Dolan","year":"2002","journal-title":"Math. Program."},{"issue":"20","key":"10.1016\/j.cam.2026.117844_bib0034","doi-asserted-by":"crossref","first-page":"3043","DOI":"10.1016\/j.ins.2008.02.014","article-title":"Differential evolution with dynamic stochastic selection for constrained optimization","volume":"178","author":"Zhang","year":"2008","journal-title":"Inf. Sci."},{"issue":"2","key":"10.1016\/j.cam.2026.117844_bib0035","doi-asserted-by":"crossref","first-page":"947","DOI":"10.1007\/s00158-009-0454-5","article-title":"An effective differential evolution with level comparison for constrained engineering design","volume":"41","author":"Wang","year":"2010","journal-title":"Struct. Multidiscip. Optim."},{"issue":"0","key":"10.1016\/j.cam.2026.117844_bib0036","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s00158-008-0238-3","article-title":"Constrained optimization based on hybrid evolutionary algorithm and adaptive constraint handling technique","volume":"37","author":"Wang","year":"2009","journal-title":"Struct. Multidiscip. Optim."},{"key":"10.1016\/j.cam.2026.117844_bib0037","series-title":"2006 IEEE International Conference on Evolutionary Computation","first-page":"25","article-title":"Modified differential evolution for constrained optimization","author":"Mezura-Montes","year":"2006"},{"issue":"2","key":"10.1016\/j.cam.2026.117844_bib0038","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1016\/j.asoc.2009.08.031","article-title":"Hybridizing particle swarm optimization with differential evolution for constrained numerical and engineering optimization","volume":"10","author":"Liu","year":"2010","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.cam.2026.117844_bib0039","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1016\/j.compstruc.2014.03.007","article-title":"Symbiotic organisms search: a new metaheuristic optimization algorithm","volume":"139","author":"Cheng","year":"2014","journal-title":"Comput. Struct."},{"key":"10.1016\/j.cam.2026.117844_bib0040","doi-asserted-by":"crossref","first-page":"3902","DOI":"10.1016\/j.cma.2004.09.007","article-title":"A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice","volume":"194","author":"Lee","year":"2005","journal-title":"Comput. Methods Appl. Mech. Eng."},{"key":"10.1016\/j.cam.2026.117844_bib0041","doi-asserted-by":"crossref","first-page":"777","DOI":"10.3934\/jimo.2014.10.777","article-title":"Solving structural engineering design optimization problems using an artificial bee colony algorithm","volume":"10","author":"Garg","year":"2014","journal-title":"J. Ind. Manage. Optim."},{"key":"10.1016\/j.cam.2026.117844_bib0042","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/j.aei.2005.09.001","article-title":"A hybrid real-parameter genetic algorithm for function optimization","volume":"20","author":"Hwang","year":"2006","journal-title":"Adv. Eng. Inf."},{"key":"10.1016\/j.cam.2026.117844_bib0043","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1115\/1.3438995","article-title":"Optimal design of a class of welded structures using geometric programming","volume":"98","author":"Ragsdell","year":"1976","journal-title":"J. Eng. Ind."},{"issue":"2","key":"10.1016\/j.cam.2026.117844_bib0044","doi-asserted-by":"crossref","first-page":"537","DOI":"10.1080\/0305215X.2011.598520","article-title":"A constrained optimization algorithm based on the simplex search method","volume":"44","author":"Mehta","year":"2012","journal-title":"Eng. Optim."},{"key":"10.1016\/j.cam.2026.117844_bib0045","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1109\/TEVC.2003.814902","article-title":"Society and civilization: an optimization algorithm based on the simulation of social behavior","volume":"7","author":"Ray","year":"2003","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"5","key":"10.1016\/j.cam.2026.117844_bib0046","doi-asserted-by":"crossref","first-page":"2592","DOI":"10.1016\/j.asoc.2012.11.026","article-title":"Mine blast algorithm: a new population-based algorithm for solving constrained engineering optimization problems","volume":"13","author":"Sadollah","year":"2013","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.cam.2026.117844_bib0047","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/j.advengsoft.2015.01.010","article-title":"The ant lion optimizer","volume":"83","author":"Mirjalili","year":"2015","journal-title":"Adv. Eng. Softw."},{"key":"10.1016\/j.cam.2026.117844_bib0048","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s00366-011-0241-y","article-title":"Cuckoo search algorithm: a metaheuristic approach to solve structural optimization problems","volume":"29","author":"Gandomi","year":"2013","journal-title":"Eng. Comput."},{"key":"10.1016\/j.cam.2026.117844_bib0049","doi-asserted-by":"crossref","unstructured":"H. Chickermane, H. GEA, Structural optimization using a new local approximation method, Int. J. Numer. Methods Eng. 39 (1996) 829\u2013846.","DOI":"10.1002\/(SICI)1097-0207(19960315)39:5<829::AID-NME884>3.0.CO;2-U"},{"key":"10.1016\/j.cam.2026.117844_bib0050","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/j.asoc.2014.10.026","article-title":"Enhanced leader PSO (ELPSO), a new PSO variant for solving global optimization problems","volume":"26","author":"Jordehi","year":"2015","journal-title":"Appl. Soft Comput. J."},{"key":"10.1016\/j.cam.2026.117844_bib0051","doi-asserted-by":"crossref","first-page":"2406","DOI":"10.1108\/EC-07-2017-0264","article-title":"L\u00e9vy flight trajectory-based whale optimization algorithm for engineering optimization","volume":"35","author":"Zhou","year":"2018","journal-title":"Eng. Comput."},{"key":"10.1016\/j.cam.2026.117844_bib0052","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/S0166-3615(99)00046-9","article-title":"Use of a self-adaptive penalty approach for engineering optimization problems","volume":"41","author":"Coello","year":"2000","journal-title":"Comput. Ind."},{"key":"10.1016\/j.cam.2026.117844_bib0053","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/S1474-0346(02)00011-3","article-title":"Constraint-handling in genetic algorithms through the use of dominance-based tournament selection","volume":"16","author":"Coello","year":"2002","journal-title":"Adv. Eng. Inf."},{"key":"10.1016\/j.cam.2026.117844_bib0054","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/j.engappai.2006.03.003","article-title":"An effective co-evolutionary particle swarm optimization for engineering optimization problems","volume":"20","author":"He","year":"2006","journal-title":"Eng. Appl. Artif. Intell."},{"key":"10.1016\/j.cam.2026.117844_bib0055","first-page":"1407","article-title":"A hybrid particle swarm optimization with a feasibility-based rule for constrained optimization","volume":"186","author":"He","year":"2007","journal-title":"Appl. Math. Comput."},{"issue":"2","key":"10.1016\/j.cam.2026.117844_bib0056","doi-asserted-by":"crossref","first-page":"3880","DOI":"10.1016\/j.eswa.2008.02.039","article-title":"Hybrid Nelder\u2013Mead simplex search and particle swarm optimization for constrained engineering design problems","volume":"36","author":"Zahara","year":"2009","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.cam.2026.117844_bib0057","doi-asserted-by":"crossref","first-page":"1676","DOI":"10.1016\/j.eswa.2009.06.044","article-title":"Gaussian quantum-behaved particle swarm optimization approaches for constrained engineering design problems","volume":"37","author":"Coelho","year":"2010","journal-title":"Expert Syst. Appl."}],"container-title":["Journal of Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042726004863?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377042726004863?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T16:11:18Z","timestamp":1781280678000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377042726004863"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,12]]},"references-count":57,"alternative-id":["S0377042726004863"],"URL":"https:\/\/doi.org\/10.1016\/j.cam.2026.117844","relation":{},"ISSN":["0377-0427"],"issn-type":[{"value":"0377-0427","type":"print"}],"subject":[],"published":{"date-parts":[[2026,12]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"CHKS interior-point trust-region algorithm to solve a nonlinear constrained optimization problem","name":"articletitle","label":"Article Title"},{"value":"Journal of Computational and Applied Mathematics","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cam.2026.117844","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"117844"}}