A platform for research: civil engineering, architecture and urbanism
A platform for research: civil engineering, architecture and urbanism
Dynamic string-averaging projection methods for convex feasibility problems in the presence of computational errors
Dynamic string-averaging projection methods for convex feasibility problems in the presence of computational errors
Dynamic string-averaging projection methods for convex feasibility problems in the presence of computational errors
Zaslavski, A.J. (author)
JOURNAL OF NONLINEAR AND CONVEX ANALYSIS ; 15 ; 623-636
2014-01-01
14 pages
Article (Journal)
English
DDC:
515.7248
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Projection algorithms for convex feasibility problems on Hadamard manifolds
| British Library Online Contents | 2016
Strong convergence of general projection methods for solving convex feasibility problem
| British Library Online Contents | 2018
The selective projection method for convex feasibility and split feasibility problem
| British Library Online Contents | 2018
Alternating CQ-algorithms for convex feasibility and split fixed-point problems
| British Library Online Contents | 2014
Dual Methods for Convex Separable Problems
| Springer Verlag | 1993