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 11 of 11 for “"block coordinate descent method"”.

  1. Convergence analysis of the approximate proximal splitting method for non-smooth convex optimization

    … class of approximate proximal splitting (APS) methods for solving such minimization problems. Methods in the APS class include many well-known algorithms such as the proximal splitting method (PSM), the block coordinate descent method (BCD) and the approximate gradient projection methods for …

    umn Repository record for Convergence analysis of the approximate proximal splitting method for non-smooth convex optimization (opens in a new tab)

  2. Factoring over probability simplices : from theory to applications

    … Algorithmically, we develop a novel rescaled block coordinate descent method that efficiently handles simplex constraints while maintaining iterate bound- edness—a key challenge in constrained NMF. By exploiting the semialgebraic structure of our objectives through the Kurdyka-Łojasiewicz (KL) …

    ubc Repository record for Factoring over probability simplices : from theory to applications (opens in a new tab) Download PDF for Factoring over probability simplices : from theory to applications (opens in a new tab)

  3. Dimensionality reduction for solving large scale inverse problems with PDE constraints through simultaneous source method

    … As a result, various dimensionality reduction methods have been proposed to reduce the number of PDE solves. This work builds on a type of dimensionality method called the Simultaneous Source (SS) method. This method relies on random sampling and the stochastic trace estimator to reduce the …

    ubc Repository record for Dimensionality reduction for solving large scale inverse problems with PDE constraints through simultaneous source method (opens in a new tab) Download PDF for Dimensionality reduction for solving large scale inverse problems with PDE constraints through simultaneous source method (opens in a new tab)

  4. Analyzing intentions from big data traces of human activities

    … objectives, we design an accelerated stochastic block coordinate descent method with optimal sampling; for optimizing non-strongly convex objectives, we design a stochastic variance reduced alternating direction method of multipliers with the doubling-trick. Inevitably, human activities are …

    uiuc Repository record for Analyzing intentions from big data traces of human activities (opens in a new tab)

  5. Scalable Optimization Methods for Machine Learning: Structures, Properties and Applications

    … performance limits on traditional state-of-art methods. In this thesis, we conduct a systematic study on scalable optimization methods. Our investigations mainly cover three aspects: the role of special structures in the models, convergence properties of algorithms, and applications in machine …

    umn Repository record for Scalable Optimization Methods for Machine Learning: Structures, Properties and Applications (opens in a new tab)

  6. Secure Wireless Communication with Intelligent Reflecting Surfaces

    … phase shifts of the IRS elements. We examine two methods: (1) Method 1, which directly optimizes the secrecy rate as the objective function under the assumption that all channel state information (CSI) is available, and (2) Method 2, which aims in maximizing the rate for Bob when Eve's CSI is …

    mississippi Repository record for Secure Wireless Communication with Intelligent Reflecting Surfaces (opens in a new tab)

  7. Unmanned Aerial Vehicles and Edge Computing in Wireless Networks

    … ground base station (BS) and mobile users are blocked due to obstacles in the urban environment. SARIS assists the BS in reflecting the signals to randomly distributed mobile users. The results show that the proposed SARIS network significantly improves the weighted sum-rate for ground users, …

    vt Repository record for Unmanned Aerial Vehicles and Edge Computing in Wireless Networks (opens in a new tab)

  8. Hybrid Beamforming Design for Millimeter Wave Massive MIMO Communications

    … channel decomposition, using the projected block coordinate descent method. The digital precoder and combiner are obtained from the optimal SVD-based solution for the single-user case and the regularized channel diagonalization method for the multi-user case. Simulation results have …

    concordia Download PDF for Hybrid Beamforming Design for Millimeter Wave Massive MIMO Communications (opens in a new tab)

  9. Mathematical Optimization for Engineering Design Problems

    Applications in engineering design and the material sciences motivate the development of optimization theory in a manner that additionally draws from other branches of mathematics including the functional, complex, and numerical analyses. The first contribution, motivated by an automotive design …

    clemson Repository record for Mathematical Optimization for Engineering Design Problems (opens in a new tab)