Global convergence via descent modified three-term conjugate gradient projection algorithm with applications to signal recovery
DOI10.1016/J.RINAM.2019.100069zbMATH Open1453.65120OpenAlexW2976255637WikidataQ127201301 ScholiaQ127201301MaRDI QIDQ2211072FDOQ2211072
Authors: Auwal Bala Abubakar, Poom Kumam, Aliyu Muhammed Awwal
Publication date: 10 November 2020
Published in: Results in Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.rinam.2019.100069
Recommendations
- An efficient three-term conjugate gradient-based algorithm involving spectral quotient for solving convex constrained monotone nonlinear equations with applications
- A hybrid three-term conjugate gradient projection method for constrained nonlinear monotone equations with applications
- Descent three-term DY-type conjugate gradient methods for constrained monotone equations with application
- A three-term CGPM-based algorithm without Lipschitz continuity for constrained nonlinear monotone equations with applications
- An efficient three-term conjugate gradient-type algorithm for monotone nonlinear equations
Numerical mathematical programming methods (65K05) Numerical solutions to equations with nonlinear operators (65J15)
Cites Work
- STRSCNE: a scaled trust-region solver for constrained nonlinear equations
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- Probing the Pareto frontier for basis pursuit solutions
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- A three-term conjugate gradient method with sufficient descent property for unconstrained optimization
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- Globally convergent three-term conjugate gradient methods that use secant conditions and generate descent search directions for unconstrained optimization
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- Some descent three-term conjugate gradient methods and their global convergence
- A projection method for a system of nonlinear monotone equations with convex constraints
- An EM algorithm for wavelet-based image restoration
- Levenberg--Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints
- A New Projection Method for Variational Inequality Problems
- A survey of nonlinear conjugate gradient methods
- A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing
- A smoothing conjugate gradient method for solving systems of nonsmooth equations
- A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization
- A self-adaptive three-term conjugate gradient method for monotone nonlinear equations with convex constraints
- Title not available (Why is that?)
- A superlinearly convergent projection method for constrained systems of nonlinear equations
- A methodology for solving chemical equilibrium systems
- Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing
- Inexact Newton methods for the nonlinear complementarity problem
- An Efficient Implementation of Merrill’s Method for Sparse or Partially Separable Systems of Nonlinear Equations
- An improved three-term derivative-free method for solving nonlinear equations
Cited In (17)
- Dai-Liao extensions of a descent hybrid nonlinear conjugate gradient method with application in signal processing
- A modified spectral gradient projection-based algorithm for large-scale constrained nonlinear equations with applications in compressive sensing
- An improved spectral conjugate gradient projection method for monotone nonlinear equations with application
- An efficient projection algorithm for solving convex constrained monotone operator equations and sparse signal reconstruction problems
- A new class of nonlinear conjugate gradient method for unconstrained optimization models and its application in portfolio selection
- A family of three-term conjugate gradient projection methods with a restart procedure and their relaxed-inertial extensions for the constrained nonlinear pseudo-monotone equations with applications
- An Accelerated Three-Term Extension of a Descent Nonlinear Conjugate Gradient Method
- Global convergence via modified self-adaptive approach for solving constrained monotone nonlinear equations with application to signal recovery problems
- Signal recovery with constrained monotone nonlinear equations through an effective three-term conjugate gradient method
- A descent extension of a modified Polak-Ribière-Polyak method with application in image restoration problem
- A convergence analysis of hybrid gradient projection algorithm for constrained nonlinear equations with applications in compressed sensing
- Descent three-term DY-type conjugate gradient methods for constrained monotone equations with application
- Derivative-free RMIL conjugate gradient method for convex constrained equations
- Signal recovery with convex constrained nonlinear monotone equations through conjugate gradient hybrid approach
- New three-term conjugate gradient algorithm for solving monotone nonlinear equations and signal recovery problems
- Nonmonotone quasi-Newton-based conjugate gradient methods with application to signal processing
- A three-term CGPM-based algorithm without Lipschitz continuity for constrained nonlinear monotone equations with applications
Uses Software
This page was built for publication: Global convergence via descent modified three-term conjugate gradient projection algorithm with applications to signal recovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2211072)