Interior point methods with self-regular proximities

MaRDI QIDQ3428840zbMATHFDO

Authors Imre Pólik, Tamás Terlaky

Publication date 29 March 2007

zbMATH Keywords

interior point methodsself-regular proximities

Mathematics Subject Classification ID

Interior-point methods (90C51) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods
• On self-regular IPMs (with comments and rejoinder)
• The complexity of self-regular proximity based infeasible IPMs
• Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function
• Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization

Cited in

(2)

• Regularized optimization methods with finite-step interior algorithms
• The complexity of self-regular proximity based infeasible IPMs

This page was built for publication: Interior point methods with self-regular proximities

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