A simple sufficient descent method for unconstrained optimization
From MaRDI portal
Publication:613840
DOI10.1155/2010/684705zbMath1202.90246OpenAlexW2037092651WikidataQ58653262 ScholiaQ58653262MaRDI QIDQ613840
Dangzhen Zhou, Ming-Liang Zhang, Yun-hai 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
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Sufficient descent directions in unconstrained optimization
- A limited memory BFGS-type method for large-scale unconstrained optimization
- Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization
- A globally convergent version of the Polak-Ribière conjugate gradient method
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- Algorithm 851
- Two-Point Step Size Gradient Methods
- Numerical Optimization
- CUTE
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A Two-Term PRP-Based Descent Method
This page was built for publication: A simple sufficient descent method for unconstrained optimization
