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 20 of 52 for “"Alternating minimization."”.

  1. Provable alternating minimization for non-convex learning problems

    Alternating minimization (AltMin) is a generic term for a widely popular approach in non-convex learning: often, it is possible to partition the variables into two (or more) sets, so that the problem is convex/tractable in one set if the other is held fixed (and vice versa). This allows for …

    texas Repository record for Provable alternating minimization for non-convex learning problems (opens in a new tab)

  2. Alternating Minimization Algorithms for Dual-Energy X-Ray CT Imaging and Information Optimization

    … studies of the regularized alternating minimization (DE-AM) algorithm with different regularization parameters were performed to find ranges of the parameters that can achieve the desired image quality in terms of estimation accuracy and image smoothness.The DE-AM algorithm …

    wustl Repository record for Alternating Minimization Algorithms for Dual-Energy X-Ray CT Imaging and Information Optimization (opens in a new tab)

  3. Multi-dimensional extension of the alternating minimization algorithm in x-ray computed tomography

    … method using the dual-energy alternating minimization (DEAM) algorithm is proposed.By correcting the ill-posed statistical model, a relative error as high as 15% in thesinogram-based decomposition method can be reduced to less than 1% with DEAM, whichis an approximately …

    wustl Repository record for Multi-dimensional extension of the alternating minimization algorithm in x-ray computed tomography (opens in a new tab)

  4. Multi-dimensional extension of the alternating minimization algorithm in x-ray computed tomography

    … method using the dual-energy alternating minimization (DEAM) algorithm is proposed.By correcting the ill-posed statistical model, a relative error as high as 15% in thesinogram-based decomposition method can be reduced to less than 1% with DEAM, whichis an approximately …

    wustl Repository record for Multi-dimensional extension of the alternating minimization algorithm in x-ray computed tomography (opens in a new tab)

  5. Double Alternating Minimization (DAM) for Phase Retrieval in the Presence of Poisson Noise and Pixelation

    Optical detectors, such as photodiodes and CMOS cameras, can only read intensity information, and thus phase information of wavefronts is lost. Phase retrieval algorithms are used to estimate the lost phase and reconstruct an accurate effective pupil function, where the squared modulus of its …

    wustl Repository record for Double Alternating Minimization (DAM) for Phase Retrieval in the Presence of Poisson Noise and Pixelation (opens in a new tab)

  6. A Study of Sampling Strategies for Helical CT

    … algorithm for helical x-ray CT is described. An alternating minimization (AM) algorithm for finding the maximum-likelihood estimates of attenuation functions in transmission X-ray tomography, developed by O’Sullivan and Benac, is then introduced. The derivation of this AM algorithm is extended to …

    wustl Repository record for A Study of Sampling Strategies for Helical CT (opens in a new tab)

  7. Learning with latent structures, robustness and non-linearity : non-convex approaches

    … techniques for non-convex problems such as alternating minimization and gradient descent, are typically easy to derive and use, but mostly lack theoretical foundations. It is difficult to obtain statistical consistency guarantees for these non-convex heuristics due to the existence of local …

    texas Repository record for Learning with latent structures, robustness and non-linearity : non-convex approaches (opens in a new tab)

  8. Optimization of GPU-Accelerated Iterative CT Reconstruction Algorithm for Clinical Use

    … implementation are presented. We describe the alternating minimization (AM) algorithm as the updating algorithm, and the branchless distance-driven method for the system forward operator. We introduce a version of the Feldkamp-Davis-Kress algorithm to generate the initial image for our …

    wustl Repository record for Optimization of GPU-Accelerated Iterative CT Reconstruction Algorithm for Clinical Use (opens in a new tab)

  9. Convex and nonconvex optimization geometries

    … Finally, in the final part, I will apply the alternating minimization algorithms to general tensor recovery problems and clustering problems. Part 1: Convex Optimization. In this part, we apply convex relaxations to several popular nonconvex problems in signal processing and machine learning …

    colo-mines Repository record for Convex and nonconvex optimization geometries (opens in a new tab)

  10. Efficient non-convex algorithms for large-scale learning problems

    … three types of algorithms, greedy methods, alternating minimization, and non-convex gradient descent, that have been key non-convex approaches to tackle the large-scale learning problems. For each theme, we focus on a specific problem and design an algorithm based on the designing ideas. We …

    texas Repository record for Efficient non-convex algorithms for large-scale learning problems (opens in a new tab)

  11. An efficient algorithm for total variation regularization with applications to the single pixel camera and compressive sensing

    … the ideas of the augmented Lagrangian method and alternating minimization to solve subproblems, I develop an efficient and robust algorithm called TVAL3. TVAL3 is compared favorably with other widely used algorithms in terms of reconstruction speed and quality. Convincing numerical results are …

    rice Repository record for An efficient algorithm for total variation regularization with applications to the single pixel camera and compressive sensing (opens in a new tab)

  12. Study of Optimal Design Problems by the Regularity Method in Nonlinear Equations

    … algorithms, a feasible directions method and an alternating minimization method. We show the convergence for both of them and we provide an estimate for the error. When p > 2 both methods are only well defined for a finitedimensional approximation, because of this we also study the difference …

    sevilla Repository record for Study of Optimal Design Problems by the Regularity Method in Nonlinear Equations (opens in a new tab)

  13. Studies on DOA estimation in the presence of multipath in a frequency hopping system

    … and DOA estimation and introduce the associated Alternating Minimization algorithm. Finally, we present some simulation results to illustrate the performance of the technique and give some concluding remarks.In addition, we also briefly introduce a new method for joint time-delay and DOA …

    nus Repository record for Studies on DOA estimation in the presence of multipath in a frequency hopping system (opens in a new tab) Download file for Studies on DOA estimation in the presence of multipath in a frequency hopping system (opens in a new tab)

  14. Deblurring with Framelets in the Sparse Analysis Setting

    … embedding the proposed non-blind algorithm in an alternating minimization scheme and imposing additional constraints in order to deal with the challenging non-convex nature of the blind deblurring problem. Numerical experiments are performed on artificially and naturally blurred images, and both …

    uvic Repository record for Deblurring with Framelets in the Sparse Analysis Setting (opens in a new tab)

  15. E-CSKPD: A Frequentist Framework for Multi-Modal High-Order Tensor Regression

    … consistency and linear convergence of the alternating-minimization algorithm up to the statistical precision limit determined by sample size and model complexity.

    ucf Repository record for E-CSKPD: A Frequentist Framework for Multi-Modal High-Order Tensor Regression (opens in a new tab)

  16. Provable non-convex optimization for learning parametric models

    … search heuristics, such as gradient descent or alternating minimization, are guaranteed to converge to the global optima if initialized properly. Furthermore, we show that spectral methods can efficiently initialize the parameters such that they fall into the basin of attraction. Experiments on …

    texas Repository record for Provable non-convex optimization for learning parametric models (opens in a new tab)

  17. Tomographic reconstruction with adaptive sparsifying transforms

    … an adaptive sparsifying transform penalty. An alternating minimization approach is used to jointly reconstruct the image while learning a sparsifying transform adapted to the particular image being reconstructed. The Alternating Direction Method of Multipliers is used to provide a …

    uiuc Repository record for Tomographic reconstruction with adaptive sparsifying transforms (opens in a new tab)

  18. Tensor Decompositions and Rank Approximation of Tensors with Applications

    … problem and estimate the rank via $\ell_1$ minimization. We propose a numerical iterative method based on the proximal alternating minimization algorithm and discuss the required conditions for the global convergence of the algorithm. The performance of our algorithm is tested on several …

    uab Repository record for Tensor Decompositions and Rank Approximation of Tensors with Applications (opens in a new tab)

  19. Policy evaluation in offline reinforcement learning with low-rank structure

    … and robust low-rank matrix completion algorithm Alternating Gradient Descent minimization (AltGDmin). First, we discuss the simple and effective AltGDmin algorithm, and show its performance by comparing with Altmin in the noise-free and noisy setting. Secondly, we simulate an uniform low-rank MDP …

    iastate Repository record for Policy evaluation in offline reinforcement learning with low-rank structure (opens in a new tab)

  20. Recent Developments on Matrix Completion

    … on nuclear norm relaxation and regularization or alternating minimization. Comprehensive simulation results on simulated data sets will also be provided to corroborate our results. Finally, in the last chapter, we will give a brief introduction the package MatrixCompletion.jl, which contains all …

    cornell Repository record for Recent Developments on Matrix Completion (opens in a new tab)

Page 1 of 3