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

DOI10.1080/10556780412331332024MaRDI QIDQ5312761zbMATH OpenOpenAlexFDO

Authors Tamás Terlaky, Maziar Salahi

Publication date 25 August 2005

Published in Optimization Methods \& 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

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

Recommendations

• On self-regular IPMs (with comments and rejoinder)
• The complexity of self-regular proximity based infeasible IPMs
• A dynamic large-update primal‐dual interior-point method for linear optimization
• New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
• A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods

Cites work

• A dynamic large-update primal‐dual interior-point method for linear optimization
• A new polynomial-time algorithm for linear programming
• A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function
• scientific article; zbMATH DE number 3972641 (Why is no real title available?)
• scientific article; zbMATH DE number 1017028 (Why is no real title available?)
• scientific article; zbMATH DE number 1131479 (Why is no real title available?)
• scientific article; zbMATH DE number 964349 (Why is no real title available?)
• On the Implementation of a Primal-Dual Interior Point Method
• Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
• Self-regular functions and new search directions for linear and semidefinite optimization
• User'S guide To Lipsol linear-programming interior point solvers V0.4

Cited in

(6)

• On self-regular IPMs (with comments and rejoinder)
• New complexity analysis of IIPMs for linear optimization based on a specific self-regular function
• The complexity of self-regular proximity based infeasible IPMs
• An adaptive-step primal-dual interior point algorithm for linear optimization
• A dynamic large-update primal‐dual interior-point method for linear optimization
• Adaptive large-neighborhood self-regular predictor-corrector interior-point methods for linear optimization

Describes a project that uses

Uses Software

• LIPSOL
• McIPM

This page was built for publication: An adaptive self-regular proximity-based large-update IPM for LO

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