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 6 of 6 for “"Quadratically constrained quadratic programs"”.

  1. Strong convex relaxations for quadratically constrained quadratic programs

    … 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 generating functions which are non-decreasing with respect to the second-order cone. We show that, under some minor technical …

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

  2. Discrete Approximations, Relaxations, and Applications in Quadratically Constrained Quadratic Programming

    … on theory and applications for Mixed Integer Quadratically Constrained Quadratic Programs (MIQCQP). We introduce new mixed integer programming (MIP)-based relaxation and approximation schemes for general Quadratically Constrained Quadratic Programs (QCQP's), and also study practical …

    vt Repository record for Discrete Approximations, Relaxations, and Applications in Quadratically Constrained Quadratic Programming (opens in a new tab)

  3. Asymptotic Cones of Quadratically Defined Sets and Their Applications to QCQPs

    Quadratically constrained quadratic programs (QCQPs) are a set of optimization problems defined by a quadratic objective function and quadratic constraints. QCQPs cover a diverse set of problems, but the nonconvexity and unboundedness of quadratic constraints lead to difficulties in globally …

    clemson Repository record for Asymptotic Cones of Quadratically Defined Sets and Their Applications to QCQPs (opens in a new tab)

  4. Applications of Conic Programming Reformulations

    In general, convex programs have nicer properties than nonconvex programs. Notably, in a convex program, every locally optimal solution is also globally optimal. For this reason, there is interest in finding convex reformulations of nonconvex programs. These reformulation often come in the form of …

    clemson Repository record for Applications of Conic Programming Reformulations (opens in a new tab)

  5. Optimization and Learning Methods for Electric Distribution Network Management

    … – a powerful approach for general nonconvex quadratically constrained quadratic programs. The merits of the approach are illustrated using several multi-phase distribution networks with renewables.

    umn Repository record for Optimization and Learning Methods for Electric Distribution Network Management (opens in a new tab)

  6. High Performance Adaptive Transmit Beamforming forWireless Networks using Binary CSIT

    … to obtain feasible solutions for non-convex Quadratically Constrained Quadratic Programs (QCQP) with two-sided constraints when the associated matrices are positive semi-definite. In this context, the proposed algorithm starts with a infeasible solution which is iteratively updated using a …

    umn Repository record for High Performance Adaptive Transmit Beamforming forWireless Networks using Binary CSIT (opens in a new tab)