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 15 of 15 for “"Quadratically Constrained Quadratic Programming"”.
-
On Efficient Semidefinite Relaxations for Quadratically Constrained Quadratic Programming
Two important topics in the study of Quadratically Constrained Quadratic Programming (QCQP) are how to exactly solve a QCQP with few constraints in polynomial time and how to find an inexpensive and strong relaxation bound for a QCQP with many constraints. In this thesis, we first review some …
-
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 …
-
Non-convex Quadratically Constrained Quadratic Programming: Hidden Convexity, Scalable Approximation and Applications
Quadratically Constrained Quadratic Programming (QCQP) constitutes a class of computationally hard optimization problems that have a broad spectrum of applications in wireless communications, networking, signal processing, power systems, and other areas. The QCQP problem is known to be NP–hard in …
-
A quadratically constrained quadratic programming model for optimizing the vertical alignment considering side-slopes in road construction
A new convex Quadratically Constrained Quadratic Programming model (QCQP) is proposed for optimizing the vertical alignment of a road considering side-slopes by minimizing the cost of earthwork operations while satisfying the vertical alignment design and safety constraints. The new QCQP model is …
-
ON LARGE-SCALE SDPS AND THEIR APPLICATIONS ON BRANCH-AND-BOUND ALGORITHMS FOR BINARY QCQPS AND QAPS
We present a semidefinite programming (SDP) based branch-and-bound (BnB) solver for binary and quadratically constrained quadratic programming (QCQP) problems and particularly, quadratic assignment problems (QAPs). We begin by introducing a multi-clique augmented Lagrangian-based SDP solver that …
-
Quantication of the Impact of Uncertainty in Power Systems using Convex Optimization
… estimated from either Semidefinite relaxation of Quadratically-Constrained Quadratic-Programming or Alternating Direction Method of Multipliers. For the second topic, an analytical method to quantify power systems stability margins while acknowleding uncertainty is presented within the framework …
-
Models and methods for integer programming under structure and uncertainty
Integer Programming (IP) is a fundamental tool of modern decision-making; however, these problems are highly combinatorial and often require exponential time to solve. Such computational difficulty can also be enhanced by the specific algebraic structures of the solution space. Each combinatorial …
-
Multiparametric Optimization Strategies for Process Operations Under Uncertainty
… development and application of multiparametric programming-based techniques for the optimization of the operation of process systems under uncertainty. Firstly, an exact strategy that solves multiparameric quadratically constrained quadratic programming problems is presented, which is founded on …
-
Robust Beamforming for Two-Way Relay Systems
… problem using the S-procedure and semidefinite programming (SDP) with rank-one relaxation. This method provides an optimal solution when the rank-one relaxation condition for the SDP is satisfied. In cases where the rank-one condition cannot be satisfied, it’s necessary to resort to sub-optimal …
-
Mixed Integer Nonlinear Optimization. Applications to Competitive Location and Supervised Classification
… focuses on the study of Mixed Integer Nonlinear Programming (MINLP) problems [34] for two important and current applications: competitive location on networks [59, 64] and Support Vector Machines (SVM) [56, 152, 153]. Location problems on a network in a competitive environment were first …
-
Quantum Turing Machines and Quantum Prover-Verifier Interactions
… generated family of quantum circuits with size quadratic in t, and a polynomial-time uniformly generated family of quantum circuits can be simulated by a quantum Turing machine running in polynomial time. We then first revisit the simulation of quantum Turing machines with uniformly generated …
-
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 …
-
Parametric Frugal Sensing of Power Spectra for Moving Average Models
… is formulated. This turns out being a non-convex quadratically constrained quadratic program (QCQP), which is NP--Hard in general. Approximate solutions can be obtained via semi-definite relaxation (SDR) followed by randomization; but this rarely produces a feasible solution for this particular …
-
Convex Optimization via Domain-Driven Barriers and Primal-Dual Interior-Point Methods
… in conic form over symmetric cones (linear-programming (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, …
-
Robust, Non-stationary, and Adaptive Fractionation in Radiotherapy
… the fractionation problem relies on the linear-quadratic (LQ) model of dose-response with tumor- and OAR-specific parameters to approximately capture the behavior of the complex biological system involved. Recent studies have suggested that an integrated approach that simultaneously tackles the …