A projection-based derivative free DFP approach for solving system of nonlinear convex constrained monotone equations with image restoration applications
DOI10.1007/s12190-023-01897-1zbMath1522.65080OpenAlexW4385147706MaRDI QIDQ6093343
Maaz ur Rehman, Abdullah Shah, Muhammad Sohaib, Jamilu Sabi'u
Publication date: 6 October 2023
Published in: Journal of Applied Mathematics and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12190-023-01897-1
global convergencecondition numberquasi-Newton methodsimage restorationprojection-based approachnonlinear convex constraint monotone equationsscaled DFP formula
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical computation of solutions to systems of equations (65H10) Methods of quasi-Newton type (90C53) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing
- Interior-point methods
- Superlinear convergence of a Newton-type algorithm for monotone equations
- The revised DFP algorithm without exact line search
- Two optimal Hager-Zhang conjugate gradient methods for solving monotone nonlinear equations
- A projection method for convex constrained monotone nonlinear equations with applications
- Two new fixed point iterative schemes for absolute value equations
- Derivative-free method based on DFP updating formula for solving convex constrained nonlinear monotone equations and application
- 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 conjugate gradient projection method for solving equations with convex constraints
- A diagonal quasi-Newton updating method for unconstrained optimization
- A projection method for a system of nonlinear monotone equations with convex constraints
- Optimization theory and methods. Nonlinear programming
- Spectral gradient projection method for solving nonlinear monotone equations
- Monotonicity of Fixed Point and Normal Mappings Associated with Variational Inequality and Its Application
- A globally convergent BFGS method for nonlinear monotone equations without any merit functions
- A New Newton's Method with Diagonal Jacobian Approximation for Systems of Nonlinear Equations
- Modified Hager–Zhang conjugate gradient methods via singular value analysis for solving monotone nonlinear equations with convex constraint
- Algorithm 851
- Variable Metric Method for Minimization
- Self-Scaling Variable Metric (SSVM) Algorithms
- Optimal conditioning of self-scaling variable Metric algorithms
- On a Class of Nonlinear Integral Equations Arising in Transport Theory
- Newton-type Methods with Generalized Distances For Constrained Optimization
- Inexact Newton methods for the nonlinear complementarity problem
- A Perry-type derivative-free algorithm for solving nonlinear system of equations and minimizing ℓ1regularized problem
- An efficient three-term conjugate gradient-type algorithm for monotone nonlinear equations
- A derivative‐free scaling memoryless Broyden–Fletcher–Goldfarb–Shanno method for solving a system of monotone nonlinear equations
- A modified Hager-Zhang conjugate gradient method with optimal choices for solving monotone nonlinear equations
- A New Conjugate Gradient Method with Guaranteed Descent and an Efficient Line Search
- A Rapidly Convergent Descent Method for Minimization
- Benchmarking optimization software with performance profiles.
- Convergence of the DFP algorithm without exact line search
This page was built for publication: A projection-based derivative free DFP approach for solving system of nonlinear convex constrained monotone equations with image restoration applications
