A new descent algorithm with curve search rule

DOI10.1016/J.AMC.2003.12.058MaRDI QIDQ1764727zbMATH OpenOpenAlexFDO

Authors Zhenjun Shi, Jie Shen

Publication date 22 February 2005

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

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

zbMATH Keywords

Global convergenceNumerical experimentsConjugate gradient methodDescent methodCurve search ruleUnconstrained minimization

Mathematics Subject Classification ID

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

Recommendations

• A descent method for unconstrained optimization problems
• A new memory gradient method with curve search rule
• A new class of multi-step descent methods with curve search rule
• A descent algorithm without line search for unconstrained optimization
• A new memory gradient method with curve search rule

Cites work

• scientific article; zbMATH DE number 6173889 (Why is no real title available?)
• scientific article; zbMATH DE number 3421854 (Why is no real title available?)
• scientific article; zbMATH DE number 7590304 (Why is no real title available?)
• A class of gradient unconstrained minimization algorithms with adaptive stepsize
• A class on nonmonotone stabilization methods in unconstrained optimization
• A globally convergent version of the Polak-Ribière conjugate gradient method
• A new and dynamic method for unconstrained minimization
• A note on minimization problems and multistep methods
• A supermemory gradient method for unconstrained optimization
• Augmentability in optimization theory
• Conjugate Directions without Linear Searches
• Differential gradient methods
• Differential optimization techniques
• Enlarging the region of convergence of Newton's method for constrained optimization
• Function minimization by conjugate gradients
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Memory gradient method for the minimization of functions
• Minimum curvature multistep quasi-Newton methods
• New implicit updates in multi-step quasi-Newton methods for unconstrained optimisation
• Note on global convergence of ODE methods for unconstrained optimization
• Numerical Optimization
• Quadratically convergent algorithms and one-dimensional search schemes
• Relation between the memory gradient method and the Fletcher-Reeves method
• Restart procedures for the conjugate gradient method
• Some convergence properties of the conjugate gradient method
• Stepsize analysis for descent methods
• Study on a supermemory gradient method for the minimization of functions
• Supermemory descent methods for unconstrained minimization
• Using function-values in multi-step quasi-Newton methods

Cited in

(13)

• Curved search methods for unconstrained optimization
• scientific article; zbMATH DE number 4037623 (Why is no real title available?)
• scientific article; zbMATH DE number 4047455 (Why is no real title available?)
• A new class of supermemory gradient methods
• A variant of curved search method
• A new super-memory gradient method with curve search rule
• scientific article; zbMATH DE number 465313 (Why is no real title available?)
• Convergence of supermemory gradient method
• A descent algorithm without line search for unconstrained optimization
• A new class of multi-step descent methods with curve search rule
• A descent method for unconstrained optimization problems
• A hybrid-line-and-curve search globalization technique for inexact Newton methods
• A step size rule for unconstrained optimization

This page was built for publication: A new descent algorithm with curve search rule

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