On Projection Algorithms for Solving Convex Feasibility Problems
From MaRDI portal
angle between two subspacesaveraged mappingCimmino's methodcomputerized tomographyconvex feasibility problemsconvex inequalitiesconvex programmingconvex setFejér monotone sequencefirmly nonexpansive mappingimage recoveryKaczmarz's methodnonexpansive mappingorthogonal projectionquality of convergenceSlater pointsubdifferentialsubgradient algorithmsuccessive projections
Recommendations
Cited in
(only showing first 100 items - show all)- On the regularity condition in a convex feasibility problem
- Strong convergence of an iterative algorithm on an infinite countable family of nonexpansive mappings
- Hybrid iterative methods for convex feasibility problems and fixed point problems of relatively nonexpansive mappings in Banach spaces
- Iterative schemes for computing fixed points of nonexpansive mappings in Banach spaces
- Iterative algorithms for finding common solutions of variational inequalities and systems of equilibrium problems and fixed points of families and semigroups of nonexpansive mappings
- Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping
- Mixed equilibrium problems and optimization problems
- Parallel iterative regularization methods for solving systems of ill-posed equations
- Strong convergence theorems for an infinite family of nonexpansive mappings in Banach spaces
- A general iterative method for solving the variational inequality problem and fixed point problem of an infinite family of nonexpansive mappings in Hilbert spaces
- Metric subregularity and the proximal point method
- Strong convergence theorems of modified Ishikawa iterations for countable hemi-relatively nonexpansive mappings in a Banach space
- Strong convergence theorems by hybrid methods for a finite family of nonexpansive mappings and inverse-strongly monotone mappings
- Convergence of a hybrid projection algorithm in Banach spaces
- Enlarged cores and bargaining schemes in games with fuzzy coalitions
- A note on the behavior of the randomized Kaczmarz algorithm of Strohmer and Vershynin
- Strong convergence theorems of modified Ishikawa iterative process with errors for an infinite family of strict pseudo-contractions
- Fejér processes with diminishing disturbances
- Acoustic feedback cancellation based on weighted adaptive projection subgradient method in hearing aids
- Dykstra's algorithm for constrained least-squares rectangular matrix problems
- A superlinearly convergent projection algorithm for solving the convex inequality problem
- On spherical convergence, convexity, and block iterative projection algorithms in Hilbert space
- Incomplete projection algorithms for solving the convex feasibility problem
- A multiprojection algorithm using Bregman projections in a product space
- Convergence of Bregman projection methods for solving consistent convex feasibility problems in reflexive Banach spaces
- Error bounds in mathematical programming
- Generalized Bregman projections in convex feasibility problems
- An iterative approach to quadratic optimization
- Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces.
- Projection and proximal point methods: Convergence results and counterexamples.
- Generic power convergence of order-preserving mappings
- An iterative algorithm for finding a nearest pair of points in two convex subsets of \(\mathbb{R}^n\)
- An inertial Mann algorithm for nonexpansive mappings
- A new simultaneous iterative method with a parameter for solving the extended split equality problem and the extended split equality fixed point problem
- Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems
- Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems
- A non-interior continuation algorithm for solving the convex feasibility problem
- The combination projection method for solving convex feasibility problems
- Phase retrieval with one or two diffraction patterns by alternating projections with the null initialization
- Convergences of alternating projections in \(\mathrm{CAT}(\kappa)\) spaces
- Circumcentering the Douglas-Rachford method
- Some convergence strategies for the alternating generalized projection method
- Two algorithms for solving systems of inclusion problems
- On the computation of the step-size for the CQ-like algorithms for the split feasibility problem
- On the complexity of the projective splitting and Spingarn's methods for the sum of two maximal monotone operators
- A new approximation method for finding common elements of equilibrium problems, variational inequality problems and fixed point problems of nonspreading mappings
- From error bounds to the complexity of first-order descent methods for convex functions
- A unified approach to error bounds for structured convex optimization problems
- Bounded perturbation resilience of extragradient-type methods and their applications
- Viscosity iterative algorithms for fixed point problems of asymptotically nonexpansive mappings in the intermediate sense and variational inequality problems in Banach spaces
- Extragradient-proximal methods for split equilibrium and fixed point problems in Hilbert spaces
- Peaceman-Rachford splitting for a class of nonconvex optimization problems
- Convergence analysis of processes with valiant projection operators in Hilbert space
- Linear convergence of the randomized sparse Kaczmarz method
- The split feasibility problem and its solution algorithm
- 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
- Solving split common fixed-point problem of firmly quasi-nonexpansive mappings without prior knowledge of operators norms
- Proximal alternating direction method with relaxed proximal parameters for the least squares covariance adjustment problem
- Iterative algorithms for the split problem and its convergence analysis
- An algorithm for generalized constrained multi-source Weber problem with demand substations
- Functional data analysis by matrix completion
- Iterative algorithm for solving a class of convex feasibility problem
- Distributed optimization over directed graphs with row stochasticity and constraint regularity
- Iterative algorithms for solving the split feasibility problem in Hilbert spaces
- About intrinsic transversality of pairs of sets
- Projected subgradient algorithms on systems of equilibrium problems
- Relaxed two points projection method for solving the multiple-sets split equality problem
- On closedness of the sum of \(n\) subspaces of a Hilbert space
- Strong convergence of hybrid algorithm for asymptotically nonexpansive mappings in Hilbert spaces
- Convergence of sequential parafirmly nonexpansive mappings in reflexive Banach spaces
- Efficient computation of the Hausdorff distance between polytopes by exterior random covering
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- A new extragradient-type algorithm for the split feasibility problem
- The set of divergent infinite products in a Banach space is \(\sigma\)-porous
- Generalized Mann iterates for constructing fixed points in Hilbert spaces
- A projection method for semidefinite linear systems and its applications
- Steered sequential projections for the inconsistent convex feasibility problem
- A storm of feasibility pumps for nonconvex MINLP
- A semismooth Newton method for nonlinear symmetric cone programming
- A new general system of generalized nonlinear mixed composite-type equilibria and fixed point problems with an application to minimization problems
- On asymptotically quasi-\(\phi\)-nonexpansive mappings in the intermediate sense
- An acceleration scheme for cyclic subgradient projections method
- Convergence and perturbation resilience of dynamic string-averaging projection methods
- Two-step projection methods for a system of variational inequality problems in Banach spaces
- Global error bounds for piecewise convex polynomials
- Proximity algorithms for the L1/TV image denoising model
- Averaged alternating reflections in geodesic spaces
- General split feasibility problems in Hilbert spaces
- Nonsmooth penalty and subgradient algorithms to solve the problem of projection onto a polytope
- Two-step methods and relaxed two-step methods for solving the split equality problem
- A scratch covering algorithm using affine projection method
- A modified iterative method for split problem of variational inclusions and fixed point problems
- Conic programming: infeasibility certificates and projective geometry
- Incremental quasi-subgradient methods for minimizing the sum of quasi-convex functions
- Stability of a convex feasibility problem
- Analysis on Newton projection method for the split feasibility problem
- A viscosity hybrid steepest descent method for equilibrium problems, variational inequality problems, and fixed point problems of infinite family of strictly pseudocontractive mappings and nonexpansive semigroup
- A strong convergence theorem for equilibrium problems and split feasibility problems in Hilbert spaces
- Viscosity approximation process for a sequence of quasinonexpansive mappings
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)
