Feasibility-based fixed point networks
From MaRDI portal
Publication:2138454
Cites work
- A computational framework for infinite-dimensional Bayesian inverse problems. I: The linearized case, with application to global seismic inversion
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Fixed Point Theorem for Mappings which do not Increase Distances
- A multiscale method for model order reduction in PDE parameter estimation
- A two-stage method for spectral-spatial classification of hyperspectral images
- ADMM-softmax: an ADMM approach for multinomial logistic regression
- An Iterative Regularization Method for Total Variation-Based Image Restoration
- An Uncertainty-Weighted Asynchronous ADMM Method for Parallel PDE Parameter Estimation
- Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems
- Best choices for regularization parameters in learning theory: on the bias-variance problem.
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems
- Component-Averaged Row Projections: A Robust, Block-Parallel Scheme for Sparse Linear Systems
- Compressed sensing
- Convergence and perturbation resilience of dynamic string-averaging projection methods
- Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems
- Convex analysis and monotone operator theory in Hilbert spaces
- Deblurring Images
- Deep Convolutional Neural Network for Inverse Problems in Imaging
- Fast simulation of 3D electromagnetic problems using potentials.
- scientific article; zbMATH DE number 4049531 (Why is no real title available?)
- scientific article; zbMATH DE number 1765103 (Why is no real title available?)
- scientific article; zbMATH DE number 1408945 (Why is no real title available?)
- scientific article; zbMATH DE number 3108780 (Why is no real title available?)
- Inverse scale spaces for nonlinear regularization
- ISTA-Net
- Iterative methods for fixed point problems in Hilbert spaces
- Learning deep architectures for AI
- Learning from examples as an inverse problem
- Learning representations by back-propagating errors
- Linear convergence of the randomized sparse Kaczmarz method
- Mean Value Methods in Iteration
- Multigrid Optimization for Large-Scale Ptychographic Phase Retrieval
- NONEXPANSIVE NONLINEAR OPERATORS IN A BANACH SPACE
- Nonlinear total variation based noise removal algorithms
- On Diagonally Relaxed Orthogonal Projection Methods
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
- On the string averaging method for sparse common fixed-point problems
- Optical tomography in medical imaging
- Optical tomography: forward and inverse problems
- Optimization methods for large-scale machine learning
- Perturbation resilience and superiorization methodology of averaged mappings
- Perturbation resilience and superiorization of iterative algorithms
- Perturbation-resilient block-iterative projection methods with application to image reconstruction from projections
- Phase retrieval via matrix completion
- Primal-dual decomposition by operator splitting and applications to image deblurring
- Projection methods: an annotated bibliography of books and reviews
- Projection methods: Swiss army knives for solving feasibility and best approximation problems with halfspaces
- Quantitative robust uncertainty principles and optimally sparse decompositions
- Regularization by denoising via fixed-point projection (RED-PRO)
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Solving ill-posed inverse problems using iterative deep neural networks
- Stable architectures for deep neural networks
- The Split Bregman Method for L1-Regularized Problems
- Tikhonov Regularization and Total Least Squares
- Tikhonov regularization of large linear problems
- Trainable ISTA for Sparse Signal Recovery
- Universal approximation with quadratic deep networks
- Weak and strong superiorization: between feasibility-seeking and minimization
- Zum Prinzip der kontraktiven Abbildung
Cited in
(6)- Bilevel Methods for Image Reconstruction
- Inertial-based extragradient algorithm for approximating a common solution of split-equilibrium problems and fixed-point problems of nonexpansive semigroups
- A hybrid SIAC: data-driven post-processing filter for discontinuities in solutions to numerical PDEs
- Regularization of inverse problems: deep equilibrium models versus bilevel learning
- Efficient model-based deep learning via network pruning and fine-tuning
- Truncated Differentiation for Inverse Potential MFGs
Describes a project that uses
Uses Software
This page was built for publication: Feasibility-based fixed point networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2138454)
