Feasibility issues in a primal-dual interior-point method for linear programming (Q803044): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: symrcm / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An implementation of Karmarkar's algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variation on Karmarkar’s algorithm for solving linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further Development of a Primal-Dual Interior Point Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5583564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3664299 / 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: A practical anti-cycling procedure for linearly constrained optimization / 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: Q3491304 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multifrontal method and paging in sparse Cholesky factorization / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of an available set of linear programming test problems / 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: Computational experience with a dual affine variant of Karmarkar's method for linear programming / 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: A modification of Karmarkar's linear programming algorithm / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01588785 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2094757704 / rank
 
Normal rank

Latest revision as of 11:39, 30 July 2024

scientific article
Language Label Description Also known as
English
Feasibility issues in a primal-dual interior-point method for linear programming
scientific article

    Statements

    Feasibility issues in a primal-dual interior-point method for linear programming (English)
    0 references
    0 references
    0 references
    1990
    0 references
    The author proposes a new method (based on the generic primal-dual algorithm) for obtaining an initial feasible interior-point solution to a linear program which avoids the use of a ``big-\({\mathcal M}''\).
    0 references
    0 references
    0 references
    0 references
    0 references
    primal-dual algorithm
    0 references
    initial feasible interior-point solution
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references