Least squares methods to minimize errors in a smooth, strictly convex norm on R^ m

DOI10.1006/JATH.1993.1037MaRDI QIDQ1801558zbMATH OpenOpenAlexFDO

Authors R. W. Owens, V. P. Sreedharan

Publication date 17 August 1993

Published in Journal of Approximation Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jath.1993.1037

zbMATH Keywords

numerical examplesalgorithmleast squares solutions

Mathematics Subject Classification ID

Least squares and related methods for stochastic control systems (93E24)

Recommendations

• scientific article; zbMATH DE number 37926
• An algorithm for non-negative norm minimal solutions
• An algorithm for non—negative least error minimal norm solutions
• A least distance algorithm for a smooth strictly convex norm
• scientific article; zbMATH DE number 4139933

Cited in

(8)

• Using least square method to find the approximate solution of an overdetermined system of linear equations
• scientific article; zbMATH DE number 4094652 (Why is no real title available?)
• scientific article; zbMATH DE number 4139933 (Why is no real title available?)
• A least distance algorithm for a smooth strictly convex norm
• Successive calculation of the coordinates of the solution of the least squares problem
• The distance between two convex sets
• Structure of the least square solutions to overdetermined systems and its applications to practical inverse problems
• Linear M-estimation with bounded variables

This page was built for publication: Least squares methods to minimize errors in a smooth, strictly convex norm on \({\mathbb{R}}^ m\)

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