Convergence results and numerical experiments on a linear programming hybrid algorithm (Q1095026): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 01:28, 31 January 2024

scientific article
Language Label Description Also known as
English
Convergence results and numerical experiments on a linear programming hybrid algorithm
scientific article

    Statements

    Convergence results and numerical experiments on a linear programming hybrid algorithm (English)
    0 references
    0 references
    1987
    0 references
    A modification of Karmarkar's algorithm for linear programming successively generates column-scaled equivalents of the original linear program, and in the scaled coordinates obtains improvements according to steepest descent directions. As an interior-feasible-preserving algorithm, termination requires a purification algorithm to obtain a dual basic optimal solution. Together the two algorithms comprise a `hybrid' procedure for solving linear programs. In this paper we present some convergence results on the Phase II and Phase I portions of the scaling algorithm. We also present results of numerical experiments on examples of Klee-Minty type which show sensitivity to the starting interior-feasible point and steepest descent step size.
    0 references
    column scaling
    0 references
    orthogonal projection
    0 references
    modification
    0 references
    Karmarkar's algorithm
    0 references
    steepest descent directions
    0 references
    interior-feasible-preserving algorithm
    0 references
    convergence results
    0 references
    scaling algorithm
    0 references

    Identifiers