English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

— The purpose of this paper is to discuss a variant of the Gêneralized Reduced Gradient (GRG) algorithmfor non-linear programming. This variant includes a quasi-Newton method to calculate successive search directions. Numerical expériences on 21 test-problems, exhibit the performance ofthe inclusions of BFGS or Fletcher switch option compared with the conjugale gradient of Fletcher and Reeves. The BFGS option brings a 40% saving in exécution time over the original GRG (and divides exécution time by 2,4 when the degree offreedom is at least 3),

Brève communication. Performance du gradient réduit généralisé avec une méthode quasi newtonienne pour la programmation non linéaire