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 4 of 4 for “"Integer conic programming"”.

  1. MIXED INTEGER CONIC PROGRAMMING FORMULATION OF DISTRIBUTION OPTIMAL POWER FLOW AND UNIT COMMITMENT PROBLEMS

    This work proposes a Mixed Integer Second Order Cone Programming (MISOCP) model for Distribution Optimal Power Flow (DOPF) by incorporating conic model of voltage control through a Load Tap Changer (LTC) as discrete control. A novel algorithm, Sequential Bound Tightening Algorithm (SBTA), is also …

    mtu Repository record for MIXED INTEGER CONIC PROGRAMMING FORMULATION OF DISTRIBUTION OPTIMAL POWER FLOW AND UNIT COMMITMENT PROBLEMS (opens in a new tab)

  2. Efficient numerical algorithms for large-scale conic optimization

    <p><em>Conic optimization</em> has been widely used in many areas, such as machine learning, image processing and automatic control. It usually relies on iterative algorithms to find the optimum numerically. Compared to linear programming and quadratic programming containing only linear …

    oxford Repository record for Efficient numerical algorithms for large-scale conic optimization (opens in a new tab)

  3. A UNIFIED MIXED-INTEGER CONVEX FRAMEWORK FOR COORDINATED MULTI-ROBOT TRAJECTORY PLANNING IN CLUTTERED ENVIRONMENTS

    … and Iterative Regional Inflation by Semidefinite programming (IRIS) for constructing convex-region graphs from obstacle-laden environments. However, no existing formulation combines all three with continuous inter-robot collision avoidance. This thesis develops a unified mixed-integer convex …

    jhu Repository record for A UNIFIED MIXED-INTEGER CONVEX FRAMEWORK FOR COORDINATED MULTI-ROBOT TRAJECTORY PLANNING IN CLUTTERED ENVIRONMENTS (opens in a new tab)

  4. Strong convex relaxations for quadratically constrained quadratic programs

    … thesis, we study cut generating functions for conic sets. Our first main result shows that if the conic set is bounded, then cut generating functions for integer linear programs can easily be adapted to give the integer hull of the conic integer program. We then introduce a new class of cut …

    gatech Repository record for Strong convex relaxations for quadratically constrained quadratic programs (opens in a new tab)