Global convergence of a memory gradient method without line search

DOI10.1007/S12190-007-0021-4zbMATH Open1193.90214OpenAlexW2069863795MaRDI QIDQ949285FDOQ949285

Authors: Zhensheng Yu 

Publication date: 21 October 2008

Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12190-007-0021-4

Recommendations

• scientific article
• Global convergence of a memory gradient method for unconstrained optimization
• scientific article; zbMATH DE number 5210992
• A new class of memory gradient methods and its global convergence
• Global convergence of a memory gradient method with nonmonotone technique for unconstrained optimization

zbMATH Keywords

global convergenceunconstrained optimizationmemory gradientwithout line search

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Methods of reduced gradient type (90C52)

Cites Work

• Testing Unconstrained Optimization Software
• Title not available (Why is that?)
• Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• On a profit maximizing location model
• Memory gradient method for the minimization of functions
• Global convergence of a memory gradient method for unconstrained optimization
• Study on a supermemory gradient method for the minimization of functions
• A new memory gradient method under exact line search
• Global convergence of a two-parameter family of conjugate gradient methods without line search
• A new class of memory gradient methods with inexact line searches

Cited In (11)

• Title not available (Why is that?)
• A new supermemory gradient method for unconstrained optimization problems
• An ODE-based trust region method for unconstrained optimization problems
• Strong global convergence of an adaptive nonmonotone memory gradient method
• Global convergence results of a three term memory gradient method with a non-monotone line search technique
• A memory gradient method with nonmonotone line search and its global convergence
• Global convergence of a memory gradient method with closed-form step size formula
• Title not available (Why is that?)
• GLOBAL CONVERGENCE RESULTS OF A NEW THREE-TERM MEMORY GRADIENT METHOD
• The new spectral conjugate gradient method for large-scale unconstrained optimisation
• Title not available (Why is that?)

Uses Software

• minpack

This page was built for publication: Global convergence of a memory gradient method without line search

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