go-v.orgdoi

An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming

Florian Alexandru Potra · SIAM Journal on Optimization · 1996

  • DOI 10.1137/0806002
  • Publisher Society for Industrial and Applied Mathematics
  • Type article
  • Issued 1996

Not cached yet. This record was fetched live for this request and is stored after the lookup. Reopening the page should serve the cached copy.

SIAM Journal on Optimization · Society for Industrial and Applied Mathematics · article · 1996

Abstract

A predictor-corrector method is proposed for solving standard form linear programming problems starting from initial points that strictly satisfy the positivity constraints, but do not necessarily satisfy the equality constraints. The algorithm is globally convergent under the assumption that the linear program has an optimal solution. Under some additional assumptions on the starting point we prove that $\epsilon $-feasibility and $\epsilon $-complementarily can be obtained in $O( n \ln ( \frac{1}{\epsilon } )) $ iterations.

Open the resolved locator · 10.1137/0806002

Metadata licence: OpenAlex metadata (CC0)

Registry
OpenAlex DOI index + API
Fetched
2026-11-20 16:45 UTC
Cache state
not cached yet (bulk-index+openalex)
Locator
https://doi.org/10.1137/0806002
Metadata licence
OpenAlex metadata (CC0)
Scope
Metadata as returned by the resolver; abstracts are never generated here.