A new descent algorithm using the three-step discretization method for solving unconstrained optimization problems

DOI10.3390/math6040063OpenAlexW2800284978MaRDI QIDQ1649149

Mohammad-Mehdi Hosseini, Mina Torabi

Publication date: 5 July 2018

Published in: Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/math6040063

zbMATH Keywords

unconstrained optimizationline searchsteepest descent methodthree-step discretization method

Mathematics Subject Classification ID

Numerical analysis (65-XX) Operations research, mathematical programming (90-XX)

Related Items

A probability density function generator based on neural networks ⋮ Descent three-term DY-type conjugate gradient methods for constrained monotone equations with application

Uses Software

• minpack

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new three-term conjugate gradient algorithm for unconstrained optimization
• The steepest descent algorithm without line search for \(p\)-Laplacian
• Combination of steepest descent and BFGS methods for nonconvex nonsmooth optimization
• A literature survey of benchmark functions for global optimisation problems
• Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization
• A new analysis on the Barzilai-Borwein gradient method
• Nonlinear conjugate gradient methods with structured secant condition for nonlinear least squares problems
• A monotone gradient method via weak secant equation for unconstrained optimization
• A new gradient method via quasi-Cauchy relation which guarantees descent
• A descent algorithm without line search for unconstrained optimization
• Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
• Convergence of line search methods for unconstrained optimization
• Derivative-free restrictively preconditioned conjugate gradient path method without line search technique for solving linear equality constrained optimization
• Line search methods with guaranteed asymptotical convergence to an improving local optimum of multimodal functions
• On efficiency of nonmonotone Armijo-type line searches
• Global convergence of BFGS and PRP methods under a modified weak Wolfe-Powell line search
• A three-step finite element method for unsteady incompressible flows
• Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
• Steepest descent method with a generalized Armijo search for quasiconvex functions on Riemannian manifolds
• R-linear convergence of the Barzilai and Borwein gradient method
• A three-step wavelet Galerkin method for parabolic and hyperbolic partial differential equations
• Convergence of Three-Step Taylor Galerkin Finite Element Scheme Based Monotone Schwarz Iterative Method for Singularly Perturbed Differential-Difference Equation
• Two-Point Step Size Gradient Methods
• Testing Unconstrained Optimization Software
• A convergence analysis of a method of steepest descent and a two–step algorothm for nonlinear ill–posed problems
• On the Barzilai and Borwein choice of steplength for the gradient method
• Function minimization by conjugate gradients
• Methods of conjugate gradients for solving linear systems
• New conjugacy conditions and related nonlinear conjugate gradient methods
• Benchmarking optimization software with performance profiles.
• On the steepest descent algorithm for quadratic functions