A globally and R-linearly convergent hybrid HS and PRP method and its inexact version with applications
DOI10.1007/S11253-015-1118-9zbMATH Open1352.65160OpenAlexW2189424086MaRDI QIDQ326018FDOQ326018
Authors: Weijun Zhou 
Publication date: 12 October 2016
Published in: Ukrainian Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11253-015-1118-9
Recommendations
- A hybrid HS-PRP conjugate gradient method with Armijo line search
- Global convergence of an efficient hybrid conjugate gradient method for unconstrained optimization
- A new hybrid conjugate gradient method for unconstrained optimization
- A hybrid conjugate gradient method and its global convergence
- A new hybrid conjugate gradient method for unconstrained optimization
convergencenonconvex optimizationalgorithmHestenes-Stiefel methodcomputational efficiencylarge-scale unconstrained optimizationMoreau-Yosida regularizationnonsmooth convex optimizationconjugate gradient methodsPolak-Ribiére-Polyak method
Numerical mathematical programming methods (65K05) Convex programming (90C25) Complexity and performance of numerical algorithms (65Y20) Nonconvex programming, global optimization (90C26)
Cites Work
- Recent progress in unconstrained nonlinear optimization without derivatives
- Function minimization by conjugate gradients
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Methods of conjugate gradients for solving linear systems
- New conjugacy conditions and related nonlinear conjugate gradient methods
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Global Convergence Properties of Conjugate Gradient Methods for Optimization
- A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
- A Tool for the Analysis of Quasi-Newton Methods with Application to Unconstrained Minimization
- An efficient hybrid conjugate gradient method for unconstrained optimization
- Convergence analysis of nonlinear conjugate gradient methods
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
Uses Software
This page was built for publication: A globally and R-linearly convergent hybrid HS and PRP method and its inexact version with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q326018)
