New complexity analysis of IIPMs for linear optimization based on a specific self-regular function

DOI10.1016/J.EJOR.2007.02.008zbMath1175.90291OpenAlexW2026131915MaRDI QIDQ2462141

Maziar Salahi, M. Reza Peyghami, Tamás Terlaky

Publication date: 23 November 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.2007.02.008

zbMATH Keywords

linear optimizationpolynomial complexityself-regular functionsinfeasible interior point methodsadaptive large update

Mathematics Subject Classification ID

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

Related Items (5)

Infeasible interior-point methods for linear optimization based on large neighborhood ⋮ A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function ⋮ A full-Newton step infeasible interior-point algorithm based on a kernel function with a new barrier term ⋮ A FULL-NEWTON STEP INFEASIBLE INTERIOR-POINT METHOD FOR LINEAR OPTIMIZATION BASED ON AN EXPONENTIAL KERNEL FUNCTION ⋮ Simplified infeasible interior-point algorithm for linear optimization based on a simple function

Uses Software

• McIPM

Cites Work

• A new polynomial-time algorithm for linear programming
• Feasibility issues in a primal-dual interior-point method for linear programming
• A primal-dual infeasible-interior-point algorithm for linear programming
• Polynomiality of infeasible-interior-point algorithms for linear programming
• A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
• Self-regular functions and new search directions for linear and semidefinite optimization
• The complexity of self-regular proximity based infeasible IPMs
• An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
• On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
• An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
• An adaptive self-regular proximity-based large-update IPM for LO
• A Predictor-Corrector Algorithm for Linear Optimization Based on a Specific Self-Regular Proximity Function
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: New complexity analysis of IIPMs for linear optimization based on a specific self-regular function