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 20 of 50 for “"Quadratic programs"”.
-
An Algorithm for Biobjective Mixed Integer Quadratic Programs
Multiobjective quadratic programs (MOQPs) are appealing since convex quadratic programs have elegant mathematical properties and model important applications. Adding mixed-integer variables extends their applicability while the resulting programs become global optimization problems. Thus, in this …
-
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 …
-
Hybrid Exact Methods for Solving Strictly Convex Integer Quadratic Programs
The strictly convex integer quadratically constrained problem (IQCP) is an important class of optimization problem that arises in numerous applications both in theoretical science and industry. Due to its NP-hard nature, common exact methods are typically tree search algorithms with various …
-
Control Barrier Function Based Quadratic Programs with Application to Bipedal Robotic Walking
… through control Lyapunov functions (CLFs) via quadratic program (QP) based controllers. The end result is the generation of stable walking satisfying physical realizability constraints for a model of the bipedal robot AMBER2.
-
Finite Algorithms for Global Optimization of Concave Programs and General Quadratic Programs
This document examines finiteness issues in the context of structured global optimization problems. Specific aspects of this research include: (1) Development of finite algorithms, (2) Analysis of the algorithms' computational complexity, (3) Demonstrating the efficiency of the algorithms in …
-
The mixed-integer bilinear programming problem with extensions to zero-one quadratic programs
… problems: in particular, to the Zero-One Quadratic Programming Problem. In what may be considered as an extension to the work performed on the Mixed-Integer Bilinear Programming Problem, a solution strategy based on an equivalent linear reformulation is developed for the Zero-One Quadratic …
-
Spectral properties of matrices arising from primal-dual interior-point methods for convex quadratic programs
The solution of convex quadratic programs using primal-dual interior-point methods has at its core the solution of a series of linear systems, which are in practice commonly reduced by block Gaussian elimination from the original unsymmetric block 3-by-3 formulation to either a block 2-by-2 …
-
A Blueprint for Semidefinite Relaxations of Binary-Constrained Quadratic Programs Computing tight bounds on NP-hard problems using ADMM
… of two NP-hard, large scale problems, the quadratic assignment problem, QAP, and the side chain positioning, SCP, problem. We summarize existing approaches from and look at the two problems in a unified way using a binary-constrained quadratic program, BCQP. We show how to obtain upper and …
-
Analysis of a nonhierarchical decomposition algorithm
… proposed fails on simple two dimensional quadratic programs. Here, the algorithm is carefully analyzed by testing it on simple quadratic programs, thereby recognizing the problems with the algorithm. Different modifications are made to improve its robustness and the best version is tested …
-
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 …
-
Synthesis of Barrier Certificate-Based Controllers for Safe Robotic Task Execution
… encoded in computationally efficient quadratic programs, making them amenable to real-time implementation. Leveraging these useful features, a framework for translating a given user defined specification to a sequence of barrier certificate-based controllers is introduced. The …
-
Mixed-integer optimal control of fast dynamical systems
… branch-and-bound algorithms for mixed-integer quadratic programs (MIQPs). A core component of these methods is the solution of continuous quadratic programs (QPs). We develop OSQP, a new robust and efficient general-purpose QP solver based on the alternating direction method of multipliers …
-
On Efficient Solution Methods for Mixed-Integer Nonlinear and Mixed-Integer Quadratic Optimization Problems
… the successive solution of convex mixed-integer quadratic programs (MIQP) in a linear outer approximation framework. An extensive numerical competitive study based on several different MINLP solvers shows, that a first implementation of the new method performs well in terms of both the …
-
The convex quadratic programming problem
… of this paper is to investigate the convex quadratic programming problem and its applications. The emphasis is on methods for solving the convex quadratic programming problem.</p> <p>Chapter I discusses the general background of the problem and developes necessary and sufficient conditions …
-
LOW-RANK AUGMENTED LAGRANGIAN METHODS FOR SDP RELAXATIONS
… doubly nonnegative relaxations of mixed-binary quadratic programs, it introduces RiNNAL, a globally convergent augmented Lagrangian method that exploits low-rank structure and reformulates factorized quadratic constraints as manageable affine constraints. For problems with additional …
-
Fast Unit-modulus Least Squares with Applications in Beamforming and Phase Retrieval
… can always be recast as Unit-modulus Quadratic Programs (UQPs), to which Semi-Definite Relaxation (SDR) can be applied, and is often the state-of-the-art approach (e.g., PhaseCut). SDR lifts the problem dimension and requires solving a much larger-scale convex problem, which makes it …
Page 1 of 3