scientific article; zbMATH DE number 6001451

zbMATH Open1240.65188MaRDI QIDQ3108908FDOQ3108908

Liliu Mo

Publication date: 27 January 2012

Title of this publication is not available (Why is that?)

Recommendations

• A new memory gradient method and its convergence
• scientific article
• A new class of memory gradient methods and its global convergence
• A new parameter of memory gradient method
• scientific article
• 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

zbMATH Keywords

global convergencenumerical resultunconstrained optimizationtrust regionlinear convergence ratememory gradient methodPolak-Ribieie-Polyak method

Mathematics Subject Classification ID

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

Cited In (10)

• A new class of memory gradient methods with inexact line searches
• Title not available (Why is that?)
• Title not available (Why is that?)
• On sequential strategies for loss functions with memory
• Convergence of memory gradient methods
• A new class of memory gradient methods with Wolfe line search
• A memory efficient incremental gradient method for regularized minimization
• A new variant of the memory gradient method for unconstrained optimization
• Title not available (Why is that?)
• Effective use of memory in iterative deepening search

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)