Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension (Q1029621): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Presolving in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Automatic Scaling of Matrices for Gaussian Elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: PCx: an interior-point code for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: The integration of an interior-point cutting plane method within a branch-and-price algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Interior-Point Method for Convex Multicriteria Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Warm Starts for Interior Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A potential-function reduction algorithm for solving a linear program directly from an infeasible ``warm start'' / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical efficiency of a shifted-barrier-function algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition and Nondifferentiable Optimization with the Projective Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On constrained optimization by adjoint based quasi-Newton methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple centrality corrections in a primal-dual method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Warm start of the primal-dual method applied in the cutting-plane scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reoptimization With the Primal-Dual Interior Point Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Warm start and \(\varepsilon\)-subgradients in a cutting plane scheme for block-angular linear programs / 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: Feature Article—Interior Point Methods for Linear Programming: Computational State of the Art / 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: Computational Experience with an Interior Point Cutting Plane Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving real-world linear ordering problems using a primal-dual interior point cutting plane method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving combinatorial optimization problems using Karmarkar's algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified barrier functions (theory and methods) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Mathematical View of Interior-Point Methods in Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5482452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5691079 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interior-Point Perspective on Sensitivity Analysis in Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sensitivity analysis in linear programming and semidefinite programming using interior-point methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Interior-Point Approach to Sensitivity Analysis in Degenerate Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Warm-Start Strategies in Interior-Point Methods for Linear Programming / rank
 
Normal rank

Latest revision as of 18:20, 1 July 2024

scientific article
Language Label Description Also known as
English
Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension
scientific article

    Statements

    Implementation of warm-start strategies in interior-point methods for linear programming in fixed dimension (English)
    0 references
    0 references
    0 references
    13 July 2009
    0 references
    linear programming
    0 references
    interior-point methods
    0 references
    warm-start strategies
    0 references
    reoptimization
    0 references
    0 references
    0 references
    0 references

    Identifiers