A new efficient conjugate gradient method for unconstrained optimization

DOI10.1016/J.CAM.2015.12.035MaRDI QIDQ5964605zbMATH OpenOpenAlexFDO

Authors Masoud Fatemi

Publication date 29 February 2016

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cam.2015.12.035

zbMATH Keywords

conjugate gradient methodDai-Liao familyline searchunconstrained optimization

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Methods of reduced gradient type (90C52)

Recommendations

• An optimal parameter for Dai-Liao family of conjugate gradient methods
• scientific article; zbMATH DE number 5927317
• A new conjugate gradient method for unconstrained optimization
• A new family of conjugate gradient methods for unconstrained optimization
• A New Dai-Liao Conjugate Gradient Method with Optimal Parameter Choice

Cites work

• A descent family of Dai-Liao conjugate gradient methods
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• A nonlinear conjugate gradient algorithm with an optimal property and an improved Wolfe line search
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A survey of nonlinear conjugate gradient methods
• An optimal parameter for Dai-Liao family of conjugate gradient methods
• Benchmarking optimization software with performance profiles.
• Function minimization by conjugate gradients
• Global convergence of some modified PRP nonlinear conjugate gradient methods
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• scientific article; zbMATH DE number 3278849 (Why is no real title available?)
• Methods of conjugate gradients for solving linear systems
• New conjugacy conditions and related nonlinear conjugate gradient methods
• The conjugate gradient method in extremal problems
• The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices

Cited in

(36)

• An accelerated three-term conjugate gradient method with sufficient descent condition and conjugacy condition
• General four-step discrete-time zeroing and derivative dynamics applied to time-varying nonlinear optimization
• Two extensions of the Dai-Liao method with sufficient descent property based on a penalization scheme
• Improved Fletcher-Reeves and Dai-Yuan conjugate gradient methods with the strong Wolfe line search
• A new family of conjugate gradient methods for unconstrained optimization
• A modified Dai-Liao conjugate gradient method with a new parameter for solving image restoration problems
• New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization
• A new accelerated conjugate gradient method for large-scale unconstrained optimization
• A three-term conjugate gradient method with accelerated subspace quadratic optimization
• A modified Dai-Liao conjugate gradient method for solving unconstrained optimization and image restoration problems
• A new subspace minimization conjugate gradient method based on modified secant equation for unconstrained optimization
• Estimation of boundary condition of two-dimensional nonlinear PDE with application to continuous casting
• An improved Polak-Ribière-Polyak conjugate gradient method with an efficient restart direction
• Two modified DY conjugate gradient methods for unconstrained optimization problems
• An efficient Dai-Liao type conjugate gradient method by reformulating the CG parameter in the search direction equation
• A new conjugate gradient method with an efficient memory structure
• An optimal parameter choice for the Dai-Liao family of conjugate gradient methods by avoiding a direction of the maximum magnification by the search direction matrix
• Z-type neural-dynamics for time-varying nonlinear optimization under a linear equality constraint with robot application
• A modified conjugate gradient method for general convex functions
• An optimal parameter for Dai-Liao family of conjugate gradient methods
• New conjugate gradient method for unconstrained optimization
• scientific article; zbMATH DE number 5927317 (Why is no real title available?)
• scientific article; zbMATH DE number 2130407 (Why is no real title available?)
• A fast and robust unconstrained optimization method requiring minimum storage
• A New Dai-Liao Conjugate Gradient Method with Optimal Parameter Choice
• scientific article; zbMATH DE number 1376891 (Why is no real title available?)
• An efficient conjugate gradient method with strong convergence properties for non-smooth optimization
• A new subspace minimization conjugate gradient method based on tensor model for unconstrained optimization
• A Benchmark Study on Steepest Descent and Conjugate Gradient Methods-Line Search Conditions Combinations in Unconstrained Optimization
• Some new three-term Hestenes-Stiefel conjugate gradient methods with affine combination
• A new conjugate gradient method for unconstrained optimization with sufficient descent
• Solving unconstrained optimization with a new type of conjugate gradient method
• A New Dai-Liao Conjugate Gradient Method based on Approximately Optimal Stepsize for Unconstrained Optimization
• A family of limited memory three term conjugate gradient methods
• A conjugate gradient method with descent direction for unconstrained optimization
• New accelerated conjugate gradient algorithms as a modification of Dai-Yuan's computational scheme for unconstrained optimization

Describes a project that uses

Uses Software

• CUTEr
• SIFDecode

This page was built for publication: A new efficient conjugate gradient method for unconstrained optimization

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