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

Recommendations

On combined phase 1-phase 2 projective methods for linear programming
On Anstreicher's combined phase I-phase II projective algorithm for linear programming
scientific article; zbMATH DE number 4119925
Combined projected gradient algorithm for linear programming
A projective simplex method for linear programming
scientific article; zbMATH DE number 6613080
A dual projective simplex method for linear programming
A dual projective pivot algorithm for linear programming
scientific article; zbMATH DE number 4185389
An alternating projections algorithm for solving linear programs

Cites work

A monotonic projective algorithm for fractional linear programming
A new polynomial-time algorithm for linear programming
A polynomial Newton method for linear programming
A relaxed version of Karmarkar's method
A variant of Karmarkar's linear programming algorithm for problems in standard form
An extension of Karmarkar's algorithm for linear programming using dual variables
Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming
Relaxed variants of Karmarkar's algorithm for linear programs with unknown optimal objective value

Cited in

(24)

scientific article; zbMATH DE number 4119925 (Why is no real title available?)
A little theorem of the big \({\mathcal M}\) in interior point algorithms
Combined projected gradient algorithm for linear programming
A complete algorithm for linear fractional programs
On Anstreicher's combined phase I-phase II projective algorithm for linear programming
On combined phase 1-phase 2 projective methods for linear programming
A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start
A monotonic projective algorithm for fractional linear programming
Infeasible interior-point methods for linear optimization based on large neighborhood
A self-adjoint algorithm for solving linear programming problems
Average case complexity results for a centering algorithm for linear programming problems under Gaussian distributions
An infeasible-start algorithm for linear programming whose complexity depends on the distance from the starting point to the optimal solution
A combined phase I-phase II scaled potential algorithm for linear programming
A strictly improving linear programming Phase I algorithm
Combining phase I and phase II in a potential reduction algorithm for linear programming
An affine scaling method with an infeasible starting point: Convergence analysis under nondegeneracy assumption
An improved general Phase-I method in linear programming
An extension of the potential reduction algorithm for linear complementarity problems with some priority goals
A Fourth bibliography of fractional programming
A dual projective pivot algorithm for linear programming
On interior algorithms for linear programming with no regularity assumptions
A projective algorithm for linear programming with no regularity condition
Potential-reduction methods in mathematical programming
Linear updates for a single-phase projective method

This page was built for publication: A combined phase I-phase II projective algorithm for linear programming

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