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 20 for “"minmax"”.
-
Minmax topology optimization
… structures subjected to unknown loading using minmax and topology optimization methods. Assuming only the loading region and norm, we distribute a given amount of material in the design domain to minimize the principal compliance, i.e. the maximum compliance that is produced by the worst-case …
-
Sums of Polynomials, Minmax Problems and Number Theory
… solve some extremal problems. We study certain minmax problems about unit vectors in the plane that are best formulated in terms of complex exponentials. We transform these problems into problems about determining whether certain collections of planar convex sets are packings. This new method is …
-
A model predictive control approach to a class of multiplayer minmax differential games
… We describe such games in terms of semi-infinite minmax Model Predictive Control (MPC) problems, and present a numerical optimization technique for efficiently solving them. We also describe the implementation of the solution method in both indoor and outdoor robotic testbeds. Our solution method …
-
Adaptive matched field processing in an uncertain propagation environment
… of the ocean is imperfect. An Adaptive Minmax Matched Field Processor has been developed which combines adaptive matched field processing and minmax approximation techniques to achieve the effective interference rejection characteristic of adaptive processors while limiting the …
-
Sensor placement for microseismic event location
… of sensors. Two algorithms, MAXSRC and MINMAX, are presented that use the variance of localization error, in a particular direction, as a performance measure for a given sensor configuration.The variance of localization error depends, in part, upon the energy spectral density of the …
-
The complexity of Nash equilibria in multiplayer zero-sum games and coordination games
We prove a generalization of von Neumann's minmax theorem to the class of separable multiplayer zero-sum games, introduced in [Bregman and Fokin 1998]. These games are polymatrix-that is, graphical games in which every edge is a two-player game between its endpoints-in which every outcome has zero …
-
Smooth convex approximation and its applications
… of applications, the study is conducted on some minmax problems. Based on a special smoothing technique, we give an efficient scheme for nonsmooth convex function. By using the composite property of $g_{\kappa}(\varepsilon; \cdot)$ and eigenvalue function $\Lambda(X)$, we find the smooth …
-
Analysis of approximation and uncertainty in optimization
… Finally, we consider a randomized model for minmax regret in combinatorial optimization under cost uncertainty. This problem can be viewed as a zero-sum game played between an optimizing player and an adversary, where the optimizing player selects a solution and the adversary selects costs …
-
Dynamic compensators for a nonlinear conservation law
… model is used to compute a robust controller (MinMax), a LQG controller and a fixed-order-finite-dimensional control law (Optimal Projection) by minimizing various energy functionals. These control laws are then applied to the nonlinear model. Different approximation schemes are used to design …
-
Investigating coevolutionary algorithms for finding Nash equilibria in cybersecurity problems
… scores, the second creates a compendium of MEU, MinMax, and inverse Pareto front ratio scores, and the third utilizes Nash averaging. Although NashSolve and HybridCoev do not perform significantly better on average for either attacker or defender populations relative to other heuristics in these …
-
Application of goal programming techniques for optimal reservoir operations
… programming (ii) weighted goal programming (iii) minmax goal programming (iv) fuzzy goal programming and (v) interval goal programming are considered. The reservoir operation problem is also formulated as a multiobjective linear program (MOLP). It is shown that the optimal solutions of the goal …
-
Joint buffer management and scheduling for input queued switches
… heterogeneous and bursty traffic, the Weighted Minmax algorithm (WMinmax) is proposed to efficiently and dynamically allocate network resources. Lastly, to support traffic with multiple priorities and also to handle the decouple problem in practice, this dissertation introduces the multiple …
-
Regularized weighted Chebyshev approximations for support estimation
… of the risk, and combining the weighted minmax polynomial approximation method with discretized semi-infinite programming solvers. Such a setting allows for casting the estimation problem as a linear program (LP) with a small number of variables and constraints that may be solved as …
-
Game theory with learning for cyber security monitoring
… reduces the impact of an attacker compared to Minmax Q-Learning against all attackers, or Stochastic Games players against less rational opponents.
-
Reduced Order Controllers for Distributed Parameter Systems
… balanced reduction techniques, coupled with LQG, MinMax and central control designs for the low order controllers, to the cable mass, Klein-Gordon, and Euler-Bernoulli beam PDE systems. All numerical results include a comparison of controller performance and robustness properties of the closed …
-
Supervised classification and network location problems via mathematical optimization
… only a known interval estimation. We propose a minmax regret model where the service facility can be located anywhere along the network. Furthermore, we present two polynomial algorithms for finding the location that minimizes the maximal regret assuming that the demand realization is an unknown …
-
Dimensionally reduced modeling and gradient-based design of microchannel cooling networks
… in 2D PDMS panels. In this novel application, a minmax problem that minimizes the worst case of a set of predetermined blockage scenarios is formulated and converted to a simpler single-objective optimization problem. In the worst blockage scenario, the designs optimized in this manner exhibit …
-
Efficient Numerical Algorithms for Structured Nonsmooth Min–Max and Adjustable Robust Optimization problems with Applications
In this thesis, we consider structured nonsmooth optimization problems whose objective function and/or the functions describing the constraints can be expressed as the maximum of a collection of auxiliary functions in a lifted space over a parameter set. This class of problems arises in important …
-
Robust Post-donation Blood Screening under Limited Information
Blood products are essential components of any healthcare system, and their safety, in terms of being free of transfusion-transmittable infections, is crucial. While the Food and Drug Administration (FDA) in the United States requires all blood donations to be tested for a set of infections, it …