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

DOI10.2298/FIL1806173EzbMATH Open1499.90218MaRDI QIDQ5023935FDOQ5023935

H. Esmaeili, M. Rostami, Morteza Kimiaei

Publication date: 28 January 2022

Published in: Filomat (Search for Journal in Brave)

zbMATH Keywords

global convergenceunconstrained optimizationconjugate 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)

Cites Work

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

Cited In (1)

• Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing

Uses Software

• PDCO

This page was built for publication: Extended Dai-Yuan conjugate gradient strategy for large-scale unconstrained optimization with applications to compressive sensing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5023935)