Liang. Ximing, Chengxian Xu
Abstract
A trust region algorithm is proposed for box constrained nonlinear optimization. At each step of the algorithm a quadratic model problem in a box is minimized. Global convergence and quadratic convergence rate to a strong local minimizer are given. Computational results are presented to show the efficiency of the algorithm
OpenAlex reports 6 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
A trust region algorithm is proposed for box constrained nonlinear optimization. At each step of the algorithm a quadratic model problem in a box is minimized. Global convergence and quadratic convergence rate to a strong local minimizer are given. Computational results are presented to show the efficiency of the algorithm
Key concepts: Trust region, Mathematics, Minification, Mathematical optimization, Branch and bound, Algorithm, Upper and lower bounds, Computer science