A simple sufficient descent method for unconstrained optimization

DOI10.1155/2010/684705MaRDI QIDQ613840zbMATH OpenOpenAlexWikidataFDO

Authors Mingliang Zhang, Dangzhen Zhou, Yunhai Xiao

Publication date 23 December 2010

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/224745

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• A new method with sufficient descent property for unconstrained optimization
• scientific article; zbMATH DE number 7109378
• An efficient conjugate gradient method with sufficient descent property
• Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
• Descent property and global convergence of a new search direction method for unconstrained optimization

Cites work

• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• A Nonmonotone Line Search Technique for Newton’s Method
• A Two-Term PRP-Based Descent Method
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• A globally convergent version of the Polak-Ribière conjugate gradient method
• A limited memory BFGS-type method for large-scale unconstrained optimization
• Algorithm 851
• CUTE
• Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
• Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
• Numerical Optimization
• Subspace techniques for nonlinear optimization
• Sufficient descent directions in unconstrained optimization
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• Two-Point Step Size Gradient Methods

Cited in

(6)

• A new method with sufficient descent property for unconstrained optimization
• Greatest descent algorithms in unconstrained optimization
• A reduced-space line-search method for unconstrained optimization via random descent directions
• Sufficient descent directions in unconstrained optimization
• A descent method for unconstrained optimization problems
• On the method of shortest residuals for unconstrained optimization

Describes a project that uses

Uses Software

• CUTE
• CG_DESCENT
• CUTEr

This page was built for publication: A simple sufficient descent method for unconstrained optimization

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