A descent algorithm without line search for unconstrained optimization

DOI10.1016/J.AMC.2009.08.058MaRDI QIDQ1044422zbMATH OpenOpenAlexFDO

Authors Guangming Zhou

Publication date 18 December 2009

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2009.08.058

zbMATH Keywords

convergencealgorithmnumerical resultunconstrained optimizationdescent methodline search

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)

Recommendations

• Convergence of descent method without line search
• A descent method for unconstrained optimization problems
• Publication:4415858
• Convergence of descent method with new line search
• A descent spectral conjugate gradient algorithm for unconstrained optimization

Cites work

• scientific article; zbMATH DE number 4147424 (Why is no real title available?)
• A class of gradient unconstrained minimization algorithms with adaptive stepsize
• A new descent algorithm with curve search rule
• Adaptive two-point stepsize gradient algorithm
• Alternate minimization gradient method
• Conjugate Directions without Linear Searches
• Convergence of descent method without line search
• Convergence of line search methods for unconstrained optimization
• Estimation of the optimal constants and the thickness of thin films using unconstrained optimization
• Global convergence of a two-parameter family of conjugate gradient methods without line search
• Global convergence of conjugate gradient methods without line search
• Gradient Method with Retards and Generalizations
• Minimization algorithms based on supervisor and searcher cooperation
• Modified two-point stepsize gradient methods for unconstrained optimization
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• Numerical Optimization
• On the Barzilai and Borwein choice of steplength for the gradient method
• Optimization theory and methods. Nonlinear programming
• Testing Unconstrained Optimization Software
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• Two-Point Step Size Gradient Methods
• \(R\)-linear convergence of the Barzilai and Borwein gradient method

Cited in

(10)

• Greatest descent algorithms in unconstrained optimization
• Descent direction method with line search for unconstrained optimization in noisy environment
• A new descent algorithm using the three-step discretization method for solving unconstrained optimization problems
• The steepest descent algorithm without line search for \(p\)-Laplacian
• A descent method for unconstrained optimization problems
• A new descent algorithm with curve search rule
• Convergence of descent method with new line search
• A multi-step decent algorithm with Armijo linear search
• Convergence of descent method without line search
• scientific article; zbMATH DE number 1960973 (Why is no real title available?)

Describes a project that uses

Uses Software

• minpack

This page was built for publication: A descent algorithm without line search for unconstrained optimization

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