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 5 of 5 for “"Semidefinite Programing"”.

  1. Optimal Success Bounds for Single Query Quantum Algorithms Computing the General SUM Problem

    … general sum case. The problem is expressed as a semidefinite program, given for all instances. The instance for strings of length two and algorithms making a single query is solved and a proof is given. Significant insight into the multi-query case is also provided.

    waterloo Repository record for Optimal Success Bounds for Single Query Quantum Algorithms Computing the General SUM Problem (opens in a new tab)

  2. Convex Optimization via Domain-Driven Barriers and Primal-Dual Interior-Point Methods

    … (LP), second-order cone programming (SOCP), and semidefinite programing (SDP)). However, many other highly demanded convex optimization problems lack comparable solvers. To close this gap, we have introduced a general optimization setup, called \emph{Domain-Driven}, that covers many interesting …

    waterloo Repository record for Convex Optimization via Domain-Driven Barriers and Primal-Dual Interior-Point Methods (opens in a new tab)

  3. Sparsity, Randomness and Convexity in Applied Algebraic Geometry

    … approximation can be computed by linear programing on the real BSS machine. The second problem is to study the ratio of sums of squares polynomials inside the set of nonnegative polynomials. Our focus is on the effect of fixed monomial structure to the ratio of these two sets. We study …

    tamu Repository record for Sparsity, Randomness and Convexity in Applied Algebraic Geometry (opens in a new tab)

  4. Isometry and convexity in dimensionality reduction

    … the umbrella of Kernel PCA. MVU is cast as a Semidefinite Program, a modern convex nonlinear optimization algorithm, that offers more flexibility and power compared to iv KPCA. Although MVU and NMF seem to be two disconnected problems, we show that there is a connection between them. Both are …

    gatech Repository record for Isometry and convexity in dimensionality reduction (opens in a new tab)

  5. Block-decomposition and accelerated gradient methods for large-scale convex optimization

    … exact BD first-order methods for solving conic semidefinite programming (SDP) problems and the more general problem that minimizes the sum of a convex differentiable function with Lipschitz continuous gradient, and two other proper closed convex (possibly, nonsmooth) functions. More …

    gatech Repository record for Block-decomposition and accelerated gradient methods for large-scale convex optimization (opens in a new tab)