Pages that link to "Item:Q1166775"
From MaRDI portal
The following pages link to An interior points algorithm for the convex feasibility problem (Q1166775):
Displaying 12 items.
- Dual averaging with adaptive random projection for solving evolving distributed optimization problems (Q306393) (← links)
- Hilbertian convex feasibility problem: Convergence of projection methods (Q678107) (← links)
- On some optimization techniques in image reconstruction from projections (Q1109546) (← links)
- A superlinearly convergent projection algorithm for solving the convex inequality problem (Q1271387) (← links)
- Block-iterative surrogate projection methods for convex feasibility problems (Q1347226) (← links)
- Finding the projection of a point onto the intersection of convex sets via projections onto half-spaces. (Q1421503) (← links)
- Block-iterative projection methods for parallel computation of solutions to convex feasibility problems (Q1822907) (← links)
- Opial-Type Theorems and the Common Fixed Point Problem (Q2897281) (← links)
- Projection methods for the linear split feasibility problems (Q3514829) (← links)
- Cyclic subgradient projections (Q3953572) (← links)
- Iterations of paracontractions and firmaly nonexpansive operators with applications to feasibility and optimization (Q4351184) (← links)
- An Algorithm for Solving the Variational Inequality Problem Over the Fixed Point Set of a Quasi-Nonexpansive Operator in Euclidean Space (Q5396922) (← links)
