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 225 for “"Semidefinite Programming"”.

  1. Model Reduction Using Semidefinite Programming

    … The reduced models are computed using semidefinite programming. Two ways of imposing the stability constraint are considered. However, both approaches add a positivity constraint to the program. The input to the algorithms is a number of frequency response samples of the original model. …

    lund Repository record for Model Reduction Using Semidefinite Programming (opens in a new tab) Download PDF for Model Reduction Using Semidefinite Programming (opens in a new tab)

  2. Sensitivity analysis of semidefinite programming problems

    In this thesis, we construct a parametrized model for the SDP problem and analyze the disturbance of the parameters. We discuss conditions for Lipschitz properties, namely: calmness, upper regularity, and strong regularity of non- linear SDP problems at feasible and stationary points, and present …

    zurich

  3. Digital Filter Design Using Semidefinite Programming

    … which in turn can be represented by a positive semidefinite matrix known as Gram matrix representation. This allows us to utilize the framework of linear conic optimization, especially semidefinite programming to obtain filters based on given specifications and optimal with respect to some …

    chalmers Repository record for Digital Filter Design Using Semidefinite Programming (opens in a new tab)

  4. Infeasible potential reduction algorithms for semidefinite programming

    … POTENTIAL REDUCTION ALGORITHMS FOR PRIMAL SEMIDEFINITE PROGRAMMING PROBLEMS THAT SIMULTANEOUSLY SEEK FEASIBILITY AND OPTIMALITY. THE ALGORITHMS ARE BASED ON THOSE IN [2] AND [13] FOR LINEAR PROGRAMMING. WE ANALYZE THE CONVERGENCE OF THE ALGORITHMS, AND IMPLEMENT THEM TO COMPARE THEIR …

    nus Repository record for Infeasible potential reduction algorithms for semidefinite programming (opens in a new tab) Download file for Infeasible potential reduction algorithms for semidefinite programming (opens in a new tab)

  5. SECURITY OF QUANTUM CRYPTOGRAPHY VIA SEMIDEFINITE PROGRAMMING

    … characterisations. Our frameworks are based on semidefinite programming which makes them more computationally efficient than existing numerical frameworks. In the first part of the thesis, we present a method to analyse the security of protocols with uncharacterised measurements. We give general …

    nus Repository record for SECURITY OF QUANTUM CRYPTOGRAPHY VIA SEMIDEFINITE PROGRAMMING (opens in a new tab) Download file for SECURITY OF QUANTUM CRYPTOGRAPHY VIA SEMIDEFINITE PROGRAMMING (opens in a new tab)

  6. Applications of Semidefinite Programming in Quantum Cryptography

    … coin-flipping protocols can be analyzed using semidefinite programming. This lead to his result that one party can force a desired coin-flip outcome with probability at least 1/√2. We give sufficient background in quantum computing and semidefinite programming to understand Kitaev's …

    waterloo Repository record for Applications of Semidefinite Programming in Quantum Cryptography (opens in a new tab)

  7. Model Order Reduction Based on Semidefinite Programming

    … problems. Since all the methods are based on semidefinite programming, adding new constraints is a matter of formulating a constraint as a semidefinite one. A number of extensions are presented, which illustrate the power of the approach. Properties of the methods are discussed throughout the …

    lund Repository record for Model Order Reduction Based on Semidefinite Programming (opens in a new tab) Download PDF for Model Order Reduction Based on Semidefinite Programming (opens in a new tab)

  8. On alternating direction methods for monotropic semidefinite programming

    … a new optimization model called monotropic semidefinite programming. This model extends the monotropic programming model from vectors to matrices on one hand, and the linear semidefinite programming model to the convex case on the other hand.We propose several modified alternating direction …

    nus Repository record for On alternating direction methods for monotropic semidefinite programming (opens in a new tab) Download file for On alternating direction methods for monotropic semidefinite programming (opens in a new tab)

  9. PERFORMANCE ANALYSIS OF OPTIMIZATION ALGORITHMS USING SEMIDEFINITE PROGRAMMING

    … which allow us to introduce a hierarchy of semidefinite programs that produces tighter convergence bounds at higher levels of the hierarchy. With this framework, we recover in a unified manner known convergence results for four popular first-order algorithms, and derive new convergence …

    nus Repository record for PERFORMANCE ANALYSIS OF OPTIMIZATION ALGORITHMS USING SEMIDEFINITE PROGRAMMING (opens in a new tab) Download file for PERFORMANCE ANALYSIS OF OPTIMIZATION ALGORITHMS USING SEMIDEFINITE PROGRAMMING (opens in a new tab)

  10. Numerical Stability in Linear Programming and Semidefinite Programming

    … for interior-point methods applied to Linear Programming, LP, and Semidefinite Programming, SDP. We analyze the difficulties inherent in current methods and present robust algorithms. <br /><br /> We start with the error bound analysis of the search directions for the normal equation approach …

    waterloo Repository record for Numerical Stability in Linear Programming and Semidefinite Programming (opens in a new tab)

  11. Error Bounds and Singularity Degree in Semidefinite Programming

    … forward error for spectrahedra (optimal sets of semidefinite programs) in terms of backward error. His bound creates a hierarchy among spectrahedra that is based on singularity degree, an integer between 0 and n-1, derived from facial reduction. For problems with small singularity degree, forward …

    waterloo Repository record for Error Bounds and Singularity Degree in Semidefinite Programming (opens in a new tab)

  12. A Semidefinite Programming Model for the Facility Layout Problem

    … This thesis presents a completely mixed integer semidefinite programming (MISDP) model for the continuous facility layout problem. To begin we describe the problem in detail; discuss the conditions required for a feasible layout; and define quaternary variables. These variables are the basis of …

    waterloo Repository record for A Semidefinite Programming Model for the Facility Layout Problem (opens in a new tab)

  13. Semidefinite Programming Bounds for Energy Minimization on the Sphere

    … are investigated and solved using linear and semidefinite programming bounds, building on the existing literature on packing and kissing number problems for spherical codes.

    umn Repository record for Semidefinite Programming Bounds for Energy Minimization on the Sphere (opens in a new tab)

  14. Some global relaxation methods for quadratic and semidefinite programming

    Quadratic programming and semidefinite programming are vital tools in discrete and continuous optimization, with broad applications. A major challenge is to develop methodologies and algorithms to solve instances with special structures. For this purpose, we study some global relaxation techniques …

    gatech Repository record for Some global relaxation methods for quadratic and semidefinite programming (opens in a new tab)

  15. Cooperative Positioning in Wireless Sensor Networks Using Semidefinite Programming

    … as a recent and trending technology and semidefinite programming (SDP) as a powerful tool in our research. Cooperative localization has several advantages over the traditional noncooperative localization in terms of positioning accuracy and localizability. Cooperation is also highly …

    vt Repository record for Cooperative Positioning in Wireless Sensor Networks Using Semidefinite Programming (opens in a new tab)

  16. A Primal-Dual Framework for Approximation Algorithms using Semidefinite Programming

    … Within combinatorial optimization, linear programming (LP) duality crucially allows for polynomial-sized proofs of optimality, guiding the design of several algorithms. This work exploits a set of alternative formulations of convex duality to design primal-dual approximation algorithms for …

    waterloo Repository record for A Primal-Dual Framework for Approximation Algorithms using Semidefinite Programming (opens in a new tab)

  17. Integrality Gaps for Strong Linear Programming and Semidefinite Programming Relaxations

    … model of computation. Algorithms based on Linear Programming (LP) and Semidefinite Programming (SDP) relaxations are among the most prominent models of computation. The related and common measure of efficiency is the integrality gap, which sets the limitations of the associated algorithmic …

    toronto-retro Repository record for Integrality Gaps for Strong Linear Programming and Semidefinite Programming Relaxations (opens in a new tab)

Page 1 of 12