Algorithm Models with Polak's Procedure |
Received:September 18, 1981 |
Key Words:
|
Fund Project: |
|
Hits: 2029 |
Download times: 840 |
Abstract: |
In this paper, we give two algorithm models with Polak's procedure for linearly constrained optimization problem and a group of sufficiant conditions on their global convergence. Using them, it is easily seen that the convergence of algorithms in [2~5] can be proved. |
Citation: |
DOI:10.3770/j.issn:1000-341X.1983.03.022 |
View Full Text View/Add Comment |