A strengthened acceptance criterion for approximate projections in Karmarkar's algorithm (Q1089251): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A relaxed version of Karmarkar's method / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Karmarkar's algorithm with improved steps / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A new polynomial-time algorithm for linear programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3686495 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A reduced-gradient variant of Karmarkar's algorithm and null-space projections / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An extension of Karmarkar's algorithm for linear programming using dual variables / rank | |||
Normal rank |
Latest revision as of 19:53, 17 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A strengthened acceptance criterion for approximate projections in Karmarkar's algorithm |
scientific article |
Statements
A strengthened acceptance criterion for approximate projections in Karmarkar's algorithm (English)
0 references
1986
0 references
As described by \textit{D. Goldfarb} and \textit{S. Mehrotra} [''A relaxed version of Karmarkar's method'', Tech. Rep., Dept. of Industrial Engineering and Oper. Res., Columbia Univ., New York (1985)] the convergence analysis of Karamarkar's method for linear programming leads naturally to an acceptance criterion when approximate projections are used in the course of the algorithm. Unfortunately, the preliminary results of Golbfarb and Mehrotra indicate that their criterion is generally not strong enough to insure that the algorithm makes reasonable progress. In this note we present a stronger criterion and show that the difference between the two criteria is potentially large.
0 references
projective algorithm
0 references
convergence analysis
0 references
Karamarkar's method
0 references
approximate projections
0 references