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

DOI10.1016/J.EJOR.2006.03.036zbMATH Open1123.90077OpenAlexW2049194959MaRDI QIDQ877663FDOQ877663

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

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.

zbMATH Keywords

linear programminginterior point methodssurface flatness problemTchebyshev's norm

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• A new polynomial-time algorithm for linear programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Evaluation of straightness and flatness error using computational geometric techniques.
• An implementation of Karmarkar's algorithm for linear programming

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)