Interior point methods meet simplex in Loo, fitting problems

DOI10.1111/J.1475-3995.2004.00460.XMaRDI QIDQ3158871zbMATH OpenOpenAlexFDO

Authors Christiano Lyra, Aurelio R. L. Oliveira

Publication date 31 January 2005

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/j.1475-3995.2004.00460.x

zbMATH Keywords

\(L_\infty\) based statistical analysis\(L_\infty\) curve fittingChebyshev norm-based fitting probleminterior point methodslinear programming

Mathematics Subject Classification ID

Nonparametric inference (62G99) Interior-point methods (90C51)

Recommendations

• Efficient implementation and benchmark of interior point methods for the polynomial \(L_{1}\) fitting problem.
• Interior-point methods for linear programming: a review
• scientific article; zbMATH DE number 590363
• Interior-point methods for optimization
• scientific article; zbMATH DE number 946715

Cites work

• Algorithm 495: Solution of an Overdetermined System of Linear Equations in the Chebychev Norm [F4]
• Efficient implementation and benchmark of interior point methods for the polynomial \(L_{1}\) fitting problem.
• scientific article; zbMATH DE number 3876377 (Why is no real title available?)
• scientific article; zbMATH DE number 852532 (Why is no real title available?)

Cited in

(3)

• scientific article; zbMATH DE number 2104209 (Why is no real title available?)
• Efficient implementation and benchmark of interior point methods for the polynomial \(L_{1}\) fitting problem.
• An adaptation of the dual-affine interior point method for the surface flatness problem

This page was built for publication: Interior point methods meet simplex in Loo, fitting problems

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