Dual interior point algorithms
From MaRDI portal
Publication:647858
Recommendations
Cites work
- scientific article; zbMATH DE number 3828663 (Why is no real title available?)
- scientific article; zbMATH DE number 4031392 (Why is no real title available?)
- scientific article; zbMATH DE number 3301975 (Why is no real title available?)
- A modification of Karmarkar's linear programming algorithm
- A variation on Karmarkar’s algorithm for solving linear programming problems
- Algorithms of projective optimization which use the multipliers of previous iterations
- An implementation of Karmarkar's algorithm for linear programming
- Computational experience with a dual affine variant of Karmarkar's method for linear programming
- Convex Analysis
- On theorems of the alternative
Cited in
(13)- Implementation of a Dual Affine Interior Point Algorithm for Linear Programming
- Optimization algorithms in the cone of central path
- An adaptation of the dual-affine interior point method for the surface flatness problem
- scientific article; zbMATH DE number 4164543 (Why is no real title available?)
- On a class of interior point algorithms
- Interior Dual Least 2-Norm Algorithm for Linear Programs
- Interior point algorithms in linear optimization
- Interior point method: history and prospects
- Monotonicity of Primal and Dual Objective Values in Primal-dual Interior-point Algorithms
- On Finding Primal- and Dual-Optimal Bases
- scientific article; zbMATH DE number 4135709 (Why is no real title available?)
- scientific article; zbMATH DE number 2208705 (Why is no real title available?)
- Method for sequential activation of limitations in linear programming
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)
