Ming Jiang

Per-RMAP: Feasibility-Seeking and Superiorization Methods for Floorplanning with I/O Assignment

  • ShanYu
  • Yair Censor
  • Ming Jiang
  • Guojie Luo
    • Categories Applications - Science and Engineering, Constrained Nonlinear Optimization, VLSI layout Tags , , , ,

    The feasibility-seeking approach provides a systematic scheme to manage and solve complex constraints for continuous problems, and we explore it for the floorplanning problems with increasingly heterogeneous constraints. The classic legality constraints can be formulated as the union of convex sets. However, the convergence of conventional projection-based algorithms is not guaranteed when the constraints sets … Read more

    Bounded perturbation resilience of projected scaled gradient methods

  • Yair Censor
  • Ming Jiang
  • Wenma Jin
    • Categories Constrained Nonlinear Optimization, Convex Optimization Tags , , ,

    We investigate projected scaled gradient (PSG) methods for convex minimization problems. These methods perform a descent step along a diagonally scaled gradient direction followed by a feasibility regaining step via orthogonal projection onto the constraint set. This constitutes a generalized algorithmic structure that encompasses as special cases the gradient projection method, the projected Newton method, … Read more

    String-Averaging Expectation-Maximization for Maximum Likelihood Estimation in Emission Tomography

  • Yair Censor
  • Álvaro Rodolfo De Pierro
  • Elias Salomão Helou
  • Tai-Been Chen
  • I-Liang Chern
  • Ming Jiang
  • Henry Horng-Shing Lu
    • Categories Biomedical Applications, Convex Optimization Tags , , , , , ,

    We study the maximum likelihood model in emission tomography and propose a new family of algorithms for its solution, called String-Averaging Expectation-Maximization (SAEM). In the String-Averaging algorithmic regime, the index set of all underlying equations is split into subsets, called “strings,” and the algorithm separately proceeds along each string, possibly in parallel. Then, the end-points … Read more

    A Note on the Behavior of the Randomized Kaczmarz Algorithm of Strohmer and Vershynin

  • Yair Censor
  • Gabor T. Herman
  • Ming Jiang
    • Categories Biomedical Applications, Convex Optimization Tags , ,

    In a recent paper by Strohmer and Vershynin (J. Fourier Anal. Appl. 15:262–278, 2009) a “randomized Kaczmarz algorithm” is proposed for solving consistent systems of linear equations {ai, x = bi }m i=1. In that algorithm the next equation to be used in an iterative Kaczmarz process is selected with a probability proportional to ai2. … Read more