A new descent algorithm using the three-step discretization method for solving unconstrained optimization problems
type: Item
instance of: scholarly article
title: A new descent algorithm using the three-step discretization method for solving unconstrained optimization problems
author: Mina Torabi
author: Mohammad-Mehdi Hosseini
published in: Mathematics
publication date: 2018-07-05T00:00:00Z
review text: Summary: In this paper, three-step Taylor expansion, which is equivalent to third-order Taylor expansion, is used as a mathematical base of the new descent method. At each iteration of this method, three steps are performed. Each step has a similar structure to the steepest descent method, except that the generalized search direction, step length, and next iterative point are applied. Compared with the steepest descent method, it is shown that the proposed algorithm has higher convergence speed and lower computational cost and storage.
Mathematics Subject Classification ID: 65-XX
Mathematics Subject Classification ID: 90-XX
zbMATH DE Number: 6898755
zbMATH Keywords: unconstrained optimization
zbMATH Keywords: line search
zbMATH Keywords: three-step discretization method
zbMATH Keywords: steepest descent method
describes a project that uses: minpack
MaRDI profile type: Publication
full work available at URL: math6040063
OpenAlex ID: W2800284978
cites work: On efficiency of nonmonotone Armijo-type line searches
cites work: A new three-term conjugate gradient algorithm for unconstrained optimization
cites work: Q5491447
cites work: Convergence of line search methods for unconstrained optimization
cites work: Line search methods with guaranteed asymptotical convergence to an improving local optimum of multimodal functions
cites work: Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
cites work: Derivative-free restrictively preconditioned conjugate gradient path method without line search technique for solving linear equality constrained optimization
cites work: A descent algorithm without line search for unconstrained optimization
cites work: The steepest descent algorithm without line search for \(p\)-Laplacian
cites work: Q3410725
cites work: Q4868581
cites work: A convergence analysis of a method of steepest descent and a two–step algorothm for nonlinear ill–posed problems
cites work: Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
cites work: On the steepest descent algorithm for quadratic functions
cites work: A three-step finite element method for unsteady incompressible flows
cites work: Convergence of Three-Step Taylor Galerkin Finite Element Scheme Based Monotone Schwarz Iterative Method for Singularly Perturbed Differential-Difference Equation
cites work: A three-step wavelet Galerkin method for parabolic and hyperbolic partial differential equations
cites work: Two-Point Step Size Gradient Methods
cites work: Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
cites work: A new gradient method via quasi-Cauchy relation which guarantees descent
cites work: A monotone gradient method via weak secant equation for unconstrained optimization
cites work: On the Barzilai and Borwein choice of steplength for the gradient method
cites work: \(R\)-linear convergence of the Barzilai and Borwein gradient method
cites work: A new analysis on the Barzilai-Borwein gradient method
cites work: Q5488734
cites work: Methods of conjugate gradients for solving linear systems
cites work: Function minimization by conjugate gradients
cites work: Q5479892
cites work: New conjugacy conditions and related nonlinear conjugate gradient methods
cites work: Nonlinear conjugate gradient methods with structured secant condition for nonlinear least squares problems
cites work: Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
cites work: Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization
cites work: A literature survey of benchmark functions for global optimisation problems
cites work: Steepest descent method with a generalized Armijo search for quasiconvex functions on Riemannian manifolds
cites work: Testing Unconstrained Optimization Software
cites work: Benchmarking optimization software with performance profiles.
DOI: 10.3390/MATH6040063
description: scientific article; zbMATH DE number 6898755