A class of nonmonotone conjugate gradient methods for unconstrained optimization

DOI10.1023/A:1021723128049MaRDI QIDQ1293956zbMATH OpenOpenAlexFDO

Authors K. Appert

Publication date 29 June 1999

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1021723128049

zbMATH Keywords

global convergenceunconstrained optimizationnonmonotone line searchnonmonotone conjugate gradient method

Mathematics Subject Classification ID

Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37) Methods of reduced gradient type (90C52)

Recommendations

• A class of nonmonotone conjugate gradient methods for unconstraint optimization
• A nonmonotone conjugate gradient algorithm for unconstrained optimization
• Global convergence of a descent PRP type conjugate gradient method for nonconvex optimization
• A class of nonlinear conjugate gradient methods with a global convergence property
• Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems

Cites work

• scientific article; zbMATH DE number 3843083 (Why is no real title available?)
• scientific article; zbMATH DE number 88930 (Why is no real title available?)
• scientific article; zbMATH DE number 3526471 (Why is no real title available?)
• scientific article; zbMATH DE number 686911 (Why is no real title available?)
• A Nonmonotone Line Search Technique for Newton’s Method
• An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
• Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
• Efficient hybrid conjugate gradient techniques
• Function minimization by conjugate gradients
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• Global convergece of the bfgs algorithm with nonmonotone linesearch^∗∗this work is supported by national natural science foundation$ef:
• Restart procedures for the conjugate gradient method

Cited in

(15)

• A class of nonmonotone conjugate gradient methods for nonconvex functions
• A new class of memory gradient methods with inexact line searches
• scientific article; zbMATH DE number 1376891 (Why is no real title available?)
• Global convergence of algorithms with nonmonotone line search strategy in unconstrained optimization
• A nonmonotone Broyden method for unconstrained optimization
• Accelerated nonmonotone line search technique for multiobjective optimization
• Global convergence of the nonmonotone MBFGS method for nonconvex unconstrained minimization
• Two hybrid nonlinear conjugate gradient methods based on a modified secant equation
• Convergence of line search methods for unconstrained optimization
• scientific article; zbMATH DE number 5961789 (Why is no real title available?)
• A nonmonotone conjugate gradient algorithm for unconstrained optimization
• Nonmonotone quasi-Newton-based conjugate gradient methods with application to signal processing
• An Infeasible Interior-Point Method with Nonmonotonic Complementarity Gaps
• A monotone gradient method via weak secant equation for unconstrained optimization
• A nonmonotone supermemory gradient algorithm for unconstrained optimization

This page was built for publication: A class of nonmonotone conjugate gradient methods for unconstrained optimization

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