Interior Point Algorithms in Linear Optimization

DOI10.1134/S1990478918010179zbMath1413.90176OpenAlexW2790627225MaRDI QIDQ4553648

I. V. Mokry, Valeriǐ Ivanovich Zorkal'tsev

Publication date: 30 October 2018

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1990478918010179

zbMATH Keywords

linear programminginterior point methodcentral pathrelative interior

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A modification of Karmarkar's linear programming algorithm
• Dual interior point algorithms
• A new polynomial-time algorithm for linear programming
• Computational experience with a dual affine variant of Karmarkar's method for linear programming
• Interior path following primal-dual algorithms. I: Linear programming
• A polynomial-time algorithm for a class of linear complementarity problems
• A simplified global convergence proof of the affine scaling algorithm
• A variation on Karmarkar’s algorithm for solving linear programming problems
• A relaxation method for solving problems of non-linear programming
• Substantiation of interior point algorithms
• Optimization algorithms in the cone of central path

This page was built for publication: Interior Point Algorithms in Linear Optimization