A dual approach to constrained interpolation from a convex subset of Hilbert space
DOI10.1006/JATH.1996.3082zbMATH Open0884.41019OpenAlexW2070409288MaRDI QIDQ1369249FDOQ1369249
Publication date: 17 March 1998
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jath.1996.3082
algorithms for obtaining a best approximation elementbest approximation in Hilbert spacesgeometry of convex sets in Hilbert spaces
Best approximation, Chebyshev systems (41A50) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Geometry and structure of normed linear spaces (46B20)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Regularity and Stability for Convex Multivalued Functions
- Metric regularity, tangent sets, and second-order optimality conditions
- Smoothing and Interpolation in a Convex Subset of a Hilbert Space
- A New Algorithm for Solving Strictly Convex Quadratic Programs
- Best interpolation with convex constraints
- Constrained \(L_ p\) approximation
- Constrained best approximation in Hilbert space III. Applications of \(n\)-convex functions
- Constrained best approximation in Hilbert space. II
- Constrained best approximation in Hilbert space
- A nonlinear equation for linear programming
- Gauss-Seidel method for least-distance problems
- Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines
Cited In (35)
- A new projection method for finding the closest point in the intersection of convex sets
- Linear regularity and \(\phi\)-regularity of nonconvex sets
- Best Approximation in a Class of Normed Spaces with Star-Shaped Cone
- A weaker regularity condition for subdifferential calculus and Fenchel duality in infinite dimensional spaces.
- Best approximation and perturbation property in Hilbert spaces
- On basic constraint qualifications for infinite system of convex Inequalities in Banach spaces
- Linear regularity and linear convergence of projection-based methods for solving convex feasibility problems
- A Global Approach to Nonlinearly Constrained Best Approximation
- Tangential extremal principles for finite and infinite systems of sets. II: Applications to semi-infinite and multiobjective optimization
- Robust constrained best approximation with nonconvex constraints
- Reconstruction of functions from prescribed proximal points
- Fenchel duality in infinite-dimensional setting and its applications.
- Set regularities and feasibility problems
- Strong Abadie CQ, ACQ, calmness and linear regularity
- Regularized gap function as penalty term for constrained minimization problems
- Best approximation with geometric constraints
- Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation
- Lagrange multiplier characterizations of constrained best approximation with infinite constraints
- Fenchel duality and the strong conical hull intersection property
- On best restricted range approximation in continuous complex-valued function spaces
- Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty
- Strong CHIP, normality, and linear regularity of convex sets
- Strong uniqueness of the restricted Chebyshev center with respect to an RS-set in a Banach space
- Normal property, Jameson property, CHIP and linear regularity for an infinite system of convex sets in Banach spaces
- Characterizing nonconvex constrained best approximation using Robinson's constraint qualification
- Bounded linear regularity of convex sets in Banach spaces and its applications
- Title not available (Why is that?)
- Uniform subsmoothness and linear regularity for a collection of infinitely many closed sets
- Duality for optimization and best approximation over finite intersections
- Moreau--Rockafellar-Type Formulas for the Subdifferential of the Supremum Function
- A new method for interpolating in a convex subset of a Hilbert space
- Duality and well-posedness in convex interpolation∗)
- Strong CHIP for infinite systems of convex sets in normed linear spaces
- Convergence rate of Newton's method for \(L_2\) spectral estimation
- Lagrange multiplier characterizations of constrained best approximation with nonsmooth nonconvex constraints
This page was built for publication: A dual approach to constrained interpolation from a convex subset of Hilbert space
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1369249)