An acceleration scheme for Dykstra's algorithm
From MaRDI portal
Recommendations
- On Dykstra's algorithm: finite convergence, stalling, and the method of alternating projections
- Accelerating the convergence of the method of alternating projections
- Dykstra's alternating projection algorithm for two sets
- Dykstra's Algorithm for a Constrained Least-squares Matrix Problem
- Robust Stopping Criteria for Dykstra's Algorithm
Cites work
- A Convergence Analysis of Dykstra's Algorithm for Polyhedral Sets
- A cyclic Douglas-Rachford iteration scheme
- A linear acceleration row action method for projecting onto subspaces
- A numeric-analytic method for approximating the chaotic Chen system
- A parallel subgradient projections method for the convex feasibility problem
- A randomized Kaczmarz algorithm with exponential convergence
- Accelerating the convergence of the method of alternating projections
- Accelerating the convergence of the method of alternating projections via a line search: A brief survey
- Acceleration schemes for the method of alternating projections
- Alternating oblique projections for coupled linear systems
- Alternating projection methods.
- An accelerated iterative method with diagonally scaled oblique projections for solving linear feasibility problems
- An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems
- An Algorithm for Restricted Least Squares Regression
- An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
- Best approximation in inner product spaces
- Computational acceleration of projection algorithms for the linear best approximation problem
- Computing the nearest correlation matrix--a problem from finance
- Computing the nearest diagonally dominant matrix
- Convergence results for an accelerated nonlinear Cimmino algorithm
- Convex analysis and monotone operator theory in Hilbert spaces
- Decomposition through formalization in a product space
- Dykstra's Algorithm for a Constrained Least-squares Matrix Problem
- Dykstra's algorithm for constrained least-squares rectangular matrix problems
- Dykstra's algorithm with strategies for projecting onto certain polyhedral cones
- Dykstra's alternating projection algorithm for two sets
- Extrapolation algorithm for affine-convex feasibility problems
- Extrapolation and local acceleration of an iterative process for common fixed point problems
- Finding the closest Toeplitz matrix
- Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces.
- scientific article; zbMATH DE number 1174325 (Why is no real title available?)
- scientific article; zbMATH DE number 1382772 (Why is no real title available?)
- scientific article; zbMATH DE number 2111135 (Why is no real title available?)
- scientific article; zbMATH DE number 1393068 (Why is no real title available?)
- scientific article; zbMATH DE number 3281211 (Why is no real title available?)
- Iterative methods for fixed point problems in Hilbert spaces
- Low-order control design for LMI problems using alternating projection methods
- On Projection Algorithms for Solving Convex Feasibility Problems
- On some optimization techniques in image reconstruction from projections
- Preconditioning projection methods for solving algebraic linear systems
- Primal and polar approach for computing the symmetric diagonally dominant projection
- Relaxed Alternating Projection Methods
- Robust Stopping Criteria for Dykstra's Algorithm
- Set intersection problems: supporting hyperplanes and quadratic programming
- Solving the split feasibility problem without prior knowledge of matrix norms
- The method of projections for finding the common point of convex sets
- The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
- Two generalizations of Dykstra's cyclic projections algorithm
- Unconstrained optimization techniques for the acceleration of alternating projection methods
- Variable target value relaxed alternating projection method
Cited in
(15)- Acceleration schemes for the method of alternating projections
- Accelerated shift-and-add algorithms
- A Macsyma implementation of Zeilberger's fast algorithm
- Accelerated alternating descent methods for Dykstra-like problems
- Fast DHT algorithms for length N=q*2ᵐ
- Anderson acceleration of the alternating projections method for computing the nearest correlation matrix
- Accelerating the alternating projection algorithm for the case of affine subspaces using supporting hyperplanes
- scientific article; zbMATH DE number 1393068 (Why is no real title available?)
- scientific article; zbMATH DE number 7286679 (Why is no real title available?)
- A new way of computing the orthogonal projection onto the intersection of two hyperplanes in a finite-dimensional Hilbert space
- scientific article; zbMATH DE number 5050108 (Why is no real title available?)
- The supporting halfspace-quadratic programming strategy for the dual of the best approximation problem
- An accelerated tensorial double proximal gradient method for total variation regularization problem
- Convergence Rate Analysis of a Dykstra-Type Projection Algorithm
- Assessing loan eligibility through correlation matrix approximation for credit estimation
This page was built for publication: An acceleration scheme for Dykstra's algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963308)
