An acceleration scheme for Dykstra's algorithm
From MaRDI portal
Publication:5963308
DOI10.1007/s10589-015-9768-yzbMath1343.90103MaRDI QIDQ5963308
Publication date: 7 March 2016
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-015-9768-y
90C48: Programming in abstract spaces
Related Items
Unnamed Item, 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, Anderson acceleration of the alternating projections method for computing the nearest correlation matrix
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computing the nearest correlation matrix--a problem from finance
- Iterative methods for fixed point problems in Hilbert spaces
- Extrapolation and local acceleration of an iterative process for common fixed point problems
- Finding the closest Toeplitz matrix
- A numeric-analytic method for approximating the chaotic Chen system
- Variable target value relaxed alternating projection method
- An accelerated iterative method with diagonally scaled oblique projections for solving linear feasibility problems
- A linear acceleration row action method for projecting onto subspaces
- A randomized Kaczmarz algorithm with exponential convergence
- Convergence results for an accelerated nonlinear Cimmino algorithm
- A parallel subgradient projections method for the convex feasibility problem
- An accelerated successive orthogonal projections method for solving large-scale linear feasibility problems
- On some optimization techniques in image reconstruction from projections
- Dykstra's algorithm for constrained least-squares rectangular matrix problems
- Acceleration schemes for the method of alternating projections
- Dykstra's alternating projection algorithm for two sets
- Two generalizations of Dykstra's cyclic projections algorithm
- Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces.
- Alternating oblique projections for coupled linear systems
- Preconditioning projection methods for solving algebraic linear systems
- Low-order control design for LMI problems using alternating projection methods
- A cyclic Douglas-Rachford iteration scheme
- Extrapolation algorithm for affine-convex feasibility problems
- Computational acceleration of projection algorithms for the linear best approximation problem
- Set intersection problems: supporting hyperplanes and quadratic programming
- Dykstra's algorithm with strategies for projecting onto certain polyhedral cones
- Unconstrained Optimization Techniques for the Acceleration of Alternating Projection Methods
- Solving the split feasibility problem without prior knowledge of matrix norms
- An Algorithm for Restricted Least Squares Regression
- An Alternating Projection Algorithm for Computing the Nearest Euclidean Distance Matrix
- Relaxed Alternating Projection Methods
- Decomposition through formalization in a product space
- Dykstra's Algorithm for a Constrained Least-squares Matrix Problem
- The rate of convergence of dykstra's cyclic projections algorithm: The polyhedral case
- Accelerating the convergence of the method of alternating projections
- On Projection Algorithms for Solving Convex Feasibility Problems
- A Convergence Analysis of Dykstra's Algorithm for Polyhedral Sets
- Primal and polar approach for computing the symmetric diagonally dominant projection
- Robust Stopping Criteria for Dykstra's Algorithm
- The method of projections for finding the common point of convex sets
- Convex analysis and monotone operator theory in Hilbert spaces
- Best approximation in inner product spaces
