Properties of the sequential gradient-restoration algorithm (SGRA), part 1: Introduction and comparison with related methods |
| |
Authors: | M Rom M Avriel |
| |
Institution: | (1) Faculty of Industrial Engineering and Management, Technion, Israel Institute of Technology, Haifa, Israel |
| |
Abstract: | The sequential gradient-restoration algorithm (SGRA) was developed in the late 1960s for the solution of equality-constrained nonlinear programs and has been successfully implemented by Miele and coworkers on many large-scale problems. The algorithm consists of two major sequentially applied phases. The first is a gradient-type minimization in a subspace tangent to the constraint surface, and the second is a feasibility restoration procedure. In Part 1, the original SGRA algorithm is described and is compared with two other related methods: the gradient projection and the generalized reduced gradient methods. Next, the special case of linear equalities is analyzed. It is shown that, in this case, only the gradient-type minimization phase is needed, and the SGRA becomes identical to the steepest-descent method. Convergence proofs for the nonlinearly constrained case are given in Part 2.Partial support for this work was provided by the Fund for the Promotion of Research at Technion, Israel Institute of Technology, Haifa, Israel. |
| |
Keywords: | Sequential gradient-restoration algorithm nonlinear programming gradient-type optimization feasibility restoration |
本文献已被 SpringerLink 等数据库收录! |
|