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 2886 for “"Optimization problems"”.
-
Cardinality optimization problems
… problem. Due to the NP-hardness of these problems, we discuss different computational and 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 …
-
Financial optimization problems
The major objective of this thesis is to study optimization problems in finance. Most of the effort is directed towards studying the impact of transaction costs in those problems. In addition, we study dynamic meanvariance asset allocation problems. Stochastic HJB equations, Pontryagin Maximum …
-
Cardinality Constrained Optimization Problems
In this thesis, we examine optimization problems with a constraint that allows for only a certain number of variables to be nonzero. This constraint, which is called a cardinality constraint, has received considerable attention in a number of areas such as machine learning, statistics, …
-
Constrained Geometric Optimization Problems
In this thesis we consider constrained geometric optimization problems. The first is a constrained version of the k-Steiner tree problem restricting the Steiner points to lie on a restricted set of curves. We solve the 1-Steiner tree problem in the Euclidean plane in optimal asymptotic time and …
-
Cardinality-Constrained Financial Optimization Problems
… integrate the selection problem in the overall optimization, cardinality constraints are imposed on the decision variables resulting in mixed-integer programs (MIPs). This thesis investigates various cardinality-constrained optimization problems throughout the investment process using different …
-
Optimization Problems in Data Mining
"We introduce a novel type of rule, wherein claims of the form ""our object ranked r or better in x of the last t time units,"" are formalized, and where maximal claims of this form are defined under two natural partial orders. For the first, we give an efficient and optimal algorithm for finding …
-
Some optimization problems in electromagnetism
… In this thesis, three standalone topics in optimization sharing the underlying framework of Maxwell-related PDEs are discussed. First, I present an optimal control problem driven by a quasi-linear magneto-static obstacle problem featuring first-order differential state constraints. The …
-
Optimization problems in cellular networks
… resources. In this research, we examine optimization problems that arise in the design and upgrade processes of the wireless component of GSM type cellular networks, namely, the antenna positioning problem (APP) and the frequency allocation problem (FAP). APP examines the deployment of …
-
Landscapes and discriminants of optimization problems
This thesis focuses on two optimization problems: the landscape of the loss function arising in the training of a shallow neural network with polynomial activations, and the SO(2) alignment problem. For the first problem, we provide both positive and negative results regarding the favorability of …
-
Constrained Optimization Problems in Mathematical Economics
No abstract prepared.
-
Optimization problems with variational inequality constraints
Optimization problems with variational inequality constraints are a class of mathematical programming problems which have variational inequalities as constraints. Due to the implicit hierarchical structure of the constraint region induced by variational inequalities, these problems are usually very …
-
Dynamic Continuous Distributed Constraint Optimization Problems
The Distributed Constraint Optimization Problem (DCOP) formulation is a powerful tool to model multi-agent coordination problems that are distributed by nature. The formulation is suitable for problems where the environment does not change over time and where agents seek their value assignment from …
-
SEPARATING PRODUCT FAMILY DESIGN OPTIMIZATION PROBLEMS
… both single product and product family design problems. We use game theory to construct a model that includes the competition's product design decisions. We use separation, a problem decomposition approach, to replace complex optimization problems with simpler problems and find good solutions …
-
Classifying and Comparing Design Optimization Problems
Research in product design optimization has developed and demonstrated a variety of modeling techniques and solution methods, including multidisciplinary design optimization. As new techniques migrate to the industrial world engineers are faced with much more complex problems often extending beyond …
-
Quantum Annealing for Solving Optimization Problems
… of quantum mechanics for solving unconstrained optimization problems. Since its initial proposal, there has been much interest in the search for practical problems for which QA has advantage over classical algorithms. Although it is believed that quantum computers cannot in general solve …
-
Optimization Problems in Quantum Machine Learning
… In this dissertation, we look into the optimization aspect of the variational quantum algorithms as an attempt to answer when and why a variational quantum algorithm works. We mainly focus on two instantiations of the family of variational algorithms, the Variational Quantum Eigensolvers …
Page 1 of 145