An easy way to teach interior-point methods.

DOI10.1016/S0377-2217(00)00094-1zbMath1068.90614OpenAlexW2072831243MaRDI QIDQ5932020

Tamás Terlaky

Publication date: 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(00)00094-1

zbMATH Keywords

Interior-point methodsLinear optimizationPolynomial complexitySelf-dual embeddingStrictly complementary solutionStrongly polynomial rounding procedure

Mathematics Subject Classification ID

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

Related Items

A still simpler way of introducing interior-point method for linear programming, A new primal-dual predictor-corrector interior-point method for linear programming based on a wide neighbourhood, Complexity analysis of a full-{N}ewton step interior-point method for linear optimization, A corrector-predictor interior-point method with new search direction for linear optimization, A new wide neighborhood primal-dual second-order corrector algorithm for linear optimization, Calmness of partially perturbed linear systems with an application to the central path, Interior Point Methods for Nonlinear Optimization, New method for determining search directions for interior-point algorithms in linear optimization, Pivot versus interior point methods: Pros and cons

Uses Software

• SDPHA

Cites Work

• On the finite convergence of interior-point algorithms for linear programming
• A new polynomial-time algorithm for linear programming
• Sensitivity analysis in linear programming: Just be careful!
• Finding an interior point in the optimal face of linear programs
• Interior point methods of mathematical programming
• Initialization in semidefinite programming via a self-dual skew-symmetric embedding
• A general parametric analysis approach and its implication to sensitivity analysis in interior point methods
• On the Implementation of a Primal-Dual Interior Point Method
• An Implementation of a Primal-Dual Interior Point Method for Linear Programming
• An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming
• On homogeneous interrior-point algorithms for semidefinite programming
• The theory of linear programming:skew symmetric self-dual problems and the central path^*
• Semidefinite Programming
• New complexity analysis of the primal-dual Newton method for linear optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item