On Projection Algorithms for Solving Convex Feasibility Problems
From MaRDI portal
convex programmingnonexpansive mappingsubdifferentialconvex setimage recoverycomputerized tomographyfirmly nonexpansive mappingorthogonal projectionsubgradient algorithmaveraged mappingKaczmarz's methodconvex feasibility problemsSlater pointconvex inequalitiesCimmino's methodsuccessive projectionsangle between two subspacesFejér monotone sequencequality of convergence
Recommendations
Cited in
(only showing first 100 items - show all)- Algorithms for the split variational inequality problem
- A hybrid approximation algorithm for finding common solutions of equilibrium problems, a finite family of variational inclusions, and fixed point problems in Hilbert spaces
- Convergence theorems of a new iteration for asymptotically nonexpansive mappings in Banach spaces
- Parallel algorithms for variational inequalities over the Cartesian product of the intersections of the fixed point sets of nonexpansive mappings
- Convergence of non-periodic infinite products of orthogonal projections and nonexpansive operators in Hilbert space
- A strong convergence theorem for a zero of the sum of a finite family of maximally monotone mappings
- Convergence theorems for split feasibility problems on a finite sum of monotone operators and a family of nonexpansive mappings
- Parallel and cyclic hybrid subgradient extragradient methods for variational inequalities
- A generalized projection-based scheme for solving convex constrained optimization problems
- Projection methods: an annotated bibliography of books and reviews
- Two-step methods and relaxed two-step methods for solving the split equality problem
- Dykstra's splitting and an approximate proximal point algorithm for minimizing the sum of convex functions
- Outer Approximation Method for Constrained Composite Fixed Point Problems Involving Lipschitz Pseudo Contractive Operators
- On the centralization of the circumcentered-reflection method
- Convergence Theorems and Convergence Rates for the General Inertial Krasnosel’skiǐ–Mann Algorithm
- Stable Convergence Theorems for Infinite Products and Powers of Nonexpansive Mappings
- scientific article; zbMATH DE number 5538161 (Why is no real title available?)
- A Distributed Boyle--Dykstra--Han Scheme
- Optimum signal and image recovery by the method of alternating projections in fractional Fourier domains
- A randomized approximation algorithm for the minimal-norm static-output-feedback problem
- Alternating projection method for intersection of convex sets, multi-agent consensus algorithms, and averaging inequalities
- Regular Sequences of Quasi-Nonexpansive Operators and Their Applications
- On finite convergence of iterative methods for variational inequalities in Hilbert spaces
- The alternating algorithm in a uniformly convex and uniformly smooth Banach space
- On the closedness of the sum of ranges of operators \(A_k\) with almost compact products \(A_i^\ast A_j\)
- On the computation of the step-size for the CQ-like algorithms for the split feasibility problem
- Perturbed iterative methods for a general family of operators: convergence theory and applications
- Strong convergence of the mann iteration for -demicontractive mappings
- Perturbed projections and subgradient projections for the multiple-sets split feasibility problem
- About subtransversality of collections of sets
- Modified inertial Mann algorithm and inertial CQ-algorithm for nonexpansive mappings
- Necessary and sufficient conditions for emptiness of the cones of generalized support vectors
- Two-step viscosity approximation scheme for variational inequality in Banach spaces
- Strong convergence algorithms of the split common fixed point problem for total quasi-asymptotically pseudocontractive operators
- Proximal alternating direction method with relaxed proximal parameters for the least squares covariance adjustment problem
- An algorithm for generalized constrained multi-source Weber problem with demand substations
- Convex feasibility modeling and projection methods for sparse signal recovery
- Ball-relaxed projection algorithms for multiple-sets split feasibility problem
- Strong convergence theorem of two-step iterative algorithm for split feasibility problems
- A new hybrid method for hierarchical fixed points problems and variational inequality problems
- A simple algorithm for computing projection onto intersection of finite level sets
- An iterative method for split equality variational inequality problems for non-Lipschitz pseudomonotone mappings
- Applications of Mann's method to the split common fixed point problem
- scientific article; zbMATH DE number 6263278 (Why is no real title available?)
- A new iterative algorithm for the set of fixed-point problems of nonexpansive mappings and the set of equilibrium problem and variational inequality problem
- Strong convergence of hybrid algorithm for asymptotically nonexpansive mappings in Hilbert spaces
- A sequential iteration algorithm with non-monotoneous behaviour in the method of projections onto convex sets
- The composite iteration algorithm for finding efficient and financially fair risk-sharing rules
- The superiorization method with restarted perturbations for split minimization problems with an application to radiotherapy treatment planning
- Analysis on Newton projection method for the split feasibility problem
- Kaczmarz method with oblique projection
- Convergence of a randomized Douglas-Rachford method for linear system
- Dual sufficient characterizations of transversality properties
- Primal necessary characterizations of transversality properties
- Solving a split feasibility problem by the strong convergence of two projection algorithms in Hilbert spaces
- Using projected cutting planes in the extended cutting plane method
- The problem of projecting the origin of Euclidean space onto the convex polyhedron
- Globally Convergent Type-I Anderson Acceleration for Nonsmooth Fixed-Point Iterations
- A gradient projection method for solving split equality and split feasibility problems in Hilbert spaces
- A novel relaxed projective method for split feasibility problems
- Strong Variational Sufficiency for Nonlinear Semidefinite Programming and Its Implications
- A finite steps algorithm for solving convex feasibility problems
- Linear Convergence of Random Dual Coordinate Descent on Nonpolyhedral Convex Problems
- String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases
- On the convergence of general projection methods for solving convex feasibility problems with applications to the inverse problem of image recovery
- Stochastic quasi-subgradient method for stochastic quasi-convex feasibility problems
- Quantitative characterizations of regularity properties of collections of sets
- Fixed point analysis of Douglas-Rachford splitting for ptychography and phase retrieval
- A scratch covering algorithm using affine projection method
- A modified iterative method for split problem of variational inclusions and fixed point problems
- Convergence in norm of modified Krasnoselski-Mann iterations for fixed points of demicontractive mappings
- Solving the variational inequality problem defined on intersection of finite level sets
- A relaxed self-adaptive CQ algorithm for the multiple-sets split feasibility problem
- Computational acceleration of projection algorithms for the linear best approximation problem
- Strong and weak convergence theorems for an infinite family of nonexpansive mappings and applications
- Learning theory of randomized sparse Kaczmarz method
- Iterative processes for common fixed points of two different families of mappings with applications
- Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces.
- General iterative methods for a family of nonexpansive mappings
- Strong convergence algorithm for the split problem of variational inclusions, split generalized equilibrium problem and fixed point problem
- Strong convergence of a relaxed CQ algorithm for the split feasibility problem
- Incremental subgradient method for nonsmooth convex optimization with fixed point constraints
- Alternating Mann iterative algorithms for the split common fixed-point problem of quasi-nonexpansive mappings
- Regularized methods for the split feasibility problem
- Strong convergence for an iterative method for the triple-hierarchical constrained optimization problem
- Convergence of hybrid steepest-descent methods for variational inequalities
- An inexact nonmonotone projected gradient method for constrained multiobjective optimization
- Quasi-subgradient methods with Bregman distance for quasi-convex feasibility problems
- Learning functions of few arbitrary linear parameters in high dimensions
- A non-interior continuation algorithm for solving the convex feasibility problem
- Quasi-convex feasibility problems: subgradient methods and convergence rates
- On a generalized Ky Fan inequality and asymptotically strict pseudocontractions in the intermediate sense
- Optimization for Inconsistent Split Feasibility Problems
- A viscosity approximation scheme for finding common solutions of mixed equilibrium problems, a finite family of variational inclusions, and fixed point problems in Hilbert spaces
- -CONVERGENCES OF WEIGHTED AVERAGED PROJECTIONS IN SPACES
- On the finite convergence of a projected cutter method
- Hybrid extragradient-like methods for generalized mixed equilibrium problems, systems of generalized equilibrium problems and optimization problems
- Functional data analysis by matrix completion
- Strong convergence of shrinking projection methods for a family of pseudocontractive mappings in Hilbert spaces
- A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications
This page was built for publication: On Projection Algorithms for Solving Convex Feasibility Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4714414)
