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 14 of 14 for “"Semi-definite program"”.

  1. Synthesizing Robust Networks for Engineering Applications with Resource Constraints

    … network synthesis problems is a Mixed Integer Semi-Definite Program (MISDP), which was recently shown to be a NP-hard problem. There has not been any systematic procedure in the literature to solve this problem. This dissertation is aimed at addressing this void in the literature. The novel …

    tamu Repository record for Synthesizing Robust Networks for Engineering Applications with Resource Constraints (opens in a new tab)

  2. Information Design in Linear-Quadratic-Gaussian Games

    … (LQG game), the information design problem is a semi-definite program (SDP). The doctoral research is pursued in three thrusts: analytical and numerical characterization of optimal information design to maximize social welfare and the agreement among players’ action in LQG games, analysis of …

    tamu Repository record for Information Design in Linear-Quadratic-Gaussian Games (opens in a new tab)

  3. Control Studies of DFIG based Wind Power Systems

    … the literature. Both problems are formulated as semi-definite program (SDP) optimization problems that can be solved efficiently with existing software tools. And simulation results are provided to demonstrate the validity of the proposed method.</p>

    utk-theses Repository record for Control Studies of DFIG based Wind Power Systems (opens in a new tab)

  4. Matrix Minor-based Upper Bounding Formulations for Designing Weighted Networks with Maximum Algebraic Connectivity

    … This problem can be posed as a Mixed-Integer Semi-Definite Program (MISDP). Since it is a computationally difficult problem, developing formulations with tighter relaxations for the MISDP are useful as they can provide tight bounds, which in turn determine the computational time required by …

    tamu Repository record for Matrix Minor-based Upper Bounding Formulations for Designing Weighted Networks with Maximum Algebraic Connectivity (opens in a new tab)

  5. A Study of Reconfigurable Antennas as a Solution for Efficiency, Robustness, and Security of Wireless Systems

    … is solved by casting it into the form of a semi-definite program, which can be solved with convex optimization. The method is general and can be applied to an arbitrary array topology with or without antenna mutual-coupling. Due to complexity of the problem, initial attention has been …

    byu Repository record for A Study of Reconfigurable Antennas as a Solution for Efficiency, Robustness, and Security of Wireless Systems (opens in a new tab) Download PDF for A Study of Reconfigurable Antennas as a Solution for Efficiency, Robustness, and Security of Wireless Systems (opens in a new tab)

  6. Belief shaping in noncooperative communication and control systems through strategic signaling

    … settings. We formulate an equivalent semi-definite program instead of addressing this problem over the original infinite-dimensional strategy spaces. We show that the optimal signaling strategies are linear within the general class of measurable policies when the agents have different …

    uiuc Repository record for Belief shaping in noncooperative communication and control systems through strategic signaling (opens in a new tab)

  7. Convex optimization for covariance steering and density control

    … it as a difference of convex (DC) functions program. A sufficient condition for the convexity of this problem is also provided. The CS problem with Wasserstein terminal cost is formulated as a convex semi-definite program (SDP) by employing randomized state feedback policies. It is …

    texas Repository record for Convex optimization for covariance steering and density control (opens in a new tab)

  8. Unique Games Conjecture : the Boolean Hypercube and connections to graph lifts

    … the study of the behaviour of the standard semi-definite program on the Hypercube. We construct an almost optimal integrality gap instance on the Hypercube for the Goemans-Williamson semidefinite program (SDP) for Max-2-LIN(\Z_2). We conjecture that augmenting the SDP with triangle …

    uiuc Repository record for Unique Games Conjecture : the Boolean Hypercube and connections to graph lifts (opens in a new tab)

  9. Camera Planning and Fusion in a Heterogeneous Camera Network

    … a new unified framework based on binary integer programming (BIP) to relate the network design parameters and the performance goals of a variety of camera network tasks. Most of the BIP formulations are NP hard problems and various approximate algorithms have been proposed in the literature. In …

    uky-thes Repository record for Camera Planning and Fusion in a Heterogeneous Camera Network (opens in a new tab)

  10. Optimal Robust Sparse Networks: Algorithms for Maximizing Algebraic Connectivity in Robotic Applications

    … It can be formulated as a Mixed-Integer Semi-Definite Program (MISDP). Due to the computational challenges associated with this problem, this research focuses on developing formulations that provide tighter relaxations for the MISDP and efficient heuristic algorithms, facilitating their …

    tamu Repository record for Optimal Robust Sparse Networks: Algorithms for Maximizing Algebraic Connectivity in Robotic Applications (opens in a new tab)

  11. DISTRIBUTIONALLY ROBUST STATE ESTIMATION

    This thesis proposes a distributionally robust state estimation framework for linear systems subject to parameter uncertainties and measurement outliers. It utilizes a family of distributions near the nominal one to implicitly describe the uncertainties and outliers, and the robust state estimation …

    nus Repository record for DISTRIBUTIONALLY ROBUST STATE ESTIMATION (opens in a new tab) Download file for DISTRIBUTIONALLY ROBUST STATE ESTIMATION (opens in a new tab)

  12. Supercapacitor modelling, analysis and design

    … is expressed as the solution to a convex semi-definite program, and so can be efficiently computed. The supercapacitor model was a particular example of the class of nonlinear systems considered, with the inspiration behind this work being the desire to obtain less conservative bounds for …

    oxford Repository record for Supercapacitor modelling, analysis and design (opens in a new tab)

  13. Theoretical foundations for efficient clustering

    Clustering aims to group together data instances which are similar while simultaneously separating the dissimilar instances. The task of clustering is challenging due to many factors. The most well-studied is the high computational cost. The clustering task can be viewed as an optimization problem …

    waterloo Repository record for Theoretical foundations for efficient clustering (opens in a new tab)