Degeneracy in interior point methods for linear programming: A survey (Q1312753): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
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 geometric view of parametric linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limiting behavior of the affine scaling continuous trajectories for linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear programming and the Newton barrier flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic behaviour of Karmarkar's method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Duality Theory of Linear Programs: A Constructive Approach with Applications / 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: Q5202503 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nonlinear Geometry of Linear Programming. II Legendre Transform Coordinates and Central Trajectories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Very Large-Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovering an optimal LP basis from an interior point solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5583564 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4187574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Study of Indicators for Identifying Zero Variables in Interior-Point Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shadow prices and sensitivity analysis in linear programming under degeneracy. State-of-the-art-survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3975042 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A variant of Karmarkar's linear programming algorithm for problems in standard form / 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: Q3236242 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial affine algorithms for linear programming / 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: Large Step Path-Following Methods for Linear Programming, Part II: Potential Reduction Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search directions for interior linear-programming methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path-Following Methods for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of search directions in interior point methods for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A potential-reduction variant of Renegar's short-step path-following method for linear programming / 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: On the convexity of the multiplicative version of Karmarkar's potential function / rank
 
Normal rank
Property / cites work
 
Property / cites work: A proof of the polynomiality of the Iri-Imai method / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multiplicative barrier function method for linear programming / 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: Determining basic variables of optimal solutions in Karmarkar's new LP algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical convergence of large-step primal-dual interior point algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems / 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 unified approach to interior point algorithms for linear complementarity problems: A summary / 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: Q4203999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation of a Dual Affine Interior Point Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analogue of Moreau's proximation theorem, with application to the nonlinear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3965924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Finding Primal- and Dual-Optimal Bases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boundary Behavior of Interior Point Algorithms in Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding a vertex solution using interior point methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic Convergence in a Primal-Dual Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding an interior point in the optimal face of linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Continuous Trajectories for a Potential Reduction Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence and Boundary Behavior of the Projective Scaling Trajectories 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 Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm, based on Newton's method, for linear programming / 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: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3798476 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3804467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal-basis identification technique for interior-point linear programming algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pivot rules for linear programming: A survey on recent theoretical developments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Bounds and Containing Ellipsoids in Karmarkar's Linear Programming Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of Karmarkar's algorithm for linear programming using dual variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Centered Projective Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of the affine-scaling algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Convergence Property of the Affine Scaling Methods for Primal Degenerate Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence of the affine scaling methods for degenerate linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Convergence of a Long-Step Affine Scaling Algorithm for Degenerate Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local Convergence Properties of New Methods in Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3351137 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modification of Karmarkar's linear programming algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approaches to sensitivity analysis in linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5202840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4016509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Karmarkar's algorithm and the ellipsoid method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovering Optimal Basic Variables in Karmarkar's Polynomial Algorithm for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n^ 3L)\) potential reduction algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the finite convergence of interior-point algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recovering optimal dual solutions in Karmarkar's polynomial algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Containing and shrinking ellipsoids in the path-following algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Superlinear and Quadratic Convergence of Primal-Dual Interior Point Linear Programming Algorithms / rank
 
Normal rank

Latest revision as of 12:50, 22 May 2024

scientific article
Language Label Description Also known as
English
Degeneracy in interior point methods for linear programming: A survey
scientific article

    Statements

    Degeneracy in interior point methods for linear programming: A survey (English)
    0 references
    0 references
    24 February 1994
    0 references
    0 references
    polynomial arithmetics
    0 references
    global and local convergence
    0 references
    basis recovery
    0 references
    numerical performance
    0 references
    sensitivity analysis
    0 references
    degeneracy
    0 references
    interior point methods
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references