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 76 for “"Semidefinite programming"”.
-
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. …
-
Model Order Reduction Based on Semidefinite Programming
… problems. Since all the methods are based on semidefinite programming, adding new constraints is a matter of formulating a constraint as a semidefinite one. A number of extensions are presented, which illustrate the power of the approach. Properties of the methods are discussed throughout the …
-
Semidefinite programming approaches to multi-contact feedback control
… models of such systems and the roles of semidefinite programming and sums-of-squares programming in designing and verifying stabilizing controllers. First the system is modelled as a discrete-time piecewise affine system and we use semidefinite programming to design stabilizing …
-
Semidefinite programming bounds for codes in complex projective space
… space, where previously only two-point linear programming bounds were known. We discuss how these bounds can be computed numerically using semidefinite programming, and provide a framework that allows for proofs of universal optimality through solving finitely many semidefinite programs. We …
-
Cooperative Positioning in Wireless Sensor Networks Using Semidefinite Programming
… as a recent and trending technology and semidefinite programming (SDP) as a powerful tool in our research. Cooperative localization has several advantages over the traditional noncooperative localization in terms of positioning accuracy and localizability. Cooperation is also highly …
-
A Semidefinite Programming Approach for Control of Systems Along Trajectories
… periodic, they reduce to a finite dimensional semidefinite programming problem. Also, we give systematic approaches for the model reduction of stable as well as stabilizable NLPV models, along with means for evaluating the error resulting from the reduction process.
-
Using semidefinite programming to bound distributions in chemical engineering systems
… that affect them. Recently, in the mathematical programming literature, it was shown that it is possible to optimize a linear objective over a set of distributions by solving a specific type of convex optimization problem called a semidefinite program (SDP). From a theoretical perspective, SDPs …
-
Statistical limits of graphical channel models and a semidefinite programming approach
… call "truncate-and-relax", based on a standard semidefinite relaxation technique. We show that in these two models, the algorithm based on this strategy achieves exact recovery up to a threshold which orderwise matches the statistical threshold. We complement this by showing the limitation of …
-
Power and limitations of convex formulations via linear and semidefinite programming lifts
… and develop lower bounds on the sizes of linear programming (LP) and semidefinite programming (SDP) lifts of polytopes. For LP lifts the bound we develop applies generally for the nonnegative rank of matrices and we compare our method with existing combinatorial and non-combinatorial techniques. …
-
Analysis of the Projective Re-Normalization method on semidefinite programming feasibility problems
… the Projective Re-Normalization method (PRM) for semidefinite programming feasibility problems. To compute a good normalizer for PRM, we propose and study the advantages and disadvantages of a Hit & Run random walk with Dikin ball dilation. We perform this procedure on an ill-conditioned two …
-
Receding-horizon switched linear system design: a semidefinite programming approach with distributed computation
This dissertation presents a framework for analysis and controller synthesis problems for switched linear systems. These are multi-modal systems whose parameters vary within a finite set according to the state of a discrete time automaton; the switching signal may be unconstrained or may be drawn …
-
SDP-CROWN: Efficient bound propagation for neural network verification with tightness of semidefinite programming
Submission original under an indefinite embargo labeled 'Open Access'. The submission was exported from vireo on 2025-10-19 without embargo terms
-
Algorithms for string and graph layout
… methods as well as models based on linear and semidefinite programming for graph layout problems. We apply these techniques to some well-known optimization problems. In particular, we give improved approximation algorithms for the string folding problem on the two- and three-dimensional square …
-
The Distance to Uncontrollability via Linear Matrix Inequalities
… first algorithm, proposed by Ebihara et. al., a semidefinite programming problem is derived via the Kalman-Yakubovich-Popov (KYP) lemma. The dual formulation is also considered and leads to rank conditions for exactness verification of the approximation. For the second algorithm, by Dumitrescu, …
-
Stochastic Event-Based Control and Estimation
… find bounds on control objectives using convex semidefinite programming. The thesis also considers state estimation for discrete time linear stochastic systems from measurements with convex set uncertainty. The Bayesian observer is considered given log-concave process disturbances and …
-
Algorithms for Sparse and Low-Rank Optimization: Convergence, Complexity and Applications
… problems can be reformulated as either linear programming, second-order cone programming or semidefinite programming problems, the standard methods for solving these relaxations are not applicable because the problems are usually of huge size and contain dense data. In this dissertation, we …
-
Planning and control for quadrotor flight through cluttered environments
… using the novel Iterative Regional Inflation by Semidefinite programming algorithm (IRIS), mixed-integer semidefinite programs (MISDP), and model-based control approaches. Here, we present experimental validation of this hypothesis using a small quadrotor in a series of indoor environments …
-
Low rank decompositions for sum of squares optimization
… barrier gradient and Hessian assembling in many semidefinite programming (SDP) solvers. Currently, SDPT3 solver has a function to store low rank constraints to explore its numerical advantages. Some SOS examples are constructed and tested on SDPT3 to a great extent. The experimental results …
-
Full Stability In Optimization
… applications of full stability to nonlinear programming, to semidefinite programming, and to optimal control problems governed by semilinear elliptic PDEs are also studied.</p>
-
Semidefinite relaxation based branch-and-bound method for nonconvex quadratic programming
In this thesis, we use a semidefinite relaxation based branch-and-bound method to solve nonconvex quadratic programming problems. Firstly, we show an interval branch-and-bound method to calculate the bounds for the minimum of bounded polynomials. Then we demonstrate four SDP relaxation methods to …
Page 1 of 4