759 research outputs found

    On the Steepest Descent Method for a Class of Quasi-Differentiable Optimization Problems

    Get PDF
    In a recent paper, V.F. Demyanov, S. Gamidov and I. Sivelina developed an algorithm for solving optimization problems, given by smooth compositions of max-type functions. In this paper the authors apply this algorithm to a larger class of quasidifferentiable functions. This paper is a contribution to research on nondifferentiable optimization currently underway with the System and Decision Sciences Program

    Tax Allocation Bonds in California after Proposition 13

    Get PDF

    Tax Allocation Bonds in California after Proposition 13

    Get PDF

    On Maximum Cycle Packings in Polyhedral Graphs

    Full text link
    This paper addresses upper and lower bounds for the cardinality of a maximum vertex-/edge-disjoint cycle packing in a polyhedral graph G. Bounds on the cardinality of such packings are provided, that depend on the size, the order or the number of faces of G, respectively. Polyhedral graphs are constructed, that attain these bounds
    corecore