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 6 of 6 for “"Non-differentiable optimization"”.
-
New model-based methods for non-differentiable optimization
Model-based optimization methods are effective for solving optimization problems with little structure, such as convexity and differentiability. Such algorithms iteratively find candidate solutions by generating samples from a parameterized probabilistic model on the solution space, and update the …
-
The Critical Points of Coherent Information on the Manifold of Positive Definite Matrices
… quantum capacity of a channel. However, it is a non-linear, non-differentiable optimization problem. This thesis discusses that by restricting to the space of positive definite density matrices and restricting the class of quantum channels to be strictly positive, the coherent information becomes …
-
Methods for Parameter Identification in the Mitchell-Schaeffer Model
… focusses on the development and testing of optimization methods for parameter identification in cardiac electrophysiology models. Cardiac electrophysiology models are systems of differential equations representing the evolution of the trans-membrane potential of cardiac cells. The …
-
High-dimensional statistics : model specification and elementary estimators
… statistics, regularization terms induce non-differentiable optimization problems, which do not have closed-form solutions in general. The thesis addresses these two distinct but highly complementary problems: (I) statistical model specification beyond the standard Gaussian or Ising models …
-
Design Optimization of Fuzzy Logic Systems
… it is often necessary to undertake a design optimization process in which the adjustable parameters defining a particular fuzzy system are tuned to maximize a given performance criterion. Some data to approximate are commonly available and yield what is called the supervised learning problem. …
-
Enhanced Formulations for Minimax and Discrete Optimization Problems with Applications to Scheduling and Routing
… formulations associated with such minimax optimization problems. Next, we explore novel continuous nonconvex as well as lifted discrete formulations for the notoriously challenging class of job-shop scheduling problems with the objective of minimizing the maximum completion time (i.e., …