scientific article; zbMATH DE number 6001451

MaRDI QIDQ3108908zbMATH OpenFDO

Authors Liliu Mo

Publication date 27 January 2012

zbMATH Keywords

global convergencelinear convergence ratememory gradient methodnumerical resultPolak-Ribieie-Polyak methodtrust regionunconstrained optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Interior-point methods (90C51)

Recommendations

• A new memory gradient method and its convergence
• scientific article; zbMATH DE number 5951924
• A new class of memory gradient methods and its global convergence
• A new parameter of memory gradient method
• scientific article; zbMATH DE number 6001261
• A new class of supermemory gradient methods
• A new class of memory gradient methods with inexact line searches
• Gradient methods with memory
• The memory gradient methods for unconstrained optimization
• A new memory gradient method with errors

Cited in

(12)

• Effective use of memory in iterative deepening search
• A new variant of the memory gradient method for unconstrained optimization
• A memory efficient incremental gradient method for regularized minimization
• A new memory gradient method and its convergence
• scientific article; zbMATH DE number 6001261 (Why is no real title available?)
• scientific article; zbMATH DE number 6001285 (Why is no real title available?)
• scientific article; zbMATH DE number 5951924 (Why is no real title available?)
• Convergence of memory gradient methods
• A new class of memory gradient methods with Wolfe line search
• On sequential strategies for loss functions with memory
• A new class of memory gradient methods with inexact line searches
• A new memory gradient method with errors

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3108908)