An adaptation of the dual-affine interior point method for the surface flatness problem

DOI10.1016/J.EJOR.2006.03.036MaRDI QIDQ877663zbMATHOpenAlexFDO

Authors Antonio Roberto Balbo, Edméa Cássia Baptista, Marcos N. Arenales

Publication date 3 May 2007

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2006.03.036

zbMATH Keywords

linear programminginterior point methodssurface flatness problemTchebyshev's norm

Mathematics Subject Classification ID

Linear programming (90C05) Interior-point methods (90C51)

Recommendations

• Implementation of a Dual Affine Interior Point Algorithm for Linear Programming
• Dual interior point algorithms
• Interior Dual Least 2-Norm Algorithm for Linear Programs
• Interior point methods meet simplex in Loo, fitting problems
• Efficient implementation and benchmark of interior point methods for the polynomial \(L_{1}\) fitting problem.

Cites work

• scientific article; zbMATH DE number 439946 (Why is no real title available?)
• scientific article; zbMATH DE number 4164543 (Why is no real title available?)
• scientific article; zbMATH DE number 964349 (Why is no real title available?)
• A new polynomial-time algorithm for linear programming
• An implementation of Karmarkar's algorithm for linear programming
• Evaluation of straightness and flatness error using computational geometric techniques.

This page was built for publication: An adaptation of the dual-affine interior point method for the surface flatness problem

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