Impulse noise removal by an adaptive trust-region method

DOI10.1007/s00500-018-03745-yzbMath1436.94011OpenAlexW2914320820WikidataQ128538230 ScholiaQ128538230MaRDI QIDQ780152

Morteza Kimiaei, Farzad Rahpeymaii

Publication date: 15 July 2020

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-018-03745-y

zbMATH Keywords

constrained optimizationimage processingtrust-region frameworkconvergence theoryadaptive radius strategyprojected gradient strategy

Mathematics Subject Classification ID

Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Uses Software

• LBFGS-B

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An efficient nonmonotone trust-region method for unconstrained optimization
• Convergence properties of nonmonotone spectral projected gradient methods
• A new constructing approach for a weighted topology of wireless sensor networks based on local-world theory for the Internet of things (IOT)
• Convergence properties of trust region methods for linear and convex constraints
• A descent spectral conjugate gradient method for impulse noise removal
• A new trust region method with adaptive radius
• Representations of quasi-Newton matrices and their use in limited memory methods
• On the convergence of interior-reflective Newton methods for nonlinear minimization subject to bounds
• A variational approach to remove outliers and impulse noise
• A new adaptive trust-region method for system of nonlinear equations
• A new restarting adaptive trust-region method for unconstrained optimization
• Large-scale active-set box-constrained optimization method with spectral projected gradients
• Impulse noise removal by a nonmonotone adaptive gradient method
• On efficiency of nonmonotone Armijo-type line searches
• Optimal subgradient methods: computational properties for large-scale linear inverse problems
• An efficient implementation of a trust region method for box constrained optimization
• An optimal subgradient algorithm for large-scale bound-constrained convex optimization
• A limited memory adaptive trust-region approach for large-scale unconstrained optimization
• An adaptive trust region method and its convergence
• An effective trust-region-based approach for symmetric nonlinear systems
• Impulse noise removal based on new hybrid conjugate gradient approach
• Convergence of Affine-Scaling Interior-Point Methods with Line Search for Box Constrained Optimization
• On the global convergence of trust region algorithms for unconstrained minimization
• Projected gradient methods for linearly constrained problems
• Two-Point Step Size Gradient Methods
• Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
• On the Solution of Large Quadratic Programming Problems with Bound Constraints
• Matrix conditioning and nonlinear optimization
• Inexact spectral projected gradient methods on convex sets
• Fast, robust total variation-based reconstruction of noisy, blurred images
• Trust Region Methods
• Nonmonotone Spectral Projected Gradient Methods on Convex Sets
• Reduced Storage, Quasi-Newton Trust Region Approaches to Function Optimization
• A Nonmonotone Line Search Technique for Newton’s Method
• Projected Newton Methods for Optimization Problems with Simple Constraints
• A Limited Memory Algorithm for Bound Constrained Optimization
• An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
• A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property
• An efficient adaptive trust-region method for systems of nonlinear equations
• Convex Analysis
• Methods of conjugate gradients for solving linear systems
• A spectral conjugate gradient method for unconstrained optimization
• Benchmarking optimization software with performance profiles.

This page was built for publication: Impulse noise removal by an adaptive trust-region method