An extended variant of Karmarkar's interior point algorithm

DOI10.1016/J.AMC.2006.05.196zbMATH Open1154.65338OpenAlexW2101138237MaRDI QIDQ879548FDOQ879548

Authors: R. Naseri, Azizollah Valinejad 

Publication date: 14 May 2007

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2006.05.196

Recommendations

• scientific article; zbMATH DE number 5004702
• A new fast algorithm based on Karmarkar's gradient projected method for solving linear programming problems
• scientific article; zbMATH DE number 969963
• scientific article; zbMATH DE number 123365
• scientific article; zbMATH DE number 223544

zbMATH Keywords

linear programmingiterative methodsKarmarkar's interior point algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05)

Cites Work

• Title not available (Why is that?)
• A new polynomial-time algorithm for linear programming
• An implementation of Karmarkar's algorithm for linear programming
• Title not available (Why is that?)
• A survey of search directions in interior point methods for linear programming
• Computing Karmarkar projections quickly

Cited In (7)

• 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
• Title not available (Why is that?)
• A Complexity Analysis for Interior-Point Algorithms Based on Karmarkar’s Potential Function
• A logarithmic barrier approach for linear programming
• Title not available (Why is that?)
• A logarithmic barrier interior-point method based on majorant functions for second-order cone programming

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)