Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 6 of 6 for “"Matrix scaling"”.

  1. Faster algorithms for matrix scaling and balancing via convex optimization

    In this thesis, we study matrix scaling and balancing, which are fundamental problems in scientific computing, with a long line of work on them that dates back to the 1960s. We provide algorithms for both these problems that, ignoring logarithmic factors involving the dimension of the input matrix

    mit Repository record for Faster algorithms for matrix scaling and balancing via convex optimization (opens in a new tab)

  2. Shortest paths, Markov chains, matrix scaling and beyond : improved algorithms through the lens of continuous optimization

    … on simulating random walks, or applying fast matrix multiplication. *-- We develop faster algorithms for scaling and balancing nonnegative matrices, two fundamental problems in scientific computing, significantly improving over the previously known best running times. In particular, if the …

    mit Repository record for Shortest paths, Markov chains, matrix scaling and beyond : improved algorithms through the lens of continuous optimization (opens in a new tab)

  3. Network Optimization-based Approach for Identification of Illegal Trade in the Global Timber Supply Chain

    … both classic optimization formulations and matrix scaling-based algorithms. We extend the well-known formulation of matrix scaling algorithms to include prior knowledge of the reliability of the data. We propose a link-specific weighted iterative scaling algorithm (WIS) and a node-specific …

    mit Repository record for Network Optimization-based Approach for Identification of Illegal Trade in the Global Timber Supply Chain (opens in a new tab)

  4. Geometric methods in computational optimal transport and high-dimensional inference

    … offers a template for analysing related matrix scaling algorithms. Second, a framework for regularised Wasserstein estimators incorporating new entropic penalties is developed. For measures supported on finite sets, a dual formulation is derived that enables stochastic updates with O(1) …

    cambridge Repository record for Geometric methods in computational optimal transport and high-dimensional inference (opens in a new tab)

  5. Transport and Beyond: Efficient Optimization over Probability Distributions

    … tasks are fundamental in alignment problems, matrix problems, graph problems, and more. Chapters 2-4 establish near-linear runtimes for approximation algorithms for several classical problems under this umbrella: Optimal Transport, Minimum-Mean-Cycle, Matrix Balancing, and Matrix Scaling. Two …

    mit Repository record for Transport and Beyond: Efficient Optimization over Probability Distributions (opens in a new tab)

  6. An assessment of visitor attitudes toward resource use and management in a national park

    … of this study was to develop a method for scaling attitudes which alleviated problems of interpreting effects of two related components of attitude--beliefs and corresponding evaluations of those beliefs. In conjunction with this objective, visitor knowledge about and attitudes toward …

    vt Repository record for An assessment of visitor attitudes toward resource use and management in a national park (opens in a new tab)