An acceleration scheme for Dykstra’s algorithm
- 23 June 2015
- journal article
- research article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 63 (1) , 29-44
Abstract
No abstract availableKeywords
This publication has 44 references indexed in Scilit:
- Unconstrained Optimization Techniques for the Acceleration of Alternating Projection MethodsNumerical Functional Analysis and Optimization, 2011
- An Accelerated Iterative Method with Diagonally Scaled Oblique Projections for Solving Linear Feasibility ProblemsAnnals of Operations Research, 2005
- Finding the projection of a point onto the intersection of convex sets via projections onto half-spacesJournal of Approximation Theory, 2003
- Computing the nearest correlation matrix--a problem from financeIMA Journal of Numerical Analysis, 2002
- Enhanced Structural Damage Detection Using Alternating Projection MethodsAIAA Journal, 1998
- Acceleration schemes for the method of alternating projectionsJournal of Computational and Applied Mathematics, 1989
- On some optimization techniques in image reconstruction from projectionsApplied Numerical Mathematics, 1987
- A parallel subgradient projections method for the convex feasibility problemJournal of Computational and Applied Mathematics, 1987
- Convergence results for an accelerated nonlinear cimmino algorithmNumerische Mathematik, 1986
- An Algorithm for Restricted Least Squares RegressionJournal of the American Statistical Association, 1983