Extended Dai-Yuan conjugate gradient strategy for large-scale unconstrained optimization with applications to compressive sensing
From MaRDI portal
Publication:5023935
Recommendations
- A spectral dai-yuan-type conjugate gradient method for unconstrained optimization
- Two sufficient descent three-term conjugate gradient methods for unconstrained optimization problems with applications in compressive sensing
- A new spectral conjugate gradient method for large-scale unconstrained optimization
- A spectral conjugate gradient method for solving large-scale unconstrained optimization
- The new spectral conjugate gradient method for large-scale unconstrained optimisation
Cites work
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- scientific article; zbMATH DE number 3278849 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- A Dai-Yuan conjugate gradient algorithm with sufficient descent and conjugacy conditions for unconstrained optimization
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- A mathematical introduction to compressive sensing
- A new restarting adaptive trust-region method for unconstrained optimization
- A new spectral conjugate gradient method for large-scale unconstrained optimization
- A new trust region method for unconstrained optimization
- A nonmonotone trust region method based on simple conic models for unconstrained optimization
- A nonmonotone trust-region line search method for large-scale unconstrained optimization
- A spectral conjugate gradient method for unconstrained optimization
- A survey of nonlinear conjugate gradient methods
- A variant of trust-region methods for unconstrained optimization
- An inexact line search approach using modified nonmonotone strategy for unconstrained optimization
- Atomic Decomposition by Basis Pursuit
- Benchmarking optimization software with performance profiles.
- CUTE
- Compressed sensing
- Convergence Properties of Nonlinear Conjugate Gradient Methods
- Convergence of quasi-Newton matrices generated by the symmetric rank one update
- Descent Property and Global Convergence of the Fletcher—Reeves Method with Inexact Line Search
- Function minimization by conjugate gradients
- Methods of conjugate gradients for solving linear systems
- New spectral PRP conjugate gradient method for unconstrained optimization
- Quasi-Newton Methods for Unconstrained Optimization
- Reduced-Hessian quasi-Newton methods for unconstrained optimization
- Spectral conjugate gradient methods with sufficient descent property for large-scale unconstrained optimization
- Stable signal recovery from incomplete and inaccurate measurements
- Subspace Barzilai-Borwein gradient method for large-scale bound constrained optimization
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- The conjugate gradient method in extremal problems
- The “global” convergence of Broyden-like methods with suitable line search
- Two-Point Step Size Gradient Methods
- \(R\)-linear convergence of the Barzilai and Borwein gradient method
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)
