An adaptive self-regular proximity-based large-update IPM for LO

DOI10.1080/10556780412331332024zbMath1087.90085OpenAlexW1981321991MaRDI QIDQ5312761

Tamás Terlaky, Maziar Salahi

Publication date: 25 August 2005

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556780412331332024

zbMATH Keywords

linear optimizationpolynomial complexityprimal-dual interior-point methodself-regular proximity function

Mathematics Subject Classification ID

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

Related Items

An adaptive-step primal-dual interior point algorithm for linear optimization, New complexity analysis of IIPMs for linear optimization based on a specific self-regular function, On self-regular IPMs (with comments and rejoinder), Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization

Uses Software

• LIPSOL
• McIPM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new polynomial-time algorithm for linear programming
• Self-regular functions and new search directions for linear and semidefinite optimization
• On the Implementation of a Primal-Dual Interior Point Method
• A dynamic large-update primal‐dual interior-point method for linear optimization
• User'S guide To Lipsol linear-programming interior point solvers V0.4
• Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
• A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function