Constrained L_ p approximation
DOI10.1007/BF01890024zbMATH Open0582.41002MaRDI QIDQ1069073FDOQ1069073
John Swetits, Philip W. Smith, Charles A. Micchelli, J. D. Ward
Publication date: 1985
Published in: Constructive Approximation (Search for Journal in Brave)
Recommendations
- L 1 -Approximation With Constraints
- scientific article
- Convex \(L^ p\) approximation
- Approximation with Convex Constraints
- scientific article; zbMATH DE number 4113792
- Optimality conditions for the constrained \(L_p\)-regularization
- Best \(L_ p\) approximation with multiple constraints for \(1\leq p<\infty\)
- A note on convex approximation in \(L_ p\)
- An 12constrained best approximation problem
- scientific article; zbMATH DE number 4131146
algorithmsB-splinesoptimal interpolationconstrained optimization problemsconstruction of convex interpolants to convex data
Interpolation in approximation theory (41A05) Spline approximation (41A15) Best approximation, Chebyshev systems (41A50) Spaces of measurable functions ((L^p)-spaces, Orlicz spaces, Köthe function spaces, Lorentz spaces, rearrangement invariant spaces, ideal spaces, etc.) (46E30)
Cites Work
Cited In (41)
- Title not available (Why is that?)
- Gauss-Seidel method for least-distance problems
- On the characterization of quadratic splines
- Spline smoothing under constraints on derivatives
- Markov-Dubins interpolating curves
- Constrained best approximation in Hilbert space. II
- A simple constraint qualification in infinite dimensional programming
- Best approximation and perturbation property in Hilbert spaces
- Interpolation of states by vector states on certain operator algebras
- Constrained best approximation in Hilbert space
- NON-STRICTLY CONVEX MINIMIZATION OVER THE FIXED POINT SET OF AN ASYMPTOTICALLY SHRINKING NONEXPANSIVE MAPPING
- Constrained interpolation and smoothing
- Interpolation and approximation by monotone cubic splines
- Shape constrained smoothing using smoothing splines
- Generalizations of Slater's constraint qualification for infinite convex programs
- Partially finite convex programming. II: Explicit lattice models
- Smoothing and interpolation in a convex subset of a Hilbert space : II. The semi-norm case
- Best interpolation in a strip. II: Reduction to unconstrained convex optimization
- A dual approach to constrained interpolation from a convex subset of Hilbert space
- Monotone interpolation of scattered data in \({\mathbb{R}}^ s\)
- On best constrained interpolation
- Application of a wheel-rail contact model to railway dynamics in small radius curved tracks
- On best restricted range approximation in continuous complex-valued function spaces
- Positive definite dot product kernels in learning theory
- Facial reduction in partially finite convex programming
- An algorithm for computing constrained smoothing spline functions
- On the characterization of non-negative volume-matching surface splines
- Armijo Newton method for convex best interpolation
- Constrained smoothing of histograms by quadratic splines
- NSM constrained approximation of Lipschitz functions from data
- L 1 -Approximation With Constraints
- Convexity-preserving interpolatory subdivision
- A nonlinear equation for linear programming
- Error bounds of two smoothing approximations for semi-infinite minimax problems
- Iteration methods for convexly constrained ill-posed problems in hilbert space
- Duality and well-posedness in convex interpolation∗)
- Smooth and Semismooth Newton Methods for Constrained Approximation and Estimation
- A survey on univariate data interpolation and approximation by splines of given shape
- Semiparametric regression with shape-constrained penalized splines
- Extremal Interpolation of Convex Scattered Data in $$\mathbb {R}^3$$ R 3 Using Tensor Product Bézier Surfaces
- Characterizing best isotone approximations in \(L_p\) spaces, \(1 \leq p < \infty\)
This page was built for publication: Constrained \(L_ p\) approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1069073)
