A new gradient method via quasi-Cauchy relation which guarantees descent

DOI10.1016/j.cam.2008.11.013zbMath1179.65067OpenAlexW2014524071MaRDI QIDQ1026455

Wah June Leong, Malik Abu Hassan, Mahboubeh Farid

Publication date: 25 June 2009

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.2008.11.013

zbMATH Keywords

unconstrained optimizationBarzilai and Borwein methodmonotone gradient methodsquasi-Cauchy relation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (14)

A new descent algorithm using the three-step discretization method for solving unconstrained optimization problems ⋮ A modified quasi‐Newton diagonal update algorithm for total variation denoising problems and nonlinear monotone equations with applications in compressive sensing ⋮ A diagonal quasi-Newton updating method based on minimizing the measure function of Byrd and Nocedal for unconstrained optimization ⋮ Nonmonotone diagonally scaled limited-memory BFGS methods with application to compressive sensing based on a penalty model ⋮ Scaled diagonal gradient-type method with extra update for large-scale unconstrained optimization ⋮ A new two-step gradient-type method for large-scale unconstrained optimization ⋮ A low memory solver for integral equations of Chandrasekhar type in the radiative transfer problems ⋮ A NONMONOTONE ADMM-BASED DIAGONAL QUASI-NEWTON UPDATE WITH APPLICATION TO THE COMPRESSIVE SENSING PROBLEM ⋮ An improved multi-step gradient-type method for large scale optimization ⋮ A matrix-free quasi-Newton method for solving large-scale nonlinear systems ⋮ Accelerated diagonal gradient-type method for large-scale unconstrained optimization ⋮ A class of diagonal quasi-Newton methods for large-scale convex minimization ⋮ Accumulative approach in multistep diagonal gradient-type method for large-scale unconstrained optimization ⋮ Diagonal quasi-Newton method via variational principle under generalized Frobenius norm

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On a successive transformation of probability distribution and its application to the analysis of the optimum gradient method
• Multivariate spectral gradient method for unconstrained optimization
• Modified two-point stepsize gradient methods for unconstrained optimization
• On the asymptotic behaviour of some new gradient methods
• R-linear convergence of the Barzilai and Borwein gradient method
• Two-Point Step Size Gradient Methods
• Optimal conditioning of self-scaling variable Metric algorithms
• Alternate minimization gradient method

This page was built for publication: A new gradient method via quasi-Cauchy relation which guarantees descent