Best approximation with geometric constraints

Abstract

In this paper, we consider a finite family of sets (geometric constraints) F1,F2,…,Fr\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$F_{1}, F_{2},\\ldots , F_{r}$$\\end{document} in the Euclidean space Rn.\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$${\\mathbb {R}}^n.$$\\end{document} We show under mild conditions on the geometric constraints that the “perturbation property” of the constrained best approximation from a nonempty closed set K∩F\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$K \\cap F$$\\end{document} is characterized by the “convex conical hull intersection property” (CCHIP in short) at a reference feasible point in F. In this case, F is the intersection of the geometric constraints F1,F2,…,Fr,\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$F_{1}, F_{2},\\ldots , F_{r},$$\\end{document} and K is a nonempty closed convex set in Rn\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$${\\mathbb {R}}^n$$\\end{document} such that K∩F≠∅.\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$K \\cap F \ e \\emptyset .$$\\end{document} We do this by first proving a dual cone characterization of the contingent cone of the set F. Finally, we obtain the “Lagrange multiplier characterizations” of the constrained best approximation. Several examples are given to illustrate and clarify our results.