Distance to the intersection of normal sets and applications

Numerical Functional Analysis and Optimization

Volumn 21, Issue 3, 2000, Pages 521-535

  Rubinov, A M ^a   Singer, I ^b  

^a UNIVERSITY OF BALLARAT   (Australia)

^b INSTITUTE OF MATHEMATICS   (Romania)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; FUNCTIONS; POLES AND ZEROS; POLYNOMIALS; THEOREM PROVING;

INEQUALITIES; NORMAL SETS;

SET THEORY;

EID: 0034187481     PISSN: 01630563     EISSN: None     Source Type: Journal    
DOI: 10.1080/01630560008816970     Document Type: Article

References (7)

1. H. H. Bauschke and J. M. Borwein, On projection algorithms for solving convex feasibility problems. SIAM Rev. 38 (1996), 367-426.
2. H. H. Bauschke, J. M. Borwein and W. Li, Strong conical hull intersection property, boumded linear regularity, Jameson's property (G), and error bounds in convex optimization (to appear).
3. A. J. Hoffman, On approximate solutions of systems of linear inequalities. J. Res. Nat. Bur. Standards 49 (1952), 263-265.
4. A. Hoffmann, The distance to the intersection of two convex sets expressed by the distance to each of them. Math. Nachr. 157 (1992), 81-98.
5. A. M. Rubinov and I. Singer, Best approximation by normal and conormal sets (submitted).
6. A. M. Rubinov, B.M. Glover, Increasing convex-along-rays functions with applications to global optimization, J. Optim. Theory Appl. (1999) (to appear).
7. I. Singer, Abstract convex analysis. J. Wiley & Sons, Interscience, New York, 1997.