-
2
-
-
0030246542
-
On projection algorithms for solving convex feasibility problems
-
H.H. Bauschke and J.M. Borwein, On projection algorithms for solving convex feasibility problems, SIAM Review 38 (1996) 367-426.
-
(1996)
SIAM Review
, vol.38
, pp. 367-426
-
-
Bauschke, H.H.1
Borwein, J.M.2
-
3
-
-
0002436271
-
A method for finding projections onto the intersection of convex sets in Hilbert spaces
-
Lecture Notes in Statistics Springer, New York
-
J.P. Boyle and R.L. Dykstra, A method for finding projections onto the intersection of convex sets in Hilbert spaces, in: Advances in Order Restricted Statistical Inference, Lecture Notes in Statistics (Springer, New York, 1985) 28-47.
-
(1985)
Advances in Order Restricted Statistical Inference
, pp. 28-47
-
-
Boyle, J.P.1
Dykstra, R.L.2
-
4
-
-
0001336448
-
The method of successive projection for finding a common point of convex sets
-
L.M. Bregman, The method of successive projection for finding a common point of convex sets, Doklady 162 (1965) 688-692.
-
(1965)
Doklady
, vol.162
, pp. 688-692
-
-
Bregman, L.M.1
-
5
-
-
77956923291
-
Iterative methods for the convex feasibility problem
-
M. Rosenfeld and J. Zaks, eds., North-Holland, Amsterdam
-
Y. Censor, Iterative methods for the convex feasibility problem, in: M. Rosenfeld and J. Zaks, eds., Convexity and Graph Theory (North-Holland, Amsterdam, 1984) 83-91.
-
(1984)
Convexity and Graph Theory
, pp. 83-91
-
-
Censor, Y.1
-
6
-
-
0001770096
-
The method of alternating orthogonal projections
-
S.P. Singh, ed., Kluwer Academic Publishers, Boston, MA
-
F. Deutsch, The method of alternating orthogonal projections, in: S.P. Singh, ed., Approximation Theory, Spline Functions and Applications (Kluwer Academic Publishers, Boston, MA, 1992) 105-121.
-
(1992)
Approximation Theory, Spline Functions and Applications
, pp. 105-121
-
-
Deutsch, F.1
-
7
-
-
0002969298
-
The rate of convergence of Dykstra's cyclic projections algorithm: The polyhedral case
-
F. Deutsch and H. Hundal, The rate of convergence of Dykstra's cyclic projections algorithm: The polyhedral case, Numerical Functional Analysis and Optimization 15 (1994) 537-565.
-
(1994)
Numerical Functional Analysis and Optimization
, vol.15
, pp. 537-565
-
-
Deutsch, F.1
Hundal, H.2
-
9
-
-
0001886656
-
A cyclic projection algorithm via duality
-
N. Gaffke and R. Mathar, A cyclic projection algorithm via duality, Metrika 36 (1989) 29-54.
-
(1989)
Metrika
, vol.36
, pp. 29-54
-
-
Gaffke, N.1
Mathar, R.2
-
11
-
-
0023860607
-
A successive projection method
-
S.P. Han, A successive projection method, Mathematical Programming 40 (1988) 1-14.
-
(1988)
Mathematical Programming
, vol.40
, pp. 1-14
-
-
Han, S.P.1
-
12
-
-
0007136851
-
A quadratic programming procedure
-
Erratum, ibid., 361
-
C. Hildreth, A quadratic programming procedure, Naval Research Logistics Quarterly 4 (1957) 79-85 [Erratum, ibid., 361].
-
(1957)
Naval Research Logistics Quarterly
, vol.4
, pp. 79-85
-
-
Hildreth, C.1
-
13
-
-
0011313525
-
On the convergence rate of Hildreth's quadratic programming algorithm
-
A.N. Iusem and A.R. De Pierro, On the convergence rate of Hildreth's quadratic programming algorithm, Mathematical Programming 47 (1990) 37-51.
-
(1990)
Mathematical Programming
, vol.47
, pp. 37-51
-
-
Iusem, A.N.1
De Pierro, A.R.2
-
14
-
-
34249920356
-
On the convergence of han's method for convex programming with quadratic objective
-
A.N. Iusem and A.R. De Pierro, On the convergence of Han's method for convex programming with quadratic objective, Mathematical Programming 52 (1991) 265-284.
-
(1991)
Mathematical Programming
, vol.52
, pp. 265-284
-
-
Iusem, A.N.1
De Pierro, A.R.2
-
15
-
-
0002951308
-
-
Princeton University Press, Princeton, NJ
-
J. von Neumann, Functional Operators, Vol. II, The Geometry of Orthogonal Spaces (Princeton University Press, Princeton, NJ, 1950).
-
(1950)
Functional Operators, Vol. II, The Geometry of Orthogonal Spaces
, vol.2
-
-
Von Neumann, J.1
|