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 308 for “"min-max"”.
-
Convergence in min-max optimization
Min-max optimization is a classic problem with applications in constrained optimization, robust optimization, and game theory. This dissertation covers new convergence rate results in min-max optimization. We show that the classic fictitious play dynamic with lexicographic tiebreaking converges …
-
Provably effective algorithms for min-max optimization
… machine learning tasks can be formulated as min-max optimization. This motivates us to design effective and efficient first-order methods that provably converge to the global min-max points. For this purpose, this thesis focuses on designing practical algorithms for several specific machine …
-
Min-max constructions of 2d-minimal surfaces
… a proof of the existence of closed embedded minimal surfaces in a closed 3-dimensional manifold constructed via min-max arguments and we will prove genus bounds for the produced surfaces. A stronger estimate was announced by Pitts and Rubinstein but to our knowledge its proof has never been …
-
Learning-Based Min-Max Differential Dynamic Programming
… worst-case uncertainties. Among these, Min-Max Differential Dynamic Programming (Min-Max DDP) stands out as an effective approach, leveraging the principles of dynamic programming to iteratively refine control policies while explicitly accounting for worst-case adversarial disturbances. …
-
Min-max theory for minimal hypersurfaces with boundary
… a result concerning existence and regularity of minimal surfaces with boundary in Riemannian manifolds obtained via a min-max construction, both in fixed and free boundary context. We start by considering a smooth, compact, oriented Riemmanian manifold ($\mathcal{M},\mathit{g}$) of dimension $n$ …
-
Parallel programming on General Block Min Max Criterion
… a parallel implementation of the General Block Min Max Criterion (GBMM). This thesis deals with two kinds of parallel overheads: Redundant Calculations Parallel Overhead (RCPO) and Communication Parallel Overhead (CPO).
-
Parallel programming on General Block Min Max Criterion
… a parallel implementation of the General Block Min Max Criterion (GBMM). This thesis deals with two kinds of parallel overheads: Redundant Calculations Parallel Overhead (RCPO) and Communication Parallel Overhead (CPO).
-
Dynamic ensemble selection using fuzzy min-max hyperboxes
Dynamic Selection systems are a good alternative to achieve higher accuracy in complex problems. In current DS techniques, the competence of base classifiers to classify the new query sample is estimated with regard to their performance in a small region surrounding the query sample. Most of these …
-
Searching game trees with Min Max Approximation : experiments and analysis
<p>The Min Max Approximation (MMA) algorithm [Riv88] is a method of exploring a game tree unevenly. Rivest's implementation of the algorithm is reviewed and variations on his technique are discussed. Results are given of additional experiments with the game of Connect-Four which demonstrate …
-
Min-max constructions of minimal surfaces in closed Riemannian manifolds
… proof of the existence of nontrivial closed minimal hypersurfaces in closed smooth (n+1)-dimensional Riemannian manifolds, a theorem proved first by Pitts for 2 ≤ n ≤ 5 and extended later by Schoen and Simon to any n. Our proof follows Pitts’ original idea to implement a min-max construction. …
-
Low-pass min-max rational approximation to the Taylor Weighting Function
<p>The purpose of this investigation is to determine the single pole low-pass min-max rational approximation to the Taylor Weighting Function by digital methods and to determine the general effectiveness of the method.</p><p>A computer program was written and was found to perform as expected. Some …
-
New Message Passing Methods for Min-Max and Sum-Product Inference
… in two important modes of inference. First is min-max inference which seeks the assignment that minimizes the worse-case outcome. Examples include well known NP-hard combinatorial problems such as min-max clustering, the asymmetric K-center problem, K-packing, the bottleneck traveling salesman …
-
Approximation algorithms for min-max resource sharing and malleable tasks scheduling
… algorithms for problems in mathematical programming, combinatorial optimization, and their applications. We first study the min-max resource-sharing problem (the packing problem as the linear case) with $M$ nonnegative convex constraints on a convex set $B$, which is a class of convex …
-
O método min-max e existência de geodésicas com fronteira livre
… por Xin Zhou no artigo “On the free boundary min-max geodesics” [16]. Mais precisamente, dada uma variedade Riemanniana M m completa e homogeneamente regular, e Sk ⊂ M m uma subvariedade fechada e mergulhada, onde k < m, podemos encontrar uma geodésica não-trivial de M com fronteira livre na …
-
Towards faster algorithms for large-scale constrained and min-max problems
Submission published under a 24 month embargo labeled 'Closed Access', the embargo will last until 2024-05-01
Page 1 of 16