Interior point algorithms in linear optimization
From MaRDI portal
Publication:4553648
DOI10.1134/S1990478918010179zbMATH Open1413.90176OpenAlexW2790627225MaRDI QIDQ4553648FDOQ4553648
Authors: I. V. Mokry, Valeriǐ Ivanovich Zorkaltsev
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
Recommendations
Cites Work
- A new polynomial-time algorithm for linear programming
- Title not available (Why is that?)
- A polynomial-time algorithm for a class of linear complementarity problems
- Interior path following primal-dual algorithms. I: Linear programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- A simplified global convergence proof of the affine scaling algorithm
- A variation on Karmarkar’s algorithm for solving linear programming problems
- Computational experience with a dual affine variant of Karmarkar's method for linear programming
- A modification of Karmarkar's linear programming algorithm
- Dual interior point algorithms
- A relaxation method for solving problems of non-linear programming
- Title not available (Why is that?)
- Substantiation of interior point algorithms
- Optimization algorithms in the cone of central path
Cited In (19)
- Interior point method: history and prospects
- Title not available (Why is that?)
- Solving linear systems in interior-point methods
- An interior-point algorithm for solving inverse linear optimization problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Experience of use of algorithms of inner points in energy models
- Substantiation of interior point algorithms
- Euclidean Jordan algebras and interior-point algorithms
- Title not available (Why is that?)
- Search for feasible solutions by interior point algorithms
- Title not available (Why is that?)
- Title not available (Why is that?)
- Dual interior point algorithms
- Interior-point algorithms: creation history, research results, applications, and prospects
- An Interior-Point Algorithm for Linearly Constrained Optimization
- Pivot versus interior point methods: Pros and cons
This page was built for publication: Interior point algorithms in linear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4553648)