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

DOI10.1023/A:1018343420495MaRDI QIDQ1383829zbMATH OpenOpenAlexFDO

Authors Abbas Seifi, Levent Tunçel

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

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

Recommendations

• An infeasible-interior-point potential-reduction algorithm for linear programming
• Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
• scientific article; zbMATH DE number 1047678
• Polynomiality of infeasible-interior-point algorithms for linear programming
• Two computationally efficient polynomial-iteration infeasible interior-point algorithms for linear programming

Cited in

(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

Describes a project that uses

Uses Software

• LOQO

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1383829)