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 63 for “"Semi-definite programming"”.
-
Constrained Quaternion Attitude Control of Satellites via \\Semi‑Definite Programming
… a hybrid control framework that leverages semi-definite programming (SDP) to generate constraint-compliant, globally optimal attitude trajectories offline, integrating keep-in/out cones and actuator bounds via linear matrix inequalities (LMIs). A quaternion-feedback PD regulator then …
-
Design of two-dimensional non-separable filters using semi-definite programming
… filters, such as flatness constraints. Recently, semi-definite programming (SDP) based filter design methods have been of great interest in the research because a large class of filter designs can be cast into SDP problems which can be efficiently solved by available SDP tools. This thesis focuses …
-
Globally optimal spatial estimation in robotics via trace-constrained semi-definite programming
… globally optimal solutions. Recent advances in semi-definite relaxations have shown promise in achieving globally and certifiably optimal solutions; however, their practical performance critically depends on recovering rank-1 solutions from relaxed formulations, which remains a challenging task. …
-
Diamond-shaped 2-dimentional digital FIR filters with high performance and low complexity
… to the interpolation step. In this study, the semi-definite programming as a tool, is adopted to design non-separable four-fold symmetric 2-D digital filters and it will be shown that unlike previously proposed semi-definite programming based approaches, this approach is advantageous due to the …
-
Machine learning-assisted CRAN design with hybrid RF/FSO and full-duplex self-backhauling
… intractable and approximate it with a semi-definite programming that can be effectively solved by alternating convex optimization. We also employed Compute Canada computational resources for solving mentioned semi-definite programming. The computational complexity of the proposed …
-
ON SOME OPTIMISATION PROBLEMS ARISING FROM QUANTUM COMPUTING
… for contextuality, combined with tools from semi-definite programming, to establish new robust self-testing results.
-
Projection algorithms for conic programming with applications in compressed sensing
Convex conic programming is a general optimization model which includes linear, second-order-cone and semi-definite programming. Many of these programs can be solved via interior-point methods, yet the high demands on memory and computation can make these Newton-based algorithms impractical for …
-
Volumes of certain loci of polynomials and their applicatoins
… latter problem is now known to be reducible to a semi-definite programming (SDP) computation that is much faster than classical algebraic methods, thus enabling new speed-ups in algebraic optimization. However, exactly how often nonnegative polynomials are in fact sums of squares of polynomials …
-
Graphs, Simplicial Complexes and Beyond: Topological Tools for Multi-agent Coordination
… of software tools of computational homology and semi-definite programming. Finally, several open problems and areas of further research have been identified.
-
Optimization methods for side-chain positioning and macromolecular docking
… optimization algorithm based on Subspace Semi-Definite programming-based Underestimation (SSDU), which aims to solve protein docking and protein structure prediction. SSDU is based on underestimating the binding energy function in a permissive subspace of the space of rigid-body motions. …
-
Some contributions to dimensionality reduction
… explore the dimensionality reduction method for semi-supervised classification via the idea of mixed label propagation in which we attempt to find the best one dimensional embedding of the data in which data points in different classes can be well separated and the class labels are obtained by …
-
Model-Based Acquisition for Compressive Sensing & Imaging
… based on manifold learning are designed via semi-definite programming. These secant patterns turn out to be better in object classification over those learned from PCA. Both methods considerably decrease the number of required measurements for each task when compared with the purely random …
-
Further developments of Multidimensional Scaling via Euclidean Distance Matrix Optimization
… for solving MDS problems, compared with the semi-definite programming (SDP) approach and majorization method SMACOF, Euclidean distance matrix (EDM) optimization is proved to be numerically outstanding. This thesis aims to develop the MDS in different directions via EDM optimization. Firstly, …
-
Energy-aware and RIS-assisted communications in UAV-based wireless networks
… STAR-RIS shifts, and UAV beamforming using semi-definite programming, integer relaxation, and convex approximation, showing significant performance gains and enhancing UAV efficiency.
-
Study of protein-DNA interaction using new generation data
… in a mixture model. Last but not least, a semi-definite programming (SDP) based algorithm called ChromSDE is developed to recover the correct 3D chromosome structure using Hi-C data. In summary, the methods developed in this thesis have unlocked the potential provided by the new generation …
-
Searching for Optimal Caterpillars in General and Bounded Treewidth Graphs
… a graph. Then we introduce a quadratic integer programming formulation for the MSCP. By using the Gomory cutting method iteratively, we show that one can find a near optimal solution. We then show that our integer programming formulation can be transformed to a semi-definite programming problem. …
-
Robust Beamforming for OFDM Modulated Two-Way MIMO Relay Network
… problem, and it is next relaxed to a semi-definite programming (SDP) problem by utilizing the S-procedure and rank-one relaxation. This robust beamforming optimization algorithm is further validated in a MATLAB-based orthogonal frequency-division multiplexing (OFDM) MIMO two-way relay …
-
SDP-CROWN: Efficient bound propagation for neural network verification with tightness of semidefinite programming
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-19 without embargo terms
-
Low rank representations of matrices using nuclear norm heuristics
… to the graph embedding problem. More generally, semi-definite programming, convex optimization, and the nuclear norm heuristic are applied to the graph embedding problem in order to extract invariants such as the chromatic number, Rn embeddability, and Borsuk-embeddability. In addition, we apply …
-
Quantum meets optimization and machine learning
… classical algorithms for solving semi-definite programming (SDP), Fourier sensing, dynamic distance estimation, etc. Our classical results are closely intertwined with quantum computing. Some of them serve as stepping stones to new quantum algorithms, while others are motivated by …
Page 1 of 4