Extended Dai-Yuan conjugate gradient strategy for large-scale unconstrained optimization with applications to compressive sensing

DOI10.2298/FIL1806173EzbMath1499.90218MaRDI QIDQ5023935

Hamid Esmaeili, Madjid Rostami, Morteza Kimiaei

Publication date: 28 January 2022

Published in: Filomat (Search for Journal in Brave)

zbMATH Keywords

unconstrained optimizationglobal convergenceconjugate gradient methodcompressive sensingnonmonotone line search method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Methods of reduced gradient type (90C52)

Uses Software

• PDCO

Cites Work

• A nonmonotone trust region method based on simple conic models for unconstrained optimization
• A mathematical introduction to compressive sensing
• New spectral PRP conjugate gradient method for unconstrained optimization
• Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
• Convergence of quasi-Newton matrices generated by the symmetric rank one update
• A new restarting adaptive trust-region method for unconstrained optimization
• A nonmonotone trust-region line search method for large-scale unconstrained optimization
• An inexact line search approach using modified nonmonotone strategy for unconstrained optimization
• A Dai-Yuan conjugate gradient algorithm with sufficient descent and conjugacy conditions for unconstrained optimization
• A new trust region method for unconstrained optimization
• A variant of trust-region methods for unconstrained optimization
• R-linear convergence of the Barzilai and Borwein gradient method
• Reduced-Hessian Quasi-Newton Methods for Unconstrained Optimization
• The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
• Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization
• Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
• The “global” convergence of Broyden-like methods with suitable line search
• Two-Point Step Size Gradient Methods
• Atomic Decomposition by Basis Pursuit
• CUTE
• Convergence Properties of Nonlinear Conjugate Gradient Methods
• A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
• A Nonmonotone Line Search Technique for Newton’s Method
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• A new spectral conjugate gradient method for large-scale unconstrained optimization
• A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
• Function minimization by conjugate gradients
• Stable signal recovery from incomplete and inaccurate measurements
• The conjugate gradient method in extremal problems
• Quasi-Newton Methods for Unconstrained Optimization
• Methods of conjugate gradients for solving linear systems
• Compressed sensing
• A spectral conjugate gradient method for unconstrained optimization
• Benchmarking optimization software with performance profiles.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item