scientific article; zbMATH DE number 1145160
From MaRDI portal
Publication:4384476
signal processinginner productpattern recognitionHilbert spaceimage processingimage reconstructionneural netscomputerized tomographyimage compressionsignal reconstructionopticsdigital filter designconvex projection methodsvector space projections
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Iterative numerical methods for linear systems (65F10) Computing methodologies for image processing (68U10) General theory of numerical analysis in abstract spaces (65J05) Algorithms for approximation of functions (65D15) Vector spaces, linear dependence, rank, lineability (15A03) Approximation with constraints (41A29) Hilbert and pre-Hilbert spaces: geometry and topology (including spaces with semidefinite inner product) (46C05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to numerical analysis (65-01) Characterizations of Hilbert spaces (46C15)
Recommendations
Cited in
(53)- A hyper-transformer model for controllable Pareto front learning with split feasibility constraints
- On a Hadamard–Haar Discrete Wavelet Transform and Its Inversion
- Iterative algorithm for solving triple-hierarchical constrained optimization problem
- A method for the recovery of gaps in general analytic signals
- A projection method for semidefinite linear systems and its applications
- Projection methods: an annotated bibliography of books and reviews
- Strong convergence for an iterative method for the triple-hierarchical constrained optimization problem
- An ergodic algorithm for the power-control games for CDMA data networks
- Steered sequential projections for the inconsistent convex feasibility problem
- Inversion of Fourier transforms by means of scale-frequency series
- Three-term conjugate gradient method for the convex optimization problem over the fixed point set of a nonexpansive mapping
- Adaptively relaxed algorithms for solving the split feasibility problem with a new step size
- Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities
- NON-STRICTLY CONVEX MINIMIZATION OVER THE FIXED POINT SET OF AN ASYMPTOTICALLY SHRINKING NONEXPANSIVE MAPPING
- A unified treatment of some perturbed fixed point iterative methods with an infinite pool of operators
- Superiorization with level control
- Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
- Minimizing the Moreau envelope of nonsmooth convex functions over the fixed point set of certain quasi-nonexpansive mappings
- PARALLEL ALGORITHMS FOR FINDING COMMON FIXED POINTS OF PARACONTRACTIONS
- Accelerated reflection projection algorithm and its application to the LMI problem
- A sequential iteration algorithm with non-monotoneous behaviour in the method of projections onto convex sets
- Randomized projection methods for convex feasibility: conditioning and convergence rates
- A New Policy Evaluation Algorithm for Markov Decision Processes with Quasi Birth-Death Structure
- Strict pseudocontractions and demicontractions, their properties, and applications
- Adaptive estimation of planar convex sets
- Non-monotoneous parallel iteration for solving convex feasibility problems.
- Fixed point optimization algorithm and its application to network bandwidth allocation
- Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping
- Some convergence strategies for the alternating generalized projection method
- Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
- The method for solving variational inequality problems with numerical results
- Fixed point optimization algorithm and its application to power control in CDMA data networks
- Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems
- Proximal splitting methods in signal processing
- Strong convergence of relaxed hybrid steepest-descent methods for triple hierarchical constrained optimization
- scientific article; zbMATH DE number 4021000 (Why is no real title available?)
- A proximal iteratively regularized Gauss-Newton method for nonlinear inverse problems
- Extrapolated cyclic subgradient projection methods for the convex feasibility problems and their numerical behaviour
- Extrapolated simultaneous block‐iterative cutter methods and applications
- A Hierarchical Presentation of Operators with Fixed Points on Hilbert Spaces
- Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings
- Iterative algorithms for minimum-norm fixed point of non-expansive mapping in Hilbert space
- Decentralized algorithm for centralized variational inequalities in network resource allocation
- Minimum symbol error probability MIMO design under the per-antenna power constraint
- Image restoration and enhancement of characters, using convex projection methods
- A Geometrical Look at Iterative Methods for Operators with Fixed Points
- Projection estimators of Pickands dependence functions
- Projections onto convex sets parameter estimation through harmony search and its application for image restoration
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- Restricted normal cones and the method of alternating projections: applications
- Stochastic block projection algorithms with extrapolation for convex feasibility problems
- Iterative algorithms for finding minimum‐norm fixed point of nonexpansive mappings and applications
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4384476)
