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 3 of 3 for “"Copositive programming"”.

  1. Copositive programming approaches for robust optimization and Löwner-John ellipsoid problems

    This thesis primarily focuses on studying the copositive programming reformulations of difficult optimization problems, using them to approximate the original problem, and comparing the performance of the resulting approximations with other approximation schemes. We first study the robust quadratic …

    texas Repository record for Copositive programming approaches for robust optimization and Löwner-John ellipsoid problems (opens in a new tab)

  2. Optimization Models and Algorithms for Nonconvex Planning, Pricing and Operational Problems in Power Systems and Energy Markets

    … energy market and game theory problems using copositive programming. It was shown that a nonconvex mixed-binary quadratic program can be reformulated as a convex program, which has strong duality under mild conditions via copositive programming. Through this (duality) perspective, we propose a …

    toronto-retro Repository record for Optimization Models and Algorithms for Nonconvex Planning, Pricing and Operational Problems in Power Systems and Energy Markets (opens in a new tab)

  3. The Complexity of Extended Formulations

    … extended formulation, since semidefinite programming generalizes linear programming. We show that the answer is no if the formulation is also required to be symmetric. Put simply, the matching problem does not have a small symmetric semidefinite extended formulation. We next consider …

    gatech Repository record for The Complexity of Extended Formulations (opens in a new tab)