scientific article; zbMATH DE number 7572911

MaRDI QIDQ5096719

Hongtruong Pham, Yulun Wu, Gong Lin Yuan

Publication date: 18 August 2022

Full work available at URL: http://121.43.60.238/sxwlxbA/EN/abstract/abstract16659.shtml

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

unconstrained optimizationglobal convergencenonmonotone line searchconjugate gradientimage restoration

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Nonconvex programming, global optimization (90C26) Methods of reduced gradient type (90C52)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A short note on the global convergence of the unmodified PRP method
• Convergence analysis of a modified BFGS method on convex minimizations
• The convergence properties of some new conjugate gradient methods
• Efficient generalized conjugate gradient algorithms. I: Theory
• Globally convergent Polak-Ribière-Polyak conjugate gradient methods under a modified Wolfe line search
• A truncated Newton method with non-monotone line search for unconstrained optimization
• A globally convergent version of the Polak-Ribière conjugate gradient method
• A PRP-based residual method for large-scale monotone nonlinear equations
• A structured quasi-Newton algorithm with nonmonotone search strategy for structured NLS problems and its application in robotic motion control
• Family weak conjugate gradient algorithms and their convergence analysis for nonconvex functions
• The PRP conjugate gradient algorithm with a modified WWP line search and its application in the image restoration problems
• The global convergence of the Polak-Ribière-Polyak conjugate gradient algorithm under inexact line search for nonconvex functions
• A derivative-free iterative method for nonlinear monotone equations with convex constraints
• Global convergence of a modified Fletcher-Reeves conjugate gradient method with Armijo-type line search
• An inexact line search approach using modified nonmonotone strategy for unconstrained optimization
• A Modified PRP Conjugate Gradient Algorithm with Trust Region for Optimization Problems
• Convergence Properties of Algorithms for Nonlinear Optimization
• Global convergence of the Polak-Ribière-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems
• A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
• Global Convergence Properties of Conjugate Gradient Methods for Optimization
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• A Nonmonotone Line Search Technique for Newton’s Method
• An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• On the Barzilai–Borwein gradient methods with structured secant equation for nonlinear least squares problems
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• Function minimization by conjugate gradients
• Global convergence of the DY conjugate gradient method with Armijo line search for unconstrained optimization problems
• The conjugate gradient method in extremal problems
• Methods of conjugate gradients for solving linear systems
• A new nonmonotone line search technique for unconstrained optimization
• New properties of a nonlinear conjugate gradient method
• Benchmarking optimization software with performance profiles.
• An efficient hybrid conjugate gradient method for unconstrained optimization
• On the nonmonotone line search

This page was built for publication: