On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints (Q429491): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: The Relaxation Method for Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block-iterative projection methods for parallel computation of solutions to convex feasibility problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4496016 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The approximation of fixed points of compositions of nonexpansive mappings in Hilbert space / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Projection Algorithms for Solving Convex Feasibility Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Weak-to-Strong Convergence Principle for Fejér-Monotone Methods in Hilbert Spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extrapolation algorithm for affine-convex feasibility problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accelerating the convergence of the method of alternating projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projection and proximal point methods: Convergence results and counterexamples. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Energy-based sensor network source localization via projection onto convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5517433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the behavior of a block-iterative projection method for solving convex feasibility problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inherently parallel algorithms in feasibility and optimization and their applications. Research workshop, Haifa, Israel, March 13--16, 2000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Row-Action Methods for Huge and Sparse Systems and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the use of Cimmino's simultaneous projections method for computing a solution of the inverse problem in radiation therapy treatment planning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perturbation resilience and superiorization of iterative algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the string averaging method for sparse common fixed‐point problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of String-Averaging Projection Schemes for Inconsistent Convex Feasibility Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4718793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient controls for finitely convergent sequential algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hilbertian convex feasibility problem: Convergence of projection methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4681445 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On solving linear complementarity problems as linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2714376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4801805 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perturbation‐resilient block‐iterative projection methods with application to image reconstruction from projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Best approximation in inner product spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: General Projective Splitting Methods for Sums of Maximal Monotone Operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative algorithms for large partitioned linear systems, with applications to image reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Split Bregman Method for L1-Regularized Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast image recovery using dynamic load balancing in parallel architectures, by means of incomplete projections / rank
 
Normal rank
Property / cites work
 
Property / cites work: How good are projection methods for convex feasibility problems? / rank
 
Normal rank
Property / cites work
 
Property / cites work: The method of projections for finding the common point of convex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of Computerized Tomography / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for solving a linear feasibility problem with application to intensity-modulated radiation therapy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5768822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A discrete spherical x-ray transform of orientation distribution functions using bounding cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monotone Gram matrices and deepest surrogate inequalities in accelerated relaxation methods for convex feasibility problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Projection Methods for Finding Fixed Points of Firmly Nonexpansive Mappings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Demosaicking by Alternating Projections: Theory and Fast One-Step Implementation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a relaxation method of solving systems of linear inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Relaxation Method for Linear Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Methods in Image Reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong convergence of projection-like methods in Hilbert spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4115737 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition through formalization in a product space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4461766 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4384476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pairwise Optimal Weight Realization—Acceleration Technique for Set-Theoretic Adaptive Parallel Subgradient Projection Algorithm / rank
 
Normal rank

Revision as of 08:34, 5 July 2024

scientific article
Language Label Description Also known as
English
On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
scientific article

    Statements

    On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 June 2012
    0 references
    projection methods
    0 references
    convex feasibility problems
    0 references
    numerical evaluation
    0 references
    optimization
    0 references
    linear inequalities
    0 references
    sparse matrices
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers