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 26 for “"Sparse Solution"”.
-
SPARSE SOLUTION IN OPERATIONS: ROUTING AND PRICING PROBLEMS
… that can be used to guide managers to design sparse (i.e., slightly flexible) and yet efficient operations. This dissertation focuses on developing a generic method to design such a sparse solution in a general supply chain network, and understand the performance of some special sparse pricing …
-
A study on conditions for sparse solution recovery in compressive sensing
… suitable conditions ℓ1 minimization can recover sparse solutions to under-determined linear systems of equations. More precisely, by solving the convex optimization problem min{∥ x∥1 : Ax = b}, where A is an m x n measurement matrix with m < n, one can obtain the sparsest solution x* to Ax = b …
-
Cardinality optimization problems
… relaxation techniques for finding an approximate solution to these problems. We also discuss the l\(_1\)-minimization as one of the most efficient methods for solving CMPs, and we demonstrate that the l\(_1\)-minimization uses a kind of weighted l\(_2\)-minimization. We show that the reweighted …
-
Optimization algorithms for inference and classification of genetic profiles from undersampled measurements
… to outperform the deterministic NMF and the sparse NMF algorithms in clustering stability and classification accuracy. Second, we propose SMURC: Small-sample MUltivariate Regression with Covariance estimation. Specifically, we consider a high dimension low sample-size multivariate regression …
-
Comparative analysis of orthogonal matching pursuit and least angle regression
The problem of finding a unique and sparse solution for an underdetermined linear system has attracted significant attention in recent years. In this thesis, we compare two popular algorithms that are used for finding sparse solutions of underdetermined linear systems: Orthogonal Matching Pursuit …
-
On ridge regression and least absolute shrinkage and selection operator
… zero in RR, the lasso is able to provide a sparse solution, setting many coefficient estimates exaclty to zero. Furthermore, we try a new approach to solve the lasso problem by formulating it as a bilevel problem and implementing a new algorithm to solve this bilevel program.
-
TDT for Human QTL Mapping and Genome - Wide Association Study
… grouped covariates. An efficient algorithm for sparse solution is proposed based on a series of optimality conditions of the optimization programming.
-
Projection algorithms for conic programming with applications in compressed sensing
… sensing in digital signal processing where a sparse solution, or approximate solution, to an under-determined linear system is sought. We conduct numerical experiments to compare the performance of the projection approach to these three formulations and present numerical results.
-
Advances in Sparse Analysis with Applications to Blind Source Separation and EEG/MEG Signal Processing
… challenging problems, e.g., finding a unique solution to the under-determined linear system of equations in which the number of equations is less than the number of unknowns. This concept is extended to the problem of solving the under-determined blind source separation (BSS) problem in which …
-
Application of L1 reconstruction of sparse signals to ambiguity resolution in radar
… new algorithm for range and Doppler ambiguity resolution in radar detection data using L1 minimization methods for sparse signals and to investigate the properties of such techniques. This novel approach to ambiguity resolution makes use of the sparse measurement structure of the post-detection …
-
SPARSITY AND WEAK SUPERVISION IN QUANTUM MACHINE LEARNING
… quantum machine learning algorithm for training Sparse Support Vector Machine for problems with large datasets that require a sparse solution. We also present the first quantum semi-supervised algorithm, where we still have a large dataset, but only a small fraction is provided with labels. While …
-
Prediction Oriented Marker Selection (PROMISE) for High Dimensional Regression with Application to Personalized Medicine
… Data analysis show that PROMISE produces a more sparse solution than CV, reducing the false positives compared to CV, while giving similar prediction accuracy and true positives. In our simulation and real data analysis, SS does not work well for variable selection and prediction. PROMISE can be …
-
In pursuit of high resolution radar using pursuit algorithms
… filters are not suitable for use in high resolution radars operating in multi-target environments. Assuming a point target model, we show that the radar problem can be formulated as a linear under-determined system with a sparse solution. This suggests that radar can be considered as a …
-
Randomised Kaczmarz Method
… on solving a system of linear equations with sparse solutions. Randomised Kaczmarz method has its advantage of sparse solution problems due to its using less memory in computing. We thus construct a randomised sparse Kaczmarz method by applying soft-threshold function and based on this, we …
-
Efficient algorithms for uncertainty quantification using polynomial chaos expansion and its applications to composite structures
… Finally, an adaptive algorithm to obtain sparse PCE models with L1-minimization and sequential sampling is also proposed for high-dimensional problems. The L1-minimization is capable of solving the under-determined system when the number of samples is minuscule. It is also advantageous in …
-
Primary estimation with sparsity-promoting bi-convex optimization
… called the Robust Estimation of Primaries by Sparse Inversion (Robust EPSI, or REPSI). Surface-related multiples are a major source of coherent noise in seismic data, and inferring fine geological structures from active-source seismic recordings typically first necessitates its removal or …
-
Evaluating Performance of Automaton University Checking Algorithms
… BDDs, but are more efficient when representing sparse solution sets. We used this advantage in constructing a new ZDD-based tool, ALASKA-ZDD, which completely replaces ALASKA's symbolic representation with a ZDD-based one. We then experimentally compared it with ALASKA, using random automata …
-
Compressive Sensing Approaches for Sensor based Predictive Analytics in Manufacturing and Service Systems
Recent advancements in sensing technologies offer new opportunities for quality improvement and assurance in manufacturing and service systems. The sensor advances provide a vast amount of data, accommodating quality improvement decisions such as fault diagnosis (root cause analysis), and real-time …
-
Performance Bounds on Sensor Placement Algorithms and Online Outlier Detection in the Power Grid
… problem of ensuring quality of the suboptimal solutions to the optimal sensor placement problem and also presents algorithms for detecting outliers or malicious data in the power grid. In the sensor placement problem, the number of sensors that can be deployed is often limited by costs and …
-
Sparse Value Function Approximation for Reinforcement Learning
… learning the value function approximation; such sparse methods tend to select relevant features and ignore irrelevant features, thus automating the feature selection process. This dissertation describes three contributions in the area of sparse value function approximation for reinforcement …
Page 1 of 2