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 57 for “"alternating optimization"”.
-
Alternating Optimization for the Dense Subgraph and Submatrix Problems
… expensive approaches such as convex optimization. We look at new heuristics to solve the Dense Submatrix problem as a model problem for clustering. We propose a new convex relaxation model for this problem, and then reformulate the problem as a non-convex quadratic program. We apply …
-
Alternating Optimization: Constrained Problems, Adversarial Networks, and Robust Models
… of modern models relies on solving difficult optimization problems that involve nonconvex, nondifferentiable objective functions and constraints, which is sometimes slow and often requires expertise to tune hyperparameters. While inference is much faster than training, it is often not fast …
-
Generalized Fuzzy c-Means Clustering
… based on a combination of techniques such as alternating optimization, bisection, and exhaustive search; implementing the optimization scheme in MATLAB; conducting numerical experiments to learn how the choices of m and p affect the clustering results.
-
Transceiver optimization for broadband cooperative wireless communication systems
… problem is transformed into an equivalent power optimization problem with scalar variables. An alternating optimization algorithm is devised to obtain the optimal solution for the source and relay power allocation. Thirdly, we study a robust transceiver design for multiuser broadband systems with …
-
Optimizing Degree-of-Control in Reconfigurable Intelligent Surfaces
… and pattern parameters on the RIS and propose an alternating optimization method that combines conventional approaches with Deep Reinforcement Learning (DRL) algorithms. We employ our proposed approach for bit allocation between phase and pattern parameters under DoC constraints. Our findings …
-
Estimation of surface-free data by curvelet-domain matched filtering and sparse inversion
… calculated from the upgoing wavefield using an alternating optimization procedure. EPSI hinges on a delicate interplay between surface-related multiples and pri- maries. Finite aperture and other imperfections may violate this relationship. In this thesis, we investigate how to make EPSI more …
-
Fast algorithm for joint unicast and multicast beamforming in large-scale systems
… 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 constraints. Utilizing the …
-
Bayesian Optimization for Image Segmentation, Texture Flow Estimation and Image Deblurring
… throughout this thesis is the use of a Bayesian optimization framework to solve each specific problem. In particular, we show how each of these problems can be formulated into one of a maximum a posterior (MAP) estimation, where the likelihood and prior probabilities are uniquely defined for each …
-
Study on the improvement of the FCM algorithm based on evolutionary algorithms
… an optimum solution very quickly, thanks to its alternating optimization (AO) strategy. However, this AO strategy cannot guarantee the solution is global optimal. Hence, FCM may produce some counterintuitive results. On the other hand, evolutionary algorithms (EAs) are good at finding global …
-
Computation of Achievable Rate in Pattern Recognition System
… general case. In this thesis, we present a new optimization algorithm associated with other algorithms in alternating optimization problems. This new algorithm will compute a bound of the achievable rate region in pattern recognition by solving the associated optimization problem. We show that …
-
A study of type-2 fuzzy clustering
… become too large or broad during the iterative alternating optimization procedure. We devise three dampening approaches to mitigate this problem. Vertical cut dampening, linear dampening, and reflection dampening are defined along with the experiments conducted on a synthetic dataset named the …
-
Maximum Entropy Sequential Quadratic Programming
Trajectory optimization (TO) plays a critical role across a broad spectrum of scientific and engineering fields, including robotics, energy and power systems, economics, and biomechanics. Through the lens of optimal control, TO often involves solving constrained optimization problems with a …
-
Performance analyses for large-scale antennas equipped two-way AF relaying and heterogeneous networks
… One is via a relaxed-constraints based alternating optimization (RAO) realized by efficient alternating optimization and relaxing non-convex constraints to convex ones. The other is via an unconstrained alternating optimization with normalization (UAON) implemented by introducing the …
-
Energy efficiency maximization for NOMA backscatter systems
… a suboptimal solution for this problem, we use alternating optimization technique and decompose the problem into two subproblems. The subproblems are solved by using fractional programming, Dinkelbach’s algorithm, and successive convex approximation method. We further extend the average energy …
-
Low-overhead Kronecker-based intelligent reflective surfaces for next-generation wireless networks
This thesis investigates the optimization of Intelligent Reflective Surfaces (IRSs) in wireless communication networks, focusing on reducing control overhead and enhancing network performance. A key contribution of this work is the introduction of a Kronecker-based phase shift model, which …
-
Exploring Efficiency in Split Federated Learning under System Heterogeneity: A Study of System Synchronization and Resource Optimization
… At its core lies the Collaborative Relay Optimization Mechanism (CROM), in which efficient devices act as computational relays by executing intermediate model segments on behalf of bottleneck devices, thereby achieving balanced workload distribution. To minimize end-to-end training …
-
Lens-type redirective reconfigurable intelligent surfaces for multi-user MIMO communications
… the receive scaling factor. A joint non-convex optimization problem is formulated under the minimum mean-square error (MMSE) criterion with the aim to maximize the spectral efficiency of each user. In the single-cell scenario, the optimum active precoding matrix at the multi-antenna BS and the …
-
Optimizing multiuser MIMO for access point cooperation in dense wireless networks
… A scalable algorithm that performs a combined optimization procedure is proposed to determine the user selection and MIMO weights. Third, we study the fair and high-throughput scheduling problem by formally specifying an optimization problem. Two algorithms are proposed to solve the problem …
-
Harnessing Reconfigurable Intelligent Surfaces For Next-Gen Wireless Networks: Enhancing Efficiency, Reliability, and Security
… (MISO) configuration. To tackle the non-convex optimization problem, an alternating optimization framework based on successive convex approximation (SCA) is developed, achieving up to a 20.3% improvement in network sum rate. Additionally, to simplify real-time decision-making, a deep …
-
ENHANCING PHYSICAL-LAYER SECURITY IN WIRELESS POWERED COMMUNICATION NETWORK: CHALLENGES AND OPPORTUNITIES
… dual decomposition-based optimal solutions and alternating optimization-based suboptimal solutions. <br/>On the other hand, under circumstances where some ERs are trustful, their self-sustaining features can also be favourable to providing PLS by means of cooperative jamming (CJ). In the second …
Page 1 of 3