Primal-dual algorithms for linear programming based on the logarithmic barrier method (Q1337204): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5588268 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3033554 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large Step Path-Following Methods for Linear Programming, Part I: Barrier Function Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial method of approximate centers for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Projective SUMT Method for Convex Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3491304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior path following primal-dual algorithms. I: Linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(\sqrt n L)\) iteration potential reduction algorithm for linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a primal-dual interior point method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Implementation of a Primal-Dual Interior Point Method for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Implementation of a Primal-Dual Interior Point Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for a class of linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Complexity Reduction for the Long-Step Path-Following Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path-Following Methods for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4296156 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior path following primal-dual algorithms. II: Convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02191759 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2032415977 / rank
 
Normal rank

Latest revision as of 10:37, 30 July 2024

scientific article
Language Label Description Also known as
English
Primal-dual algorithms for linear programming based on the logarithmic barrier method
scientific article

    Statements

    Primal-dual algorithms for linear programming based on the logarithmic barrier method (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 December 1994
    0 references
    polynomial algorithms
    0 references
    primal-dual interior point methods
    0 references
    primal-dual logarithmic barrier function
    0 references

    Identifiers