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 49 for “"Semidefinite Program"”.
-
Preprocessing and Reduction for Semidefinite Programming via Facial Reduction: Theory and Practice
Semidefinite programming is a powerful modeling tool for a wide range of optimization and feasibility problems. Its prevalent use in practice relies on the fact that a (nearly) optimal solution of a semidefinite program can be obtained efficiently in both theory and practice, provided that the …
-
Two problems in convex conic optimization
… thesis is on the generalized convex quadratic semidefinite program (GQSDP). We use the primal-dual path following method to solve(GQSDP). To deal with the ill-conditioned linear system, we design two types of preconditioners and prove their effectiveness. At last, we show some numerical results …
-
A new variation of the frequency selective Kalman - Yakubovich - Popov lemma with applications in signal processing and control
… of computationally intractable semi-infinite programs in the entire frequency range to be characterized by computationally tractable semidefinite programs. The first part of this thesis presents a new variation of the frequency selective Kalman-Yakubovich-Popov (FS-KYP) lemma for single input …
-
CONVEX OPTIMIZATION METHODS FOR ROBUST AND DETERMINISTIC OPTIMAL POWER FLOW PROBLEMS
… reformulation as a rank one constrained semidefinite program, and its semidefinite programming relaxation. First, we study an a priori sufficient condition developed in the literature, which guarantees the exactness of the relaxation and then we develop an posteriori sufficient condition, …
-
Discrete Choice and Portfolio Optimization Under Limited Distributional Information
… utilities and performs choice prediction using a Semidefinite program (SDP). The CMM nicely captures utility correlations and produces results comparable to Multinomial Probit, Nested Logit etc. when utilities are correlated. The results obtained by solving a packaging design problem using CMM and …
-
Gridless Sparse Super-Resolution Direction-of-Arrival Estimation for Arbitrary Array Geometries
… The dual problem is then converted to a finite semidefinite program, and the source directions are recovered through polynomial rooting. The proposed approach is used to design search-free gridless methods applicable for coherent sources, limited snapshots, and one-bit sensor measurements. …
-
APPLICATIONS OF GAUSSIAN FIELDS TO THE PERMANENT AND THE MATCHING POLYNOMIAL
… to find a particular covariance matrix C using a semidefinite program and a relation to the Max-Cut problem and cut norms. In the second part of this thesis, we use these techniques to prove a new identity for the matching polynomial P_{G}(x) of a graph G. In doing so, we introduce a random …
-
Algorithm Design and Analysis for Large-Scale Semidefinite Programming and Nonlinear Programming
… behavior of weighted paths associated with the semidefinite program (SDP) map $X^{1/2}SX^{1/2}$ was studied and some applications to error bound analysis and superlinear convergence of a class of primal-dual interior-point methods were provided. A new approach for solving large-scale …
-
Digital Twin Placement for Minimum Application Request Delay with Data Age Targets
… formulate the problem as an integer quadratic program (IQP) and then transform it into a semidefinite program (SDP). We prove that the problem is NP-complete and propose polynomial-time approximation algorithms that solve the problem with different trade-offs between the accommodation of the …
-
Convex Large Margin Training - Unsupervised, Semi-supervised, and Robust Support Vector Machines
… labeled training data. This relaxation yields a semidefinite program (SDP) that can be solved in polynomial time. The resulting training procedures can be applied to two-class and multi-class problems, and ultimately to the multivariate case, achieving high quality results in each case. In …
-
Model Reduction Using Semidefinite Programming
… The reduced models are computed using semidefinite programming. Two ways of imposing the stability constraint are considered. However, both approaches add a positivity constraint to the program. The input to the algorithms is a number of frequency response samples of the original model. …
-
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 …
-
On Graph Embeddings and a new Minor Monotone Graph Parameter associated with the Algebraic Connectivity of a Graph
… a formulation of this generalized problem as a semidefinite program. The dual program can be equivalently written as embedding problem. This is fifinding an embedding of the n nodes of the graph in n-space so that their barycenter is at the origin, the distance between adjacent nodes is bounded …
-
Subjective Mapping
… tasks. At the heart of the new algorithm lies a semidefinite program leading to questions about ARE's ability to handle sufficiently large input sizes. The final contribution of this dissertation is to provide a divide-and-conquer algorithm as a first step to addressing this issue.
-
Optimal deleveraging and liquidation of financial portfolios with market impact
… problem as a non-convex quadratic (polynomial) program with quadratic (polynomial) and box constraints under linear (nonlinear) market price impact functions. A Lagrangian algorithm is developed to numerically solve the NP-hard problem and estimate the quality of the solution. We further propose …
-
Data rate fairness cooperative beamforming for cognitive radio systems in presence of asynchronous interferences
… problem is a quadratically constrained quadratic program (QCQP) max-min optimization problem, which is non-convex and non-linear. Therefore, we reformulate the optimal beamforming problem as a quasi-convex problem using the semidefinite program (SDP) relaxation that can be solved using the …
-
Efficient geometric random walks for high-dimensional sampling from convex bodies
… convex polytope –the feasible region of a linear program– or a spectrahedron –the feasible region of a semidefinite program (SDP). We develop practical Multiphase Monte Carlo algorithms to address the problem of approximating the volume of a convex body, sampling from the flux space of metabolic …
-
Architectures and algorithms for voltage control in power distribution systems
… transformers. We formulate a rank-constrained semidefinite program (SDP), which is then relaxed to obtain a convex optimization that is solved distributively with the Alternating-Direction Method of Multipliers (ADMM). In the fast time-scale control, we propose the following schemes: (i) a …
-
Semidefinite Relaxation-Based Soft MIMO Demodulation via Efficient Dual Scaling
… soft MIMO demodulator that is based on semidefinite relaxation (SDR) and uses the max-log approximation to reduce the cost of the demodulation. In particular, we develop a customized dual-scaling algorithm to solve the semidefinite program that constitutes the core computational task of …
-
Optimal Success Bounds for Single Query Quantum Algorithms Computing the General SUM Problem
… general sum case. The problem is expressed as a semidefinite program, given for all instances. The instance for strings of length two and algorithms making a single query is solved and a proof is given. Significant insight into the multi-query case is also provided.
Page 1 of 3