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