堵丁柱, 章祥荪
Abstract
In 1983,Du and Sun gave an algorithm which possesses superiorities of both Rosen’sgradient projection method and Wolfe’s reduced gradient method.However,in order to have theprovable global convergence,the algorithm includes an e-procedure as one of its parts.In this paper,we delete such a part and prove a convergence theorem.
OpenAlex reports 10 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.
In 1983,Du and Sun gave an algorithm which possesses superiorities of both Rosen’sgradient projection method and Wolfe’s reduced gradient method.However,in order to have theprovable global convergence,the algorithm includes an e-procedure as one of its parts.In this paper,we delete such a part and prove a convergence theorem.
Key concepts: Convergence (economics), Projection (relational algebra), Mathematics, Applied mathematics, Projection method, Order (exchange), Algorithm, Computer science