Schwarz iterative methods: infinite space splittings (Q530579): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Universal approximation bounds for superpositions of a sigmoidal function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation and learning by greedy algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Convergence of Block Coordinate Descent Type Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: An introduction to frames and Riesz bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4656813 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some remarks on greedy algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convex optimization on Banach spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4825209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the abstract theory of additive and multiplicative Schwarz algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy and randomized versions of the multiplicative Schwarz method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Methods for Linear Constraints: Convergence Rates and Conditioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of the coordinate descent method for convex differentiable minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence rate of SOR: A worst case estimate / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy strategies for convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence analysis for Kaczmarz-type methods in a Hilbert space framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5784100 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5840886 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized Kaczmarz algorithm with exponential convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inexact coordinate descent: complexity and preconditioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear methods of approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5754213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relaxation in greedy approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy approximation in convex optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual Ascent Methods for Problems with Strictly Convex Costs and Linear Constraints: A Unified Approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of a block coordinate descent method for nondifferentiable minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Methods by Space Decomposition and Subspace Correction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential greedy approximation for certain convex optimization problems / rank
 
Normal rank

Latest revision as of 10:07, 12 July 2024

scientific article
Language Label Description Also known as
English
Schwarz iterative methods: infinite space splittings
scientific article

    Statements

    Schwarz iterative methods: infinite space splittings (English)
    0 references
    0 references
    0 references
    10 August 2016
    0 references
    This paper develops a Schwarz like iterative method to solve elliptic variational problems in Hilbert spaces through infinite space splittings. The splittings are used for subproblems that use linear operators on the split spaces and their adjoints in a two step method akin to the alternating directions method. The paper supplies theoretical convergence proofs and convergence estimates for both greedy and randomized splittings in terms of the iteration index. No applications or numerical results are given.
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    elliptic variational problem
    0 references
    quadratic minimization
    0 references
    Hilbert space splittings
    0 references
    greedy splitting
    0 references
    randomized splitting
    0 references
    multiplicative Schwarz method
    0 references
    decay rate estimation
    0 references
    convergence
    0 references
    alternating directions method
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references