A primal-dual interior point method whose running time depends only on the constraint matrix (Q1352307): 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: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Nonlinear Geometry of Linear Programming. I Affine and Projective Scaling Trajectories / 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: The Nonlinear Geometry of Linear Programming. III Projective Legendre Transform Coordinates and Hilbert Geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: A geometric property of the least squares solution of linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Systems of distinct representatives and linear algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Linear Least-Squares Problems with Diagonally Dominant Weight Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3359644 / 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 Short-Cut Potential Reduction Algorithm 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: On the complexity of approximating extremal determinants in matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050157 / 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: Computational experience with a primal-dual interior point method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4206561 / 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 Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Surface of Analytic Centers and Primal-Dual Infeasible-Interior-Point Algorithms 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: Q4324980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On bounds for scaled projections and pseudoinverses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / 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: Q4283447 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of following the central path of linear programs by linear extrapolation. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: On scaled projections and pseudoinverses / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dantzig-Wolfe-Like Variant of Karmarkar's Interior-Point Linear Programming Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An active-set strategy in an interior point method for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable Finite Elements for Problems with Wild Coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stable Numerical Algorithms for Equilibrium Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Condition numbers for polyhedra with real number data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4016509 / 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: A quadratically convergent \(O(\sqrt n\;L)\)-iteration algorithm for linear programming / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02592148 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2059969305 / rank
 
Normal rank

Latest revision as of 08:52, 30 July 2024

scientific article
Language Label Description Also known as
English
A primal-dual interior point method whose running time depends only on the constraint matrix
scientific article

    Statements

    A primal-dual interior point method whose running time depends only on the constraint matrix (English)
    0 references
    0 references
    0 references
    1996
    0 references
    layered least squares
    0 references
    interior point method
    0 references
    characterization of the central path
    0 references
    strongly polynomial time
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers