A constant-potential infeasible-start interior-point algorithm with computational experiments and applications

DOI10.1023/A:1018343420495zbMath0905.90121OpenAlexW1497084258MaRDI QIDQ1383829

Abbas Seifi, Tunçel, Levent

Publication date: 13 April 1998

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1018343420495

zbMATH Keywords

polynomial complexitypotential functionsimple recourseconstant-potential infeasible-start interior-pointlarge scale planningworst-case iteration complexity analysis

Mathematics Subject Classification ID

Abstract computational complexity for mathematical programming problems (90C60) Linear programming (90C05) Stochastic programming (90C15)

Related Items (2)

Status determination by interior-point methods for convex optimization problems in domain-driven form ⋮ Analysis of a smoothing method for symmetric conic linear programming

Uses Software

• LOQO

This page was built for publication: A constant-potential infeasible-start interior-point algorithm with computational experiments and applications