An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution (Q1915904): Difference between revisions

Revision as of 11:55, 24 May 2024

scientific article

Language	Label	Description	Also known as
English	An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution	scientific article

Statements

instance of

scholarly article

0 references

title

An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution (English)

0 references

author

Robert M. Freund

0 references

published in

Annals of Operations Research

0 references

publication date

24 October 1996

0 references

zbMATH Keywords

interior-point

0 references

barrier function

0 references

Newton method

0 references

measures of infeasibility

0 references

nonoptimality

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

A combined phase I-phase II projective algorithm for linear programming

0 references

A combined phase I-phase II scaled potential algorithm for linear programming

0 references

On interior algorithms for linear programming with no regularity assumptions

0 references

Theoretical efficiency of a shifted-barrier-function algorithm for linear programming

0 references

A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start''

0 references

A Potential Reduction Algorithm with User-Specified Phase I–Phase II Balance for Solving a Linear Program from an Infeasible Warm Start

0 references

Following a “Balanced” Trajectory from an Infeasible Point to an Optimal Linear Programming Solution with a Polynomial-Time Algorithm

0 references

A polynomial Newton method for linear programming

0 references

A new polynomial-time algorithm for linear programming

0 references

A primal-dual infeasible-interior-point algorithm for linear programming

0 references

Computational experience with a primal-dual interior point method for linear programming

0 references

An Interior Point Column Generation Method for Linear Programming Using Shifted Barriers

0 references

Polynomiality of infeasible-interior-point algorithms for linear programming

0 references

Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming

0 references

A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming

0 references

Q4739657

0 references

Modified barrier functions (theory and methods)

0 references

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

0 references

A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points

0 references

A polynomial method of approximate centers for linear programming

0 references

On Anstreicher's combined phase I-phase II projective algorithm for linear programming

0 references

Combining phase I and phase II in a potential reduction algorithm for linear programming

0 references

On combined phase 1-phase 2 projective methods for linear programming

0 references

A simple complexity proof for a polynomial-time linear programming algorithm

0 references

A projective algorithm for linear programming with no regularity condition

0 references

An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm

0 references

On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem

0 references

Superlinear convergence of infeasible-interior-point methods for linear programming

0 references

Identifiers

zbMATH Open document ID

0848.90081

0 references

DOI

10.1007/BF02206810

0 references

Mathematics Subject Classification ID

90C05

0 references

zbMATH DE Number

894977

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1915904

@@ Property / cites work @@
+A combined phase I-phase II projective algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+A combined phase I-phase II scaled potential algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+On interior algorithms for linear programming with no regularity assumptions
+Normal rank
@@ Property / cites work @@
+Theoretical efficiency of a shifted-barrier-function algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start''
+Normal rank
@@ Property / cites work @@
+A Potential Reduction Algorithm with User-Specified Phase I–Phase II Balance for Solving a Linear Program from an Infeasible Warm Start
+Normal rank
@@ Property / cites work @@
+Following a “Balanced” Trajectory from an Infeasible Point to an Optimal Linear Programming Solution with a Polynomial-Time Algorithm
+Normal rank
@@ Property / cites work @@
+A polynomial Newton method for linear programming
@@ Property / cites work: A polynomial Newton method for linear programming / rank @@
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+A primal-dual infeasible-interior-point algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Computational experience with a primal-dual interior point method for linear programming
+Normal rank
@@ Property / cites work @@
+An Interior Point Column Generation Method for Linear Programming Using Shifted Barriers
+Normal rank
@@ Property / cites work @@
+Polynomiality of infeasible-interior-point algorithms for linear programming
+Normal rank
@@ Property / cites work @@
+Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
+Normal rank
@@ Property / cites work @@
+A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms for Linear Programming
+Normal rank
@@ Property / cites work @@
+Q4739657
@@ Property / cites work: Q4739657 / rank @@
+Normal rank
@@ Property / cites work @@
+Modified barrier functions (theory and methods)
@@ Property / cites work: Modified barrier functions (theory and methods) / rank @@
+Normal rank
@@ Property / cites work @@
+An Infeasible-Interior-Point Predictor-Corrector Algorithm for Linear Programming
+Normal rank
@@ Property / cites work @@
+A quadratically convergent predictor-corrector method for solving linear programs from infeasible starting points
+Normal rank
@@ Property / cites work @@
+A polynomial method of approximate centers for linear programming
+Normal rank
@@ Property / cites work @@
+On Anstreicher's combined phase I-phase II projective algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Combining phase I and phase II in a potential reduction algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+On combined phase 1-phase 2 projective methods for linear programming
+Normal rank
@@ Property / cites work @@
+A simple complexity proof for a polynomial-time linear programming algorithm
+Normal rank
@@ Property / cites work @@
+A projective algorithm for linear programming with no regularity condition
+Normal rank
@@ Property / cites work @@
+An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
+Normal rank
@@ Property / cites work @@
+On the Convergence of a Class of Infeasible Interior-Point Methods for the Horizontal Linear Complementarity Problem
+Normal rank
@@ Property / cites work @@
+Superlinear convergence of infeasible-interior-point methods for linear programming
+Normal rank