Properties of subgradient projection iteration when applying to linear imaging system
From MaRDI portal
Publication:2329650
Recommendations
- Block-iterative subgradient projection algorithms for the convex feasibility problem
- Contraining Strategies for Linear Iterative Processes
- Subgradient projection algorithms and approximate solutions of convex feasibility problems
- scientific article; zbMATH DE number 741119
- A projection method for semidefinite linear systems and its applications
Cites work
- A new perspective on boosting in linear regression via subgradient optimization and relatives
- A new simultaneous subgradient projection algorithm for solving a multiple-sets split feasibility problem.
- A unified treatment of some iterative algorithms in signal processing and image reconstruction
- An introduction to the mathematical theory of inverse problems
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- Convergence Results for Some Temporal Difference Methods Based on Least Squares
- Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems
- Generalizing the Singular Value Decomposition
- scientific article; zbMATH DE number 3856876 (Why is no real title available?)
- scientific article; zbMATH DE number 2153831 (Why is no real title available?)
- scientific article; zbMATH DE number 6159604 (Why is no real title available?)
- Iterative methods for fixed point problems in Hilbert spaces
- Iterative oblique projection onto convex sets and the split feasibility problem
- Landweber-type operator and its properties
- Least-squares estimation of two-ordered monotone regression curves
- Mathematical methods in image reconstruction
- Necessary and Sufficient Convergence Conditions for Algebraic Image Reconstruction Algorithms
- On some optimization techniques in image reconstruction from projections
- On subgradient projectors
- On the finite convergence of a projected cutter method
- PCR algorithm for parallel computing minimum-norm (T) least-squares (S) solution of inconsistent linear equations
- Solving the split feasibility problem without prior knowledge of matrix norms
- Warm start and \(\varepsilon\)-subgradients in a cutting plane scheme for block-angular linear programs
This page was built for publication: Properties of subgradient projection iteration when applying to linear imaging system
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2329650)
