Local minima of the trust region problem |
| |
Authors: | S Lyle M Szularz |
| |
Institution: | (1) School of Mathematics, Kingston University, Kingston upon Thames, Surrey, England |
| |
Abstract: | We consider the minimization of a quadratic formzVz+2zq subject to the two-norm constraint z=. The problem received considerable attention in the literature, notably due to its applications to a class of trust region methods in nonlinear optimization. While the previous studies were concerned with just the global minimum of the problem, we investigate the existence of all local minima. The problem is approached via the dual Lagrangian, and the necessary and sufficient conditions for the existence of all local minima are derived. We also examine the suitability of the conventional numerical techniques used to solve the problem to a class of single-instruction multiple-data computers known as processor arrays (in our case, AMT DAP 610). Simultaneously, we introduce certain hardware-oriented multisection algorithms, showing their efficiency in the case of small to medium size problems.This research was partially supported by the National Physical Laboratories of England under Contract RTP2/155/127. |
| |
Keywords: | Trust region methods multisection algorithms norm constraint single-instruction multiple-data computers |
本文献已被 SpringerLink 等数据库收录! |
|