A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method | Zendy

Min Li | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A three term Polak-Ribière-Polyak conjugate gradient method close to the memoryless BFGS quasi-Newton method

Author(s) -

Min Li

Publication year - 2018

Publication title -

journal of industrial and management optimization

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.325

H-Index - 32

eISSN - 1553-166X

pISSN - 1547-5816

DOI - 10.3934/jimo.2018149

Subject(s) - line search , broyden–fletcher–goldfarb–shanno algorithm , conjugate gradient method , mathematics , gradient descent , quasi newton method , term (time) , line (geometry) , convergence (economics) , combinatorics , nonlinear conjugate gradient method , algorithm , newton's method , computer science , geometry , artificial intelligence , physics , computer network , computer security , asynchronous communication , nonlinear system , quantum mechanics , artificial neural network , economics , radius , economic growth

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research