A generalized hybrid CGPM-based algorithm for solving large-scale convex constrained equations with applications to image restoration

DOI10.1016/j.cam.2021.113423zbMath1464.65069OpenAlexW3124229293WikidataQ113103578 ScholiaQ113103578MaRDI QIDQ2656084

Jianghua Yin, Jin-Bao Jian, Xian-Zhen Jiang

Publication date: 10 March 2021

Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cam.2021.113423

zbMATH Keywords

projection methodderivative-free methodconvergence propertymonotone nonlinear equationsimage restoration problems

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (11)

A three-term CGPM-based algorithm without Lipschitz continuity for constrained nonlinear monotone equations with applications ⋮ A new family of hybrid three-term conjugate gradient methods with applications in image restoration ⋮ A family of inertial derivative-free projection methods for constrained nonlinear pseudo-monotone equations with applications ⋮ A family of hybrid conjugate gradient method with restart procedure for unconstrained optimizations and image restorations ⋮ 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 ⋮ A three-term conjugate gradient algorithm with restart procedure to solve image restoration problems ⋮ A convergence analysis of hybrid gradient projection algorithm for constrained nonlinear equations with applications in compressed sensing ⋮ A modified inertial three-term conjugate gradient projection method for constrained nonlinear equations with applications in compressed sensing ⋮ A family of inertial-relaxed DFPM-based algorithms for solving large-scale monotone nonlinear equations with application to sparse signal restoration ⋮ An efficient conjugate gradient-based algorithm for unconstrained optimization and its projection extension to large-scale constrained nonlinear equations with applications in signal recovery and image denoising problems ⋮ An efficient three-term conjugate gradient-based algorithm involving spectral quotient for solving convex constrained monotone nonlinear equations with applications

Uses Software

• PLCP
• SQPlab
• MCPLIB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• New hybrid conjugate gradient projection method for the convex constrained equations
• A modified Hestenes-Stiefel projection method for constrained nonlinear equations and its linear convergence rate
• Non-smooth equations based method for \(\ell_1\)-norm problems with applications to compressed sensing
• Active-set projected trust-region algorithm for box-constrained nonsmooth equations
• A feasible semismooth asymptotically Newton method for mixed complementarity problems
• A new class of nonmonotone adaptive trust-region methods for nonlinear equations with box constraints
• An efficient three-term conjugate gradient method for nonlinear monotone equations with convex constraints
• Sufficient descent conjugate gradient methods for solving convex constrained nonlinear monotone equations
• A globally convergent matrix-free method for constrained equations and its linear convergence rate
• A smoothing projected Newton-type method for semismooth equations with bound constraints
• A scaled conjugate gradient method for solving monotone nonlinear equations with convex constraints
• A class of smoothing functions for nonlinear and mixed complementarity problems
• Multivariate spectral gradient projection method for nonlinear monotone equations with convex constraints
• A conjugate gradient method to solve convex constrained monotone equations with applications in compressive sensing
• Two spectral gradient projection methods for constrained equations and their linear convergence rate
• Spectral gradient projection method for monotone nonlinear equations with convex constraints
• A hybrid conjugate gradient method with descent property for unconstrained optimization
• Multivariate spectral DY-type projection method for convex constrained nonlinear monotone equations
• A projection method for a system of nonlinear monotone equations with convex constraints
• Nonmonotone Trust-Region Methods for Bound-Constrained Semismooth Equations with Applications to Nonlinear Mixed Complementarity Problems
• A class of conjugate gradient methods for convex constrained monotone equations
• Nonmonotone Spectral Methods for Large-Scale Nonlinear Systems
• Inexact Newton methods for the nonlinear complementarity problem
• 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
• Numerical optimization. Theoretical and practical aspects. Transl. from the French
• Benchmarking optimization software with performance profiles.

This page was built for publication: A generalized hybrid CGPM-based algorithm for solving large-scale convex constrained equations with applications to image restoration