A Dual Approach to Constrained Interpolationfrom a Convex Subset of Hilbert Space

Journal of Approximation Theory

Volumn 90, Issue 3, 1997, Pages 385-414

  Deutsch, Frank ^a   Li, Wu ^b   Ward, Joseph D ^c  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b OLD DOMINION UNIVERSITY   (United States)

^c TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001669049     PISSN: 00219045     EISSN: None     Source Type: Journal    
DOI: 10.1006/jath.1996.3082     Document Type: Article

References (19)

1. Boyle J. P., Dykstra R. L. A method for finding projections onto the intersectionof convex sets in Hilbert spaces. Advances in Order Restricted Statistical Inference. Lecture Notes in Statistics. 1985;Springer-Verlag, New York/Berlin. p. 28-47.
2. Chui C. K., Deutsch F., Ward J. D. Constrained best approximation in Hilbert space. Constr. Approx. 6:1990;35-64.
3. Chui C. K., Deutsch F., Ward J. D. Constrained best approximation in Hilbert space II. J. Approx. Theory. 71:1992;213-238.
4. Cominetti R. Metric regularity, tangent sets, and second-order optimalityconditions. Appl. Math. Optim. 21:1990;265-287.
5. Deutsch F. Interpolation from a convex subset of Hilbert space:A survey of some recent results. Singh S. P. Approximation Theory, Wavelets and Applications. 1995;95-105 Kluwer Academic, Boston.
6. Deutsch F. Dykstra's cyclic projections algorithm: The rateof convergence. Singh S. P. Approximation Theory, Wavelets and Applications. 1995;87-94 Kluwer Academic, Boston.
7. Deutsch F., Ubhaya V., Ward J., Xu Y. Constrained best approximation in Hilbert space III:Applications ton. Constr. Approx. 12:1996;361-384.
8. Dunford N., Schwartz J. T. Linear Operators Part I: General Theory. 1958;Interscience.
9. Li W. Linearly convergent descent methods for unconstrainedminimization of convex quadratic splines. J. Optim. Theory Appl. 86:1995;145-172.
10. Li W., Pardalos P. M., Han C. G. Gauss-Seidel method for least-distance problems. J. Optim. Theory Appl. 75:1992;487-500.
11. Li W., Swetits J. A new algorithm for solving strictly convex quadraticprograms. SIAM J. Optim. 1997.
12. p-approximation. Constr. Approx. 1:1985;93-102.
13. Micchelli C., Utreras F. Smoothing and interpolation in a convex subset of Hilbertspace. SIAM J. Sci. Statist. Comput. 9:1988;728-746.
14. Robinson S. Regularity and stability for convex multivalued functions. Math. Oper. Res. 1:1976;130-143.
15. Rockafellar R. T. Convex Analysis. 1970;Princeton Univ. Press, Princeton.
16. Smith P. W., Wolkowicz H. A nonlinear equation for linear programming. Math. Programming. 34:1986;235-238.
17. Ursescu C. Multifunctions with closed convex graph. Czech. Math. J. 25:1975;438-441.
18. Williamson R. E., Crowell R. H., Trotter H. F. Calculus of Vector Functions. 1968;Prentice-Hall, Englewood Cliffs.
19. Zhao K. Best interpolation with convex constraints. J. Approx. Theory. 73:1993;119-135.