Publication:5432585
From MaRDI portal
zbMath1140.65001MaRDI QIDQ5432585
Publication date: 17 December 2007
65K05: Numerical mathematical programming methods
65H10: Numerical computation of solutions to systems of equations
65F10: Iterative numerical methods for linear systems
90-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming
90Cxx: Mathematical programming
65-01: Introductory exposition (textbooks, tutorial papers, etc.) pertaining to numerical analysis
Related Items
On Greedy Randomized Kaczmarz Method for Solving Large Sparse Linear Systems, Weak, Strong, and Linear Convergence of a Double-Layer Fixed Point Algorithm, Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems, Solution of a certain problem of scattering by using of the maximum entropy principle, Kaczmarz-Type Inner-Iteration Preconditioned Flexible GMRES Methods for Consistent Linear Systems, Solving inverse problems using data-driven models, Rows versus Columns: Randomized Kaczmarz or Gauss--Seidel for Ridge Regression, String-averaging projected subgradient methods for constrained minimization, Bounded perturbation resilience of projected scaled gradient methods, Convergence Analysis of Inexact Randomized Iterative Methods, A Partially Greedy Randomized Extended Gauss-Seidel Method for Solving Large Linear Systems, 4D-CT reconstruction with unified spatial-temporal patch-based regularization, A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert space, Iterative methods of strong convergence theorems for the split feasibility problem in Hilbert spaces, Distance majorization and its applications, Asymptotic behavior of compositions of under-relaxed nonexpansive operators, Randomized block Kaczmarz method with projection for solving least squares, Block Kaczmarz method with inequalities, A note on the behavior of the randomized Kaczmarz algorithm of Strohmer and Vershynin, Finding a best approximation pair of points for two polyhedra, An iterative sparse algorithm for the penalized maximum likelihood estimator in mixed effects model, Image restoration based on the hybrid total-variation-type model, Convergence and perturbation resilience of dynamic string-averaging projection methods, Modeling continuous grain crushing in granular media: a hybrid peridynamics and physics engine approach, An algorithm for finding common solutions of various problems in nonlinear operator theory, Momentum and stochastic momentum for stochastic gradient, Newton, proximal point and subspace descent methods, The difference vectors for convex sets and a resolution of the geometry conjecture, A real-time iterative projection scheme for solving the common fixed point problem and its applications, Variant of greedy randomized Kaczmarz for ridge regression, Strict Fejér monotonicity by superiorization of feasibility-seeking projection methods, Paved with good intentions: analysis of a randomized block Kaczmarz method, On greedy randomized block Kaczmarz method for consistent linear systems, Randomized block Kaczmarz methods with \(k\)-means clustering for solving large linear systems, EM Algorithms, Mathematics of Electron Tomography, Iterative Methods for Solving Factorized Linear Systems, An EM-like reconstruction method for diffuse optical tomography, Convergence Properties of the Randomized Extended Gauss--Seidel and Kaczmarz Methods, Block‐iterative algorithms, Bounds on the largest singular value of a matrix and the convergence of simultaneous and block‐iterative algorithms for sparse linear systems
