Continuity of Approximation by Neural Networks in Lp Spaces

Annals of Operations Research

Volumn 101, Issue 1-4, 2001, Pages 143-147

  Kainen, Paul C ^a   Kůrková, Věra ^b   Vogt, Andrew ^a  

^a GEORGETOWN UNIVERSITY   (United States)

^b INSTITUTE OF COMPUTER SCIENCE   (Czech Republic)

Author keywords

Boundedly compact; Chebyshev set; Continuous selection; Near best approximation; Strictly convex space

Indexed keywords

EID: 0043289787     PISSN: 02545330     EISSN: 15729338     Source Type: Journal    
DOI: 10.1023/A:1010916406274     Document Type: Article

References (7)

1. R. DeVore, R. Howard and C. Micchelli, Optimal nonlinear approximation, Manuscripta Mathematica 63 (1989) 469-478.
2. A.L. Dontchev and T. Zolezzi, Well-Posed Optimization Problems, Lecture Notes in Mathematics 1543 (Springer, Berlin, 1993).
3. E. Hewitt and K. Stromberg, Real and Abstract Analysis (Springer, New York, 1965).
4. R. Huotari and W. Li, Continuities of metric projections and geometric consequences, J. Approx. Theory 90 (1997) 319-339.
5. P.C. Kainen, V. Kůrková and A. Vogt, Approximation by neural networks is not continuous, Neurocomputing 29 (1999) 47-56.
6. P.C. Kainen, V. Kůrková and A. Vogt, Geometry and topology of continuous best and near best approximations, J. Approx. Theory 105 (2000) 252-262.
7. I. Singer, Best Approximation in Normed Linear Spaces by Elements of Linear Subspaces (Springer, New York, 1970).