Interior point method: history and prospects

DOI10.1134/S0965542519100178zbMath1432.90006OpenAlexW2982442717WikidataQ126860687 ScholiaQ126860687MaRDI QIDQ2300702

Valeriǐ Ivanovich Zorkal'tsev

Publication date: 28 February 2020

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

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

zbMATH Keywords

interior point methodrelative interiorcalculation errorsChebyshev projections

Mathematics Subject Classification ID

Interior-point methods (90C51) History of mathematics in the 20th century (01A60) Development of contemporary mathematics (01A65) History of operations research and mathematical programming (90-03)

Related Items (2)

Convergence of Hölder projections to Chebyshev projections ⋮ Chebyshev approximations by least squares method

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
• 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
• Algebraic theory of linear inequalities
• Substantiation of interior point algorithms
• On a class of interior point algorithms

This page was built for publication: Interior point method: history and prospects