Linear best approximation using a class of polyhedral norms

DOI10.1007/BF02139472MaRDI QIDQ1200539zbMATHOpenAlexFDO

Authors G. A. Watson

Publication date 16 January 1993

Published in Numerical Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bf02139472

zbMATH Keywords

algorithmdescent methodpolyhedral normsNumerical resultslinear best approximation problem

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65)

Recommendations

• scientific article; zbMATH DE number 89032
• Best approximation in certain classes of normed linear spaces
• scientific article; zbMATH DE number 3971405
• Linear best approximation using a class of \(k\)-major \(l_ p\) norms
• scientific article; zbMATH DE number 952613
• scientific article; zbMATH DE number 3851671
• scientific article; zbMATH DE number 65793
• Best Polynomial Approximation with Linear Constraints
• LINEAR ESTIMATES OF THE BEST LP -APPROXIMATION BY POLYNOMIALS
• scientific article; zbMATH DE number 898127

Cites work

• scientific article; zbMATH DE number 3915531 (Why is no real title available?)
• scientific article; zbMATH DE number 3690528 (Why is no real title available?)
• Convex Analysis
• Discrete, linear approximation problems in polyhedral norms
• Minimization Techniques for Piecewise Differentiable Functions: The $l_1$ Solution to an Overdetermined Linear System
• On Cline’s Direct Method for Solving Overdetermined Linear Systems in the $L_\infty $ Sense

Cited in

(18)

• On orthogonal linear \(\ell_1\) approximation
• scientific article; zbMATH DE number 123308 (Why is no real title available?)
• The \(L_1\)-norm best-fit hyperplane problem
• Linear best approximation using a class of \(k\)-major \(l_ p\) norms
• An algorithm for the best approximation by elements of a polyhedral set in banach spaces
• Deforming \(\|.\|_1\) into \(\|.\|_{\infty}\) via polyhedral norms: a pedestrian approach
• Dual formulation of the sparsity constrained optimization problem: application to classification
• On a class of algorithms for total approximation
• Weakly invariant norms: geometry of spheres in the space of skew-Hermitian matrices
• Feature selection in SVM via polyhedral \(k\)-norm
• On matrix approximation problems with Ky Fan \(k\) norms
• Polytopal balls arising in optimization
• DC formulations and algorithms for sparse optimization problems
• scientific article; zbMATH DE number 125063 (Why is no real title available?)
• scientific article; zbMATH DE number 89032 (Why is no real title available?)
• Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines
• Variational analysis of the Ky Fan \(k\)-norm
• Solving nonnegative sparsity-constrained optimization via DC quadratic-piecewise-linear approximations

This page was built for publication: Linear best approximation using a class of polyhedral norms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1200539)