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 172 for “"Alternating Direction Method of Multipliers"”.

  1. Generalizations of the Alternating Direction Method of Multipliers for Large-Scale and Distributed Optimization

    … "Big Data", efficient and scalable computational methods are highly desirable to cope with the size of the data. The alternating direction method of multipliers (ADMM), as a versatile algorithmic tool, has proven to be very effective at solving many large-scale and structured optimization …

    rice Repository record for Generalizations of the Alternating Direction Method of Multipliers for Large-Scale and Distributed Optimization (opens in a new tab)

  2. Alternating Direction Method of Multipliers for Convex Optimization Problems with Tensorflow Using GPU Computing

    … optimization algorithms and computation methods have long been a focal point of study, aiming to reduce the complexity of high-dimensional problems and minimize computation costs. This research applies the optimization algorithm, alternating direction method of multipliers (ADMM), to …

    tamu Repository record for Alternating Direction Method of Multipliers for Convex Optimization Problems with Tensorflow Using GPU Computing (opens in a new tab)

  3. AN INEXACT ALTERNATING DIRECTION METHOD OF MULTIPLIERS FOR CONVEX COMPOSITE CONIC PROGRAMMING WITH NONLINEAR CONSTRAINTS

    This thesis focuses on a class of convex composite conic optimization problems with nonlinear constraints. In order to obtain some guidance on solving the general nonlinearly constrained convex composite conic programming model, we compare the numerical performance of some existing first order …

    nus Repository record for AN INEXACT ALTERNATING DIRECTION METHOD OF MULTIPLIERS FOR CONVEX COMPOSITE CONIC PROGRAMMING WITH NONLINEAR CONSTRAINTS (opens in a new tab) Download file for AN INEXACT ALTERNATING DIRECTION METHOD OF MULTIPLIERS FOR CONVEX COMPOSITE CONIC PROGRAMMING WITH NONLINEAR CONSTRAINTS (opens in a new tab)

  4. Semi-Parametric Inference with Density Ratio Model Fitted to Distributed Data using Alternating Direction Method of Multipliers

    This thesis also develops methodologies for carrying out inference using the semi-parametric DRM in the presence of distributed data. Techniques were developed for carrying out the dual empirical likelihood ratio test, which allows for the testing of composite hypothesis about DRM model parameters. …

    carleton Repository record for Semi-Parametric Inference with Density Ratio Model Fitted to Distributed Data using Alternating Direction Method of Multipliers (opens in a new tab)

  5. Topics in trend filtering with Poisson loss

    Trend filtering is a nonparametric regression method that penalises divided differences of the underlying signal, yielding locally adaptive, piecewise polynomial estimators. Although its statistical and computational properties are well understood under Gaussian loss, the non-Gaussian …

    ubc Repository record for Topics in trend filtering with Poisson loss (opens in a new tab) Download PDF for Topics in trend filtering with Poisson loss (opens in a new tab)

  6. A Blueprint for Semidefinite Relaxations of Binary-Constrained Quadratic Programs Computing tight bounds on NP-hard problems using ADMM

    This thesis looks at the solution techniques of two NP-hard, large scale problems, the quadratic assignment problem, QAP, and the side chain positioning, SCP, problem. We summarize existing approaches from and look at the two problems in a unified way using a binary-constrained quadratic program, …

    waterloo Repository record for A Blueprint for Semidefinite Relaxations of Binary-Constrained Quadratic Programs Computing tight bounds on NP-hard problems using ADMM (opens in a new tab)

  7. Semidefinite Programming Relaxations of the Simplified Wasserstein Barycenter Problem: An ADMM Approach

    … Wasserstein Barycenter problem, the problem of picking k points each chosen from a distinct set of n points as to minimize the sum of distances to their barycenter, finds applications in various areas of data science. Despite the simple formulation, it is a hard computational problem. The …

    waterloo Repository record for Semidefinite Programming Relaxations of the Simplified Wasserstein Barycenter Problem: An ADMM Approach (opens in a new tab)

  8. Exploration of Nonconvex Solution Spaces via Operator Splitting Sequential Convex Programming

    Sequential convexification methods provide an efficient and reliable means of computing fea-sible trajectories in nonconvex solution spaces. However, a well-known limitation of these algorithms is that they are inherently local in nature, and typically converge to a solution in the neighborhood of …

    washington Repository record for Exploration of Nonconvex Solution Spaces via Operator Splitting Sequential Convex Programming (opens in a new tab)

  9. System identification via Nuclear norm regularization

    We study the subspace method for system identification, and look at algorithms that rely on nuclear norm regularization for solving this problem. We introduce our own algorithm for solving the problem, based on the alternating direction method of multipliers (ADMM). Our algorithm involves an …

    umn Repository record for System identification via Nuclear norm regularization (opens in a new tab)

  10. DNN Weight Compression Method with ADMM Framework

    … is a powerful technique evolved to the state-of-the-art technique for computer vision tasks. The "deep compression" is introduced to overcome the significant problem in memory- and computational-efficient. The basic pipeline of compression is the three-stage model including …

    tamu Repository record for DNN Weight Compression Method with ADMM Framework (opens in a new tab)

  11. Compression and enhancement of medical images and video

    This dissertation explores the advancement of medical imaging technologies through the development of innovative methodologies for medical image and video compression and super-resolution. The research focuses on improving the efficiency and quality of medical image compression by introducing an …

    greece Repository record for Compression and enhancement of medical images and video (opens in a new tab)

  12. STOCHASTIC AND RANDOMIZED ALGORITHMS FOR LARGE-SCALE OPTIMIZATION IN MACHINE LEARNING

    This thesis advances the state-of-the-art for two classes of optimization problems in machine learning. In the first part, we revisit the stochastic limited-memory Broyden-Fletcher-Goldfarb-Shanno (L-BFGS) algorithm for strongly convex smooth optimization. By proposing a new coordinate …

    nus Repository record for STOCHASTIC AND RANDOMIZED ALGORITHMS FOR LARGE-SCALE OPTIMIZATION IN MACHINE LEARNING (opens in a new tab) Download file for STOCHASTIC AND RANDOMIZED ALGORITHMS FOR LARGE-SCALE OPTIMIZATION IN MACHINE LEARNING (opens in a new tab)

  13. Piecewise Planar Image Restoration via Gradient Graph Laplacian Regularizer

    Images in various practical applications often exhibit Piecewise Planar (PWP) characteristics. Common issues such as noise, blur, and distortions arise from sensor limitations, transmission errors, and environmental factors like lighting and sensor quality. Despite advancements in image …

    york Repository record for Piecewise Planar Image Restoration via Gradient Graph Laplacian Regularizer (opens in a new tab)

  14. Sparsity-Promoting Estimator Design for Acceleration Sensor Placement in Civil Structures

    The scale of civil systems makes it impossible to measure all degrees of freedom. Therefore, a limited number of measurements are leveraged to obtain a full set of state estimates (e.g. displacement and velocity responses). Spatially sparse feedback, which limits the information and the number of …

    umn Repository record for Sparsity-Promoting Estimator Design for Acceleration Sensor Placement in Civil Structures (opens in a new tab)

  15. EFFICIENT MOTION CONTROL VIA ESTIMATION AND OPTIMIZATION FOR ROBOTIC MANIPULATION

    … efficient motion control schemes for high-degree-of-freedom robotic systems to achieve robust and safe manipulation. For high-accuracy trajectory tracking, we propose a robust control synthesis based on an unknown system dynamics estimator (USDE), which estimates all unknown disturbances without …

    nus Repository record for EFFICIENT MOTION CONTROL VIA ESTIMATION AND OPTIMIZATION FOR ROBOTIC MANIPULATION (opens in a new tab) Download file for EFFICIENT MOTION CONTROL VIA ESTIMATION AND OPTIMIZATION FOR ROBOTIC MANIPULATION (opens in a new tab)

  16. A SEMI-DEFINITE RELAXATION BRANCH-AND-BOUND ALGORITHM FOR BINARY INTEGER QUADRATIC PROBLEMS USING SCIPSUITE

    … a leading non-commercial branch-and-bound software using the SDPA solver to solve the semidefinite programming relaxation problem of each node. However, SDPA is severely limited by its capacity to solve large problems efficiently. We consider a symmetric Gauss-Seidel Alternating Direction …

    nus Repository record for A SEMI-DEFINITE RELAXATION BRANCH-AND-BOUND ALGORITHM FOR BINARY INTEGER QUADRATIC PROBLEMS USING SCIPSUITE (opens in a new tab) Download file for A SEMI-DEFINITE RELAXATION BRANCH-AND-BOUND ALGORITHM FOR BINARY INTEGER QUADRATIC PROBLEMS USING SCIPSUITE (opens in a new tab)

  17. ADMM Based Methods for Time-Domain Decomposition Formulations of Optimal Control Problems

    This thesis investigates alternating direction method of multipliers (ADMM)-based methods for time-domain decomposition (TDD) formulations of linear-quadratic partial differential equation (PDE)-constrained optimization problems. The solution of such optimization problems is computing time and …

    rice Repository record for ADMM Based Methods for Time-Domain Decomposition Formulations of Optimal Control Problems (opens in a new tab)

  18. Fast algorithm for joint unicast and multicast beamforming in large-scale systems

    … (MIMO) system with a large number of unicast users. We propose an alternating direction method of multipliers (ADMM)-based fast algorithm that efficiently obtains the beamforming solutions for unicast and multicast users to minimize the transmit power subject to quality-of-service …

    uoit Repository record for Fast algorithm for joint unicast and multicast beamforming in large-scale systems (opens in a new tab)

  19. Distributed online algorithms for energy management in smart grids

    … economic dispatch based on Subgradient method and Alternating Direction Method of Multipliers (ADMM), both designed to be agnostic with any initialization vector. The proposed distributed online solutions leverage a dynamic average consensus algorithm to track the time-variant linearly …

    utc Repository record for Distributed online algorithms for energy management in smart grids (opens in a new tab)

Page 1 of 9