Pages that link to "Item:Q2413285"
From MaRDI portal
The following pages link to Polyak's gradient method for split feasibility problem constrained by level sets (Q2413285):
Displayed 6 items.
- ``Optimal'' choice of the step length of the projection and contraction methods for solving the split feasibility problem (Q721148) (← links)
- A new self-adaptive CQ algorithm with an application to the LASSO problem (Q1615350) (← links)
- A new CQ algorithm for solving split feasibility problems in Hilbert spaces (Q2272641) (← links)
- A new relaxed CQ algorithm for solving split feasibility problems in Hilbert spaces and its applications (Q2313782) (← links)
- Strong convergence of two algorithms for the split feasibility problem in Banach spaces (Q4646522) (← links)
- The ball-relaxed CQ algorithms for the split feasibility problem (Q4646524) (← links)