scientific article; zbMATH DE number 1145160

Publication date: 26 April 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

pattern recognition image processing Hilbert space image compression computerized tomography inner product image reconstruction signal processing neural nets signal reconstruction optics digital filter design convex projection methods vector space projections

Mathematics Subject Classification ID

General theory of numerical analysis in abstract spaces (65J05) Computing methodologies for image processing (68U10) Hilbert and pre-Hilbert spaces: geometry and topology (including spaces with semidefinite inner product) (46C05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Characterizations of Hilbert spaces (46C15) Iterative numerical methods for linear systems (65F10) Approximation with constraints (41A29) Algorithms for approximation of functions (65D15) Vector spaces, linear dependence, rank, lineability (15A03) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to numerical analysis (65-01)

Related Items (50)

Inversion of Fourier transforms by means of scale-frequency series ⋮ Proximal Splitting Methods in Signal Processing ⋮ Minimizing the Moreau Envelope of Nonsmooth Convex Functions over the Fixed Point Set of Certain Quasi-Nonexpansive Mappings ⋮ A projection method for semidefinite linear systems and its applications ⋮ Steered sequential projections for the inconsistent convex feasibility problem ⋮ An ergodic algorithm for the power-control games for CDMA data networks ⋮ Accelerated reflection projection algorithm and its application to the LMI problem ⋮ Projection methods: an annotated bibliography of books and reviews ⋮ PARALLEL ALGORITHMS FOR FINDING COMMON FIXED POINTS OF PARACONTRACTIONS ⋮ NON-STRICTLY CONVEX MINIMIZATION OVER THE FIXED POINT SET OF AN ASYMPTOTICALLY SHRINKING NONEXPANSIVE MAPPING ⋮ Stochastic block projection algorithms with extrapolation for convex feasibility problems ⋮ Adaptive estimation of planar convex sets ⋮ Some convergence strategies for the alternating generalized projection method ⋮ Perturbed projections and subgradient projections for the multiple-sets split feasibility problem ⋮ A proximal iteratively regularized Gauss-Newton method for nonlinear inverse problems ⋮ Strong convergence of relaxed hybrid steepest-descent methods for triple hierarchical constrained optimization ⋮ Iterative algorithms for minimum-norm fixed point of non-expansive mapping in Hilbert space ⋮ Restricted normal cones and the method of alternating projections: applications ⋮ Adaptively relaxed algorithms for solving the split feasibility problem with a new step size ⋮ A unified treatment of some perturbed fixed point iterative methods with an infinite pool of operators ⋮ Superiorization with level control ⋮ Strong convergence for an iterative method for the triple-hierarchical constrained optimization problem ⋮ Fixed point optimization algorithm and its application to network bandwidth allocation ⋮ Extrapolated simultaneous block‐iterative cutter methods and applications ⋮ Strict pseudocontractions and demicontractions, their properties, and applications ⋮ Three-term conjugate gradient method for the convex optimization problem over the fixed point set of a nonexpansive mapping ⋮ On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints ⋮ Fixed point optimization algorithm and its application to power control in CDMA data networks ⋮ A method for the recovery of gaps in general analytic signals ⋮ Extrapolated cyclic subgradient projection methods for the convex feasibility problems and their numerical behaviour ⋮ Decentralized algorithm for centralized variational inequalities in network resource allocation ⋮ Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems ⋮ Minimum symbol error probability MIMO design under the per-antenna power constraint ⋮ Iterative algorithm for solving triple-hierarchical constrained optimization problem ⋮ Iterative algorithms for finding minimum‐norm fixed point of nonexpansive mappings and applications ⋮ Hybrid Steepest Descent Method for Variational Inequality Problem over the Fixed Point Set of Certain Quasi-nonexpansive Mappings ⋮ A sequential iteration algorithm with non-monotoneous behaviour in the method of projections onto convex sets ⋮ On a Hadamard–Haar Discrete Wavelet Transform and Its Inversion ⋮ Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping ⋮ Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities ⋮ A New Policy Evaluation Algorithm for Markov Decision Processes with Quasi Birth-Death Structure ⋮ A Geometrical Look at Iterative Methods for Operators with Fixed Points ⋮ Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping ⋮ A Hierarchical Presentation of Operators with Fixed Points on Hilbert Spaces ⋮ Projections onto convex sets parameter estimation through harmony search and its application for image restoration ⋮ Unnamed Item ⋮ The method for solving variational inequality problems with numerical results ⋮ Randomized Projection Methods for Convex Feasibility: Conditioning and Convergence Rates ⋮ Projection estimators of Pickands dependence functions ⋮ Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems

This page was built for publication: