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

  1. Spectral methods and computational trade-offs in high-dimensional statistical inference

    … and their sample versions. We then propose a semi-definite programming algorithm for the sparse principal component analysis (PCA) problem, and analyse its theoretical performance using the perturbation bounds we derived earlier. It turns out that the parameter regime in which our estimator is …

    cambridge Repository record for Spectral methods and computational trade-offs in high-dimensional statistical inference (opens in a new tab)

  2. Robust estimation, regression and ranking with applications in portfolio optimization

    … linear regression using special mathematical programming models and semi-definite programming (SDP). In the robust covariance estimation problem, we design an optimization model with a loss function on the weighted Mahalanobis distances and show that the problem is equivalent to a system of …

    mit Repository record for Robust estimation, regression and ranking with applications in portfolio optimization (opens in a new tab)

  3. Characterizing and measuring properties of continuous-variable quantum states

    … of matrix product states, tensor networks, semi-definite programming, and matrix analysis.

    potsdam-diss Repository record for Characterizing and measuring properties of continuous-variable quantum states (opens in a new tab)

  4. 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

    uiuc Repository record for SDP-CROWN: Efficient bound propagation for neural network verification with tightness of semidefinite programming (opens in a new tab)

  5. Multi-antenna relay network beamforming design for multiuser peer-to-peer communications.

    … a sequence of transformations, we obtain a semi-closed form solution which can be determined by solving an efficient semi-definite programming problem. We also consider the semi-definite relaxation (SDR) approach. Compared with this SDR approach, the proposed solution has significantly lower …

    uoit Repository record for Multi-antenna relay network beamforming design for multiuser peer-to-peer communications. (opens in a new tab)

  6. Locally Adaptive Protocols for Quantum State Discrimination

    … = \rho_{k}]$. In the general case, although semi-definite programming offers a way to numerically approximate the optimal solution~\cite{Eldar_Semidefinite2}, a closed-form analytical solution for the optimal measurement is not known. </p><p>Additionally, when the quantum system is large and …

    duke Repository record for Locally Adaptive Protocols for Quantum State Discrimination (opens in a new tab)

  7. 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)