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 56 for “"semidefinite programming (SDP)"”.
-
Eigenvalue, Quadratic Programming and Semidefinite Programming Bounds for Graph Partitioning Problems
… eigenvalue techniques, convex quadratic programming techniques, and semidefinite programming (SDP). In particular, we show that the SDP relaxation is equivalent to and arises from the Lagrangian relaxation for a particular quadratically constrained quadratic model. Moreover, the bounds …
-
A Quadratic Cone Relaxation-Based Algorithm For Linear Programming
We present and analyze a linear programming (LP) algorithm based on replacing the non-negative orthant with larger quadratic cones. For each quadratic relaxation that has an optimal solution, there naturally arises a parameterized family of quadratic cones for which the optimal solutions create a …
-
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 …
-
A Blueprint for Semidefinite Relaxations of Binary-Constrained Quadratic Programs Computing tight bounds on NP-hard problems using ADMM
… and lower bounds for the BCQP by formulating the semidefinite programming (SDP) relaxation and applying the Alternating Direction Method of Multipliers (ADMM) algorithm to solve it. By unifying the two problems under the umbrella of the BCQP, we better understand why the method is so successful …
-
Discovering Discrete Structures using SDP Relaxation: Hidden Integrality, Statistical Optimality and Semirandom Robustness
… we will present an algorithm based on semidefinite programming (SDP) relaxation. We show that despite being a relaxation, this algorithm achieves an optimal (or nearly optimal) error rate in terms of distance to the target solution, and that this result is enabled by a surprising …
-
Variational Analysis Of Composite Optimization
… optimization; in particular, nonlinear programming, second-order cone programming and semidefinite programming(SDP). Beside constrained optimization problems our framework covers many important composite optimization problems such as the extended nonlinear programming and eigenvalue …
-
Relaxações convexas e desigualdades válidas para o problema da mochila quadrático binário
We consider a parametric convex quadratic programming, CQP, relaxation for the quadratic knapsack problem, QKP. This relaxation maintains partial quadratic information from the original QKP by perturbing the objective function to obtain a concave quadratic term. The nonconcave part generated by the …
-
A Semidefinite Programming Model for the Facility Layout Problem
… This thesis presents a completely mixed integer semidefinite programming (MISDP) model for the continuous facility layout problem. To begin we describe the problem in detail; discuss the conditions required for a feasible layout; and define quaternary variables. These variables are the basis of …
-
Online Algorithms and Optimal Offline Algorithms for Dynamic Optimal Power Flow
… condition under which DOPF is equivalent to a Semidefinite Programming (SDP) problem, which is computationally efficient to solve. An optimal offline optimization algorithm is designed for DOPF by solving the SDP and then recovering an optimal offline solution to DOPF. Addressing the dynamic …
-
Blind Received Signal Strength Difference Based Source Localization with System Parameter Error and Sensor Position Uncertainty
… (MSE) of the proposed RSSD-based model. Then semidefinite relaxation is employed to transform this nonconvex and nonlinear problem into a convex optimization problem. This can be solved e ciently to obtain the optimal solution of the corresponding semidefinite programming (SDP) problem. …
-
ADMM for SDP Relaxation of GP
… adjacency matrix and the Laplacian; quadratic programming (QP) bounds derived from imitating the (QP) bounds for the quadratic assignment problem; and semidefinite programming (SDP) bounds. For the quadratic assignment problem, a recent paper of [8] had great success from applying the ADMM …
-
Experimental study of localization in sensor networks and design of adaptive localization algorithms
… (APS), Multidimensional Scaling (MDS), and Semidefinite Programming (SDP). Using this evaluation, we study the effect of several factors that affect the performance of localization. Through experimental study of the three selected localization methods, we present one possible combination of …
-
Control of quad-rotor UAVs using switched-system synthesis methods
… The methodologies of LQR control and semidefinite programming (SDP) are discussed to provide preliminary knowledge of the switched control. Benefits of the LQR control include tracking of reference trajectories and cost function minimization. The core of switched control methods is the …
-
Cutting-Plane Separation Strategies for Semidefinite Programming Models to Solve Single-Row Facility Layout Problems
… the interactions between the departments. The semidefinite programming (SDP) relaxation model that incorporates cutting planes proposed recently by Anjos, Kennings, and Vannelli (AKV) was considered a breakthrough in the field. This thesis presents a new SDP model AKV' and compares the two …
-
Trustworthy Machine Learning: Specification, Verification, and Explanation
… address computational bottlenecks in expressive semidefinite programming (SDP)-based frameworks for neural network verification. By identifying and exploiting chordal sparsity patterns in large constraints, we obtain speedups of several orders of magnitude, making SDP-based methods more practical …
-
Optimization and control of voltage in active distribution networks
… and economic performance of ADNs. A convex semidefinite programming (SDP) approach is used to optimize voltage profiles, reduce power losses, and improve phase balancing. Furthermore, the work introduces an economic model that includes grid purchase cost, battery degradation, and PV …
-
Methods of Analysis and Design of Dynamical Systems Using Homogeneous Polynomial Lyapunov Functions
… and the problems are tractable with standard semidefinite programming (SDP). This method is demonstrated for the analysis of the L1 problem, as well as the stability of switched linear systems and implicit switched linear systems. Contributions are developed and demonstrated for homogeneous …
-
A reduction framework for approximate extended formulations and a faster algorithm for convex optimization
Linear programming (LP) and semidefinite programming (SDP) are among the most important tools in Operations Research and Computer Science. In this work we study the limitations of LPs and SDPs by providing lower bounds on the size of (approximate) linear and semidefinite programming formulations of …
-
Numerical Stability in Linear Programming and Semidefinite Programming
… for interior-point methods applied to Linear Programming, LP, and Semidefinite Programming, SDP. We analyze the difficulties inherent in current methods and present robust algorithms. <br /><br /> We start with the error bound analysis of the search directions for the normal equation approach …
-
Pilot Contamination Mitigation for Massive MIMO System Using Novel Channel Estimation Techniques
… the minimum mean square error (MMSE) using the semidefinite programming (SDP) optimisation approach. Then, the conventional channel estimation is considered for Massive MIMO in a correlated Rician fading and correlated Nakagami-m fading channel models. Our analysis reveals that by increasing the …
Page 1 of 3