Global convergence without the assumption of linear independence for a trust-region algorithm for constrained optimization |
| |
Authors: | M. M. El-Alem |
| |
Affiliation: | (1) Department of Mathematics, Faculty of Science, Alexandria University, Alexandria, Egypt |
| |
Abstract: | A trust-region algorithm for solving the equality constrained optimization problem is presented. This algorithm uses the Byrd and Omojokun way of computing the trial steps, but it differs from the Byrd and Omojokun algorithm in the way steps are evaluated. A global convergence theory for this new algorithm is presented. The main feature of this theory is that the linear independence assumption on the gradients of the constraints is not assumed.This research was supported in part by the Center for Research on Parallel Computation, by Grant NSF-CCR-91-20008, and by the REDI Foundation. |
| |
Keywords: | Byrd-Omojokun step choice constrained optimization equality constrained problems global convergence trust-region methods |
本文献已被 SpringerLink 等数据库收录! |
|