Abstract
In this paper we present a new algorithm of steepest descent type. A new technique for steplength computation and a monotone strategy are provided in the framework of the Barzilai and Borwein method. In contrast with Barzilai and Borwein approach's in which the steplength is computed by means of a simple approximation of the Hessian in the form of scalar multiple of identity and an interpretation of the secant equation, the new proposed algorithm considers another approximation of the Hessian based on the weak secant equation. By incorporating a simple monotone strategy, the resulting algorithm belongs to the class of monotone gradient methods with linearly convergence. Numerical results suggest that for non-quadratic minimization problem, the new method clearly outperforms the Barzilai-Borwein method.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
