Dual interior point algorithms
From MaRDI portal
Publication:647858
DOI10.3103/S1066369X11040050zbMATH Open1229.90269OpenAlexW2011292856MaRDI QIDQ647858FDOQ647858
Authors: Valeriǐ Ivanovich Zorkaltsev 
Publication date: 21 November 2011
Published in: Russian Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3103/s1066369x11040050
Recommendations
Cites Work
- Convex Analysis
- Algorithms of projective optimization which use the multipliers of previous iterations
- Title not available (Why is that?)
- An implementation of Karmarkar's algorithm for linear programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- On theorems of the alternative
- 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
Cited In (12)
- Title not available (Why is that?)
- Interior point method: history and prospects
- Interior Dual Least 2-Norm Algorithm for Linear Programs
- An adaptation of the dual-affine interior point method for the surface flatness problem
- Monotonicity of Primal and Dual Objective Values in Primal-dual Interior-point Algorithms
- METHOD FOR SEQUENTIAL ACTIVATION OF LIMITATIONS IN LINEAR PROGRAMMING
- Title not available (Why is that?)
- Title not available (Why is that?)
- Implementation of a Dual Affine Interior Point Algorithm for Linear Programming
- Interior Point Algorithms in Linear Optimization
- On Finding Primal- and Dual-Optimal Bases
- Optimization algorithms in the cone of central path
This page was built for publication: Dual interior point algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q647858)
