An extended variant of Karmarkar's interior point algorithm
From MaRDI portal
Publication:879548
Recommendations
Cites work
- scientific article; zbMATH DE number 412110 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- A new polynomial-time algorithm for linear programming
- A survey of search directions in interior point methods for linear programming
- An implementation of Karmarkar's algorithm for linear programming
- Computing Karmarkar projections quickly
Cited in
(7)- scientific article; zbMATH DE number 5004702 (Why is no real title available?)
- A Complexity Analysis for Interior-Point Algorithms Based on Karmarkar’s Potential Function
- A logarithmic barrier interior-point method based on majorant functions for second-order cone programming
- A logarithmic barrier approach for linear programming
- Primal interior-point decomposition algorithms for two-stage stochastic extended second-order cone programming
- A new fast algorithm based on Karmarkar's gradient projected method for solving linear programming problems
- scientific article; zbMATH DE number 4086908 (Why is no real title available?)
This page was built for publication: An extended variant of Karmarkar's interior point algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q879548)