Efficient implementation and benchmark of interior point methods for the polynomial \(L_{1}\) fitting problem.

DOI10.1016/S0167-9473(00)00006-2zbMath1110.62318OpenAlexW1995795802MaRDI QIDQ5940720

No author found.

Publication date: 20 August 2001

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-9473(00)00006-2

zbMATH Keywords

linear programmingcurve fittinginterior point methodsdata miningregression problems

Mathematics Subject Classification ID

Nonparametric regression and quantile regression (62G08) Applications of mathematical programming (90C90)

Related Items (3)

Interior point methods meet simplex in Loo, fitting problems ⋮ APPLIED REGRESSION ANALYSIS BIBLIOGRAPHY UPDATE 2000–2001 ⋮ Hopfield neural networks in large-scale linear optimization problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Parallel and superfast algorithms for Hankel systems of equations
• A globally and quadratically convergent affine scaling method for linear \(l_ 1\) problems
• Primal-dual interior point approach for computing \(l_ 1\)-solutions and \(l_ \infty\)-solutions of overdetermined linear systems
• Affine-scaling for linear programs with free variables
• Linear Programming Techniques for Regression Analysis
• A revised simplex algorithm for the absolute deviation curve fitting problem
• L ₁ solution of overdetermined systems of linear equations
• A Global and Quadratically Convergent Method for Linear $l_\infty $ Problems
• On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
• An Algorithm for the Inversion of Finite Hankel Matrices
• An Improved Algorithm for Discrete $l_1 $ Linear Approximation

This page was built for publication: Efficient implementation and benchmark of interior point methods for the polynomial \(L_{1}\) fitting problem.