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 986 for “"Convex optimization"”.
-
Convex Optimization of Environmental Processes
This study introduces a Kernel Ridge Regression (KRR)-based microplastic quantification method, enhanced by active learning strategies, to predict the number of microplastic particles from aggregate weight measurements. Our approach utilizes a subset of experimentally quantified samples to train …
-
Basis identification through convex optimization
… order.</p> <p>This dissertation develops a novel convex optimization problem,</p> <p>inspired by compressed sensing, and conjectures that the</p> <p>set of minimizers to this problem can be used to</p> <p>identify bases in a given spanning set. In particular,</p> <p>given an injective matrix X, …
-
Generalized implicit online convex optimization
… and that of any arbitrary comparator. In Online Convex Optimization (OCO), the domain is convex set and the losses are convex functions. A classic way to design OCO algorithm is to approximate the original convex losses with linear models, reducing the OCO problem into an online linear …
-
Convex Optimization Over Integer Points
Many problems in discrete optimization can be succinctly encapsulated as the question of minimizing a convex function $f$, which captures the combinatorial structures of the problem, over integer points that are typically $\{0,1\}^n$, i.e. $\min_{x \in \{0,1\}^n} f(x)$. At a high level, this thesis …
-
Convex Optimization over Probability Measures
The thesis studies convex optimization over the Banach space of regular Borel measures on a compact set. The focus is on problems where the variables are constrained to be probability measures. Applications include non-parametric maximum likelihood estimation of mixture densities, optimal …
-
Convex optimization for generalized sparse recovery
… of a framework for solving a wide class of convex optimization problems for sparse recovery. We provide a detailed account of the application of the framework on several problems, but also consider its limitations. The framework has been implemented in the SPGL1 algorithm, which is already …
-
Control system design by convex optimization
… combines the Youla parameterization with convex optimization. In this thesis, their paradigm is accepted in its entirety, but a completely different numerical approach is adopted. An algorithm due to Akilov and Rubinov, which is in essence an abstract rendition of one of the famous …
-
ITEM RESPONSE MODELS AND CONVEX OPTIMIZATION.
… models using I-projections and duality. We use convex optimization methods to derive these models. The Kullback-Leibler divergence is used as a metric and specific constraints are proposed for the various models. With this approach, the dual problem is shown to be much easier to solve than the …
-
CUR Matrix Approximation Through Convex Optimization
… a novel deterministic CUR formulation that uses convex optimization to form the matrices C and R, and a corresponding algorithm that uses bisection to ensure that the user selected number of columns appear in C and the user selected number of rows appear in R. We implement the algorithm using the …
-
Sampling Methods, Spectrahedra and Convex Optimization
Παρουσιάζουμε αποτελέσματα σε αλγορίθμους, πολυπλοκότητα και υλοποίηση σχετικά με το πρόβλημα δειγματοληψίας του εσωτερικού και του συνόρου ενός σπεκτραέδρου. Το κύριο εργαλείο μας είναι οι τυχαίοι περίπατοι. Ορίζουμε και αναλύουμε ένα σύνολο βασικών γεωμετρικών πράξεων, οι οποίες εκμεταλλεύονται …
-
Autonomous Trajectory Planning by Convex Optimization
… this highly constrained RPO problem (non-convex) is transformed into a relaxed problem the solution of which is proven to be the same as that of the original problem. Then a novel successive approximation method, forming a sequence of subproblems with linear and time-varying dynamics, is …
-
Adaptive strategies in non-convex optimization
… learning have seen more and more usage of non-convex formulations in that they can often better capture the problem structure. One prominent example is the Deep Neural Networks which have achieved innumerable successes in various fields including computer vision and natural language processing. …
-
Novel Convex Optimization Approaches for VLSI Floorplanning
… recently received much attention. A two-stage convex optimization methodology is proposed to solve the fixed-outline floorplanning problem. It is a global optimization problem for wirelength minimization. In the first stage, an attractor-repeller convex optimization model provides the relative …
-
Convex Optimization Methods for Bounding Lyapunov Exponents
… LE over trajec- tories using methods from convex optimization, which have previously been used to compute sharp bounds on the time averages of scalar quantities on bounded orbits of dynamical systems. For discrete-time dynamics we develop an optimization-based approach for computing sharp …
-
Quantum State Local Distinguishability via Convex Optimization
… measurements. We build a framework based on convex optimization (on cone programming, in particular) to study such problems. Compared to previous approaches to the problem, the method described in this thesis provides precise numerical bounds and quantitative analytic results. By combining …
-
Joint Equalization and Decoding via Convex Optimization
… for decoding and inference problems based on convex optimization methods. Th first part considers the joint detection and decoding problem for low-density parity-check (LDPC) codes on finite-state channels (FSCs). Hard-disk drives (or magnetic recording systems), where the required error rate …
Page 1 of 50