Sufficient descent directions in unconstrained optimization
From MaRDI portal
Publication:538309
DOI10.1007/s10589-009-9268-zzbMath1242.90223OpenAlexW2043581158MaRDI QIDQ538309
Xiao-Min An, Yun-hai Xiao, Dong-hui Li
Publication date: 25 May 2011
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-009-9268-z
unconstrained optimizationglobal convergencesuperlinear convergencePSB methodsufficient descent direction
Related Items (8)
A simple sufficient descent method for unconstrained optimization ⋮ A modified conjugate gradient algorithm with cyclic Barzilai-Borwein steplength for unconstrained optimization ⋮ A new method with sufficient descent property for unconstrained optimization ⋮ A partitioned PSB method for partially separable unconstrained optimization problems ⋮ Norm descent conjugate gradient methods for solving symmetric nonlinear equations ⋮ A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing ⋮ A MODIFIED PROJECTED CONJUGATE GRADIENT ALGORITHM FOR UNCONSTRAINED OPTIMIZATION PROBLEMS ⋮ A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition
Cites Work
- Unnamed Item
- Unnamed Item
- Convergence of quasi-Newton method with new inexact line search
- Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
- Convergence of nonmonotone line search method
- Global Convergence of a Cass of Quasi-Newton Methods on Convex Problems
- On the Global Convergence of Broyden's Method
- Quasi-Newton Methods, Motivation and Theory
- Numerical Optimization
- A derivative-free line search and global convergence of Broyden-like method for nonlinear equations
- Analysis of a Symmetric Rank-One Trust Region Method
- Benchmarking optimization software with performance profiles.
This page was built for publication: Sufficient descent directions in unconstrained optimization
