An accelerated conjugate gradient algorithm for solving nonlinear monotone equations and image restoration problems
From MaRDI portal
Publication:2209239
DOI10.1155/2020/7945467zbMath1459.65062OpenAlexW3091973378WikidataQ113078495 ScholiaQ113078495MaRDI QIDQ2209239
Publication date: 28 October 2020
Published in: Mathematical Problems in Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1155/2020/7945467
Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A self-adaptive three-term conjugate gradient method for monotone nonlinear equations with convex constraints
- Two derivative-free projection approaches for systems of large-scale nonlinear monotone equations
- Another conjugate gradient algorithm with guaranteed descent and conjugacy conditions for large-scale unconstrained optimization
- Limited memory BFGS method with backtracking for symmetric nonlinear equations
- A conjugate gradient algorithm for large-scale unconstrained optimization problems and nonlinear equations
- Efficient generalized conjugate gradient algorithms. I: Theory
- Globally convergent three-term conjugate gradient projection methods for solving nonlinear monotone equations
- Sufficient descent conjugate gradient methods for solving convex constrained nonlinear monotone equations
- Superlinear convergence of a Newton-type algorithm for monotone equations
- A projection method for convex constrained monotone nonlinear equations with applications
- A three-terms Polak-Ribière-Polyak conjugate gradient algorithm for large-scale nonlinear equations
- Multivariate spectral DY-type projection method for convex constrained nonlinear monotone equations
- Nonmonotone derivative-free methods for nonlinear equations
- Spectral gradient projection method for solving nonlinear monotone equations
- Wei–Yao–Liu conjugate gradient projection algorithm for nonlinear monotone equations with convex constraints
- A globally convergent BFGS method for nonlinear monotone equations without any merit functions
- A class of derivative-free methods for large-scale nonlinear monotone equations
- A descent modified Polak–Ribière–Polyak conjugate gradient method and its global convergence
- A modified quasi‐Newton diagonal update algorithm for total variation denoising problems and nonlinear monotone equations with applications in compressive sensing
- The “global” convergence of Broyden-like methods with suitable line search
- A derivative-free line search and dfp method for symmetric equations with global and superlinear convergence
- Local convergence of Newton’s method for solving generalized equations with monotone operator
- A Globally and Superlinearly Convergent Gauss--Newton-Based BFGS Method for Symmetric Nonlinear Equations
- A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
- Function minimization by conjugate gradients
- Convex programming in Hilbert space
- The conjugate gradient method in extremal problems
- Methods of conjugate gradients for solving linear systems
- Benchmarking optimization software with performance profiles.
