An automatic relaxation method for solving interval linear inequalities
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3856876 (Why is no real title available?)
- scientific article; zbMATH DE number 3866481 (Why is no real title available?)
- scientific article; zbMATH DE number 3912113 (Why is no real title available?)
- scientific article; zbMATH DE number 3244957 (Why is no real title available?)
- A relaxation method for reconstructing objects from noisy X-rays
- Convergence of the cyclical relaxation method for linear inequalities
- Cyclic subgradient projections
- New methods for linear inequalities
- On convergence rates of subgradient optimization methods
- Row-Action Methods for Huge and Sparse Systems and Their Applications
- Strong underrelaxation in Kaczmarz's method for inconsistent systems
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Solving Systems of Linear Inequalities
Cited in
(9)- A row relaxation method for large minimax problems
- Asynchronous sequential inertial iterations for common fixed points problems with an application to linear systems
- The adventures of a simple algorithm
- Radiation therapy treatment planning: An \(\mathcal L^ 2\) approach
- Convergence analysis of processes with valiant projection operators in Hilbert space
- A proximal point algorithm for minimax problems
- Block-iterative surrogate projection methods for convex feasibility problems
- On some optimization techniques in image reconstruction from projections
- Parallel application of block-iterative methods in medical imaging and radiation therapy
This page was built for publication: An automatic relaxation method for solving interval linear inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1060533)
