Pages that link to "Item:Q2497243"
From MaRDI portal
The following pages link to Computational acceleration of projection algorithms for the linear best approximation problem (Q2497243):
Displaying 15 items.
- A new geometric acceleration of the von Neumann-Halperin projection method (Q333597) (← links)
- Common solutions to variational inequalities (Q452274) (← links)
- A generalized iterative method and comparison results using projection techniques for solving linear systems (Q732426) (← links)
- Finding a best approximation pair of points for two polyhedra (Q1616942) (← links)
- Finding best approximation pairs for two intersections of closed convex sets (Q2070342) (← links)
- String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases (Q2138440) (← links)
- How good are projection methods for convex feasibility problems? (Q2427393) (← links)
- On the incomplete oblique projections method for solving box constrained least squares problems (Q2453469) (← links)
- Accelerating the convergence of the method of alternating projections via a line search: A brief survey (Q2768017) (← links)
- Accelerated parallel projection method for solving the shortest distance problem (Q2907419) (← links)
- Strong convergence of subgradient extragradient methods for the variational inequality problem in Hilbert space (Q3096883) (← links)
- Unconstrained Optimization Techniques for the Acceleration of Alternating Projection Methods (Q3114578) (← links)
- Computational performance of a projection and rescaling algorithm (Q5865326) (← links)
- An acceleration scheme for Dykstra's algorithm (Q5963308) (← links)
- Proximal gradient/semismooth Newton methods for projection onto a polyhedron via the duality-gap-active-set strategy (Q6176299) (← links)
