scientific article; zbMATH DE number 3402056
From MaRDI portal
Publication:5667964
Cited in
(13)- Block-iterative surrogate projection methods for convex feasibility problems
- Computational efficiency of the simplex embedding method in convex nondifferentiable optimization
- Iterative Fejér processes in ill-posed problems
- Extrapolation algorithm for affine-convex feasibility problems
- On N. Z. Shor's three scientific ideas
- On convergence rates of subgradient optimization methods
- The use of additional diminishing disturbances in Fejer models of iterative algorithms
- Fejér-type iterative processes in the constrained quadratic minimization problem
- Alternating projection method for intersection of convex sets, multi-agent consensus algorithms, and averaging inequalities
- Hilbertian convex feasibility problem: Convergence of projection methods
- Hierarchical variational inequality problem for noncooperative game-theoretic selection of generalized Nash equilibrium
- An accelerated Fejér-type process for finding a non-negative solution to a system of linear algebraic equations
- Iterative processes of Fejér type in ill-posed problems with a priori information
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5667964)
