Convergence of Perry and Shanno's Memoryless Quasi-Newton Method With Parameters

XIE Tiejun; CHEN Mingwen; CHENG Tao

doi:10.13374/j.issn1001-053x.2000.06.023

Volume 22 Issue 6

Aug. 2021

Turn off MathJax

Article Contents

Article Navigation > Chinese Journal of Engineering > 2000 > 22(6): 572-574

XIE Tiejun, CHEN Mingwen, CHENG Tao. Convergence of Perry and Shanno's Memoryless Quasi-Newton Method With Parameters[J]. Chinese Journal of Engineering, 2000, 22(6): 572-574. doi: 10.13374/j.issn1001-053x.2000.06.023

Citation:

XIE Tiejun, CHEN Mingwen, CHENG Tao. Convergence of Perry and Shanno's Memoryless Quasi-Newton Method With Parameters[J]. Chinese Journal of Engineering, 2000, 22(6): 572-574. doi: 10.13374/j.issn1001-053x.2000.06.023

Citation:

PDF( 317 KB)

Convergence of Perry and Shanno's Memoryless Quasi-Newton Method With Parameters

doi: 10.13374/j.issn1001-053x.2000.06.023

1. Applied Seience School, UST Beijing, Beijing 100083, China;
2. 4th Department Beijing University of Aeronautics & Astronutics, Beijing 100083, China

Received Date: 2000-01-25
Available Online: 2021-08-27

Abstract

Abstract

The convergence of perry and Shanno's memoryless quasi-Newton method with parameteers is analyzed.lt is proven that Perry and Shanno's memoryless quasi-Newton method with inexac line searches for on-convex objective function converges when parameters are in the given range.
- non-convex objective function,
- inexact line search,
- perry and shanno's memoryless quasinewton methoa,
- convergence