A Complexity Analysis for Interior-Point Algorithms Based on Karmarkar’s Potential Function

DOI10.1137/0804028zbMath0841.90090OpenAlexW2060526856MaRDI QIDQ4308551

Yinyu Ye, Jun Ji

Publication date: 29 July 1996

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0804028

zbMATH Keywords

interior-point algorithmscomplexity analysisprimal-based potential function

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (5)

Optimum dimensional synthesis of planar mechanisms with geometric constraints ⋮ Potential-reduction methods in mathematical programming ⋮ Log-Barrier Interior Point Methods Are Not Strongly Polynomial ⋮ A lower bound on the number of iterations of long-step primal-dual linear programming algorithms ⋮ A new potential reduction algorithm for smooth convex programming

This page was built for publication: A Complexity Analysis for Interior-Point Algorithms Based on Karmarkar’s Potential Function