A nonmonotone supermemory gradient algorithm for unconstrained optimization

DOI10.1007/S12190-013-0747-0zbMATH Open1296.90116OpenAlexW2034584604MaRDI QIDQ741395FDOQ741395

Authors: Yuanwen Liu, Yigui Ou 

Publication date: 12 September 2014

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

Full work available at URL: https://doi.org/10.1007/s12190-013-0747-0

Recommendations

• A supermemory gradient method for unconstrained optimization
• A supermemory gradient method based on the nonmonotone technique
• A non-monotone super-memory gradient method based on the diagonal-sparse quasi-Newton direction
• scientific article; zbMATH DE number 2150661
• A memory gradient method based on the nonmonotone technique

zbMATH Keywords

unconstrained optimizationconvergence analysisnonmonotone line searchsupermemory gradient method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Cites Work

• Benchmarking optimization software with performance profiles.
• Optimization theory and methods. Nonlinear programming
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• A three-term conjugate gradient method with sufficient descent property for unconstrained optimization
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• An unconstrained optimization test functions collection
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• Modified nonlinear conjugate gradient methods with sufficient descent property for large-scale optimization problems
• Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems
• A Nonmonotone Line Search Technique for Newton’s Method
• The convergence of conjugate gradient method with nonmonotone line search
• Nonmonotonic trust region algorithm
• Nonmonotone trust region method for solving optimization problems
• An unconstrained optimization method using nonmonotone second order Goldstein's line search
• Title not available (Why is that?)
• A survey of nonlinear conjugate gradient methods
• A nonmonotone trust region method for unconstrained optimization
• An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
• A non-monotone line search algorithm for unconstrained optimization
• On the nonmonotone line search
• A new modified nonmonotone adaptive trust region method for unconstrained optimization
• Sufficient descent nonlinear conjugate gradient methods with conjugacy condition
• Memory gradient method for the minimization of functions
• Optimization of nonlinear geological structure mapping using hybrid neuro-genetic techniques
• A new supermemory gradient method for unconstrained optimization problems
• A new super-memory gradient method with curve search rule
• Global convergence of a memory gradient method for unconstrained optimization
• Step-size estimation for unconstrained optimization methods
• Study on a supermemory gradient method for the minimization of functions
• Hybrid simulated annealing and genetic algorithms for industrial production management problems
• Hybrid pattern search and simulated annealing for fuzzy production planning problems
• A class of nonmonotone conjugate gradient methods for unconstrained optimization
• A hybrid ODE-based method for unconstrained optimization problems
• A nonmonotonic trust region algorithm for a class of semi-infinite minimax programming
• A new variant of the memory gradient method for unconstrained optimization
• Hybrid LS-SA-PS methods for solving fuzzy non-linear programming problems
• On memory gradient method with trust region for unconstrained optimization
• A new nonmonotone trust-region method of conic model for solving unconstrained optimization
• A NONMONOTONE MEMORY GRADIENT METHOD FOR UNCONSTRAINED OPTIMIZATION

Cited In (14)

• The higher-order Levenberg-Marquardt method with Armijo type line search for nonlinear equations
• A Family of Supermemory Gradient Projection Methods for Constrained Optimization
• Convergence of a new nonmonotone memory gradient method for unconstrained multiobjective optimization via robust approach
• A supermemory gradient method based on the nonmonotone technique
• A CLASS OF NONMONOTONE SPECTRAL MEMORY GRADIENT METHOD
• A new nonmonotone gradient-path algorithm for unconstrained optimization
• A memory gradient method for non-smooth convex optimization
• Title not available (Why is that?)
• Title not available (Why is that?)
• A non-monotone super-memory gradient method based on trust region technique
• A non-monotone super-memory gradient method based on the diagonal-sparse quasi-Newton direction
• A supermemory gradient projection algorithm for optimization problems with nonlinear constraints
• Memory gradient method for multiobjective optimization
• Supermemory gradient methods for monotone nonlinear equations with convex constraints

This page was built for publication: A nonmonotone supermemory gradient algorithm for unconstrained optimization

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