An efficient gradient-free projection algorithm for constrained nonlinear equations and image restoration
DOI10.3934/math.2021016zbMath1484.65151OpenAlexW3092527099MaRDI QIDQ2131452
Poom Kumam, Seifu Endris Yimer, Abdulkarim Hassan Ibrahim, Kazeem Olalekan Aremu, Umar Batsari Yusuf, Auwal Bala Abubakar
Publication date: 26 April 2022
Published in: AIMS Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/math.2021016
unconstrained optimizationconjugate gradient methodprojection methodnonlinear equationscompressive sensingconvex constrained
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Numerical solution of inverse problems involving ordinary differential equations (65L09)
Related Items (17)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A new nonmonotone spectral residual method for nonsmooth nonlinear equations
- A modified Fletcher-Reeves-type derivative-free method for symmetric nonlinear equations
- Efficient generalized conjugate gradient algorithms. I: Theory
- Algorithms and applications for approximate nonnegative matrix factorization
- A spectral algorithm for large-scale systems of nonlinear monotone equations
- A methodology for solving chemical equilibrium systems
- A projection method for convex constrained monotone nonlinear equations with applications
- A conjugate gradient algorithm for large-scale nonlinear equations and image restoration problems
- New hybrid conjugate gradient method as a convex combination of LS and FR methods
- A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing
- Spectral gradient projection method for monotone nonlinear equations with convex constraints
- A derivative-free iterative method for nonlinear monotone equations with convex constraints
- On the Global Convergence of the BFGS Method for Nonconvex Unconstrained Optimization Problems
- An Efficient Implementation of Merrill’s Method for Sparse or Partially Separable Systems of Nonlinear Equations
- A New Projection Method for Variational Inequality Problems
- Chemical equilibrium systems as numerical test problems
- A class of conjugate gradient methods for convex constrained monotone equations
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- A Characterization of Superlinear Convergence and Its Application to Quasi-Newton Methods
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- Function minimization by conjugate gradients
- Spectral residual method without gradient information for solving large-scale nonlinear systems of equations
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
- A modified BFGS method and its global convergence in nonconvex minimization
- A spectral conjugate gradient method for unconstrained optimization
- Benchmarking optimization software with performance profiles.
This page was built for publication: An efficient gradient-free projection algorithm for constrained nonlinear equations and image restoration