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