Pages that link to "Item:Q5963308"
From MaRDI portal
The following pages link to An acceleration scheme for Dykstra's algorithm (Q5963308):
Displaying 13 items.
- Anderson acceleration of the alternating projections method for computing the nearest correlation matrix (Q306368) (← links)
- Accelerating the alternating projection algorithm for the case of affine subspaces using supporting hyperplanes (Q486223) (← links)
- Acceleration schemes for the method of alternating projections (Q1263944) (← links)
- Accelerated shift-and-add algorithms (Q1577440) (← links)
- A Macsyma implementation of Zeilberger's fast algorithm (Q1596259) (← links)
- Accelerated alternating descent methods for Dykstra-like problems (Q1704007) (← links)
- Fast DHT algorithms for length \(N=q*2^m\) (Q2732815) (← links)
- Dykstra's algorithm as the nonlinear extension of Bregman's optimization method (Q4936263) (← links)
- (Q5140714) (← links)
- A new way of computing the orthogonal projection onto the intersection of two hyperplanes in a finite-dimensional Hilbert space (Q5376969) (← links)
- (Q5482653) (← links)
- The Supporting Halfspace--Quadratic Programming Strategy for the Dual of the Best Approximation Problem (Q5506687) (← links)
- An accelerated tensorial double proximal gradient method for total variation regularization problem (Q6108976) (← links)
