10,512 research outputs found

    A potential-function reduction algorithm for solving a linear program directly from an infeasible "warm start"

    No full text
    Includes bibliographical references (p. 34-35).Robert M. Freund

    Newton's method for the general parametric center problem with applications

    No full text
    "March, 1991."Includes bibliographical references (p. 37-39).Kok Choon Tan and Robert M. Freund

    Condition number complexity of an elementary algorithm for resolving a conic linear system

    No full text
    Cover title.Includes bibliographical references (p. 47-48).Supported through NSF Graduate Research Fellowship.Marina Epelman and Robert M. Freund

    Dual gauge programs, with applications to quadratic programming and the minimum-norm problem

    No full text
    Bibliography: p. 33.by Robert M. Freund

    Applications of a generalization of a set intersection theorem of Von Neumann

    No full text
    Includes bibliographical references.by Robert M. Freund

    The sensitivity of a linear program solution to changes in matrix coefficients

    No full text
    Bibliography: p. 25.by Robert M. Freund

    Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function

    No full text
    Includes bibliographical references (p. 28-29).by Robert M. Freund

    Projective transformations for interior point methods, Part I: Basic Theory and Linear Programming

    No full text
    Includes bibliographical references (p. [53]-[55]).by Robert M. Freund

    Combinatorial analogs of Brouwer's fixed point theorem on a bounded polyhedron

    No full text
    Bibliography: p.61-62.by Robert M. Freund

    Polynomial-time algorithms for linear programming based only on primal scaling and projected gradients of a potential function

    No full text
    Bibliography: p. 28-29.Robert M. Freund
    corecore