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 60 for “"min-max"”.

  1. Min-max minimal surfaces in 3-manifolds

    … which by the Almgren-Pitts and Simon-Smith min-max theory generates a min-max sequence converging as varifolds to a smooth minimal surface (possibly disconnected, and with multiplicities). We prove a conjecture of Pitts-Rubinstein about how such a min-max sequence can degenerate; namely we …

    mit Repository record for Min-max minimal surfaces in 3-manifolds (opens in a new tab)

  2. Some Results on Periodicities for Min-Max Recursive Sequences

    In this thesis, we study integer solutions to minimum-maximum delay difference equations. In particular, we consider an open question regarding convergence of solutions to these equations. Some results related to the greatest common divisors of elements in

    wfu Repository record for Some Results on Periodicities for Min-Max Recursive Sequences (opens in a new tab)

  3. 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

    uiuc Repository record for Towards faster algorithms for large-scale constrained and min-max problems (opens in a new tab)

  4. Efficient Numerical Algorithms for Structured Nonsmooth MinMax and Adjustable Robust Optimization problems with Applications

    … 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 applications such as adversarial learning and robust optimization modeling for optimal radiotherapy. However, the …

    unsw Repository record for Efficient Numerical Algorithms for Structured Nonsmooth Min–Max and Adjustable Robust Optimization problems with Applications (opens in a new tab)

  5. Convergence Rates of Gradient Descent-ascent Dynamics under Computation Constraints in Solving Min-max Optimization

    … Descent-ascent (GDA) method for solving the Min-max optimization (MMO) problems under computation constraints. In particular, we focus our study on two main classes of MMO: a continuous-time variant of the centralized Min-max problem where the GDA update only has access to the gradients of …

    vt Repository record for Convergence Rates of Gradient Descent-ascent Dynamics under Computation Constraints in Solving Min-max Optimization (opens in a new tab)

  6. Multi-Mode Robust Appointment Scheduling for Uncertain Service Time and Random No-Show Using Min-Max Optimization

    … a robust appointment scheduling model that uses min-max optimization to generate appointment time for a multi-mode system while considering customer no-shows and uncertain service times. The objective is to minimize the total expected cost of the job waiting time and service provider's idling and …

    windsor Repository record for Multi-Mode Robust Appointment Scheduling for Uncertain Service Time and Random No-Show Using Min-Max Optimization (opens in a new tab)

  7. Advanced Ordered Weighted Averaging Methods in Robust Optimization

    … or unreliable. Traditional approaches, such as min-max and min-max regret, focus on minimizing the worst-case outcomes and worst-case regret, respectively, often resulting in highly conservative solutions. To address this limitation, this dissertation investigates the Ordered Weighted Averaging …

    passau-thes Repository record for Advanced Ordered Weighted Averaging Methods in Robust Optimization (opens in a new tab)

  8. Optimizing Random Access for Information Freshness in Spatially Distributed Wireless Networks

    … this setting is convex, and design policies to minimize weighted sum, min-max, and proportionally fair AoI by setting transmission probabilities as a function of node locations. We show that under the capture model, when the spatial topology of the network is considered, AoI can be significantly …

    mit Repository record for Optimizing Random Access for Information Freshness in Spatially Distributed Wireless Networks (opens in a new tab)

  9. Topics on critical point theory

    … critical points by building upon the well known min-max methods that are presently used in non-linear differential equations. The thesis consists of two parts: In the first part, we exploit the new powerful mountain pass principle of Ghoussoub and Preiss and its higher dimensional extensions by …

    ubc Repository record for Topics on critical point theory (opens in a new tab)

  10. Differential Games of Mixed Strategies in a Variational Inference Framework: An Application to the Perimeter Defense Problem

    … Model Predictive Control (SV-MPC) to a Min-Max SV-MPC on one hand while we extends the Cross-Entropy optimization method to a Min-Max Cross-Entropy optimization method. Moreover, we demonstrate the approach using robots as players in the perime- ter defense problem in which multiple …

    gatech Repository record for Differential Games of Mixed Strategies in a Variational Inference Framework: An Application to the Perimeter Defense Problem (opens in a new tab)

  11. Parameter estimation and control of nonlinearly parameterized systems

    … (NLP) systems. First, a Hierarchical Min-max algorithm is invented to estimate unknown parameters in NLP systems. To relax the strong condition needed for the convergence in Hierarchical Min-max algorithm, a new Polynomial Adaptive Estimator (PAE) is invented and the Nonlinearly …

    mit Repository record for Parameter estimation and control of nonlinearly parameterized systems (opens in a new tab)

  12. On the Variational Theory of Yang-Mills-Higgs Energies and the Structure of the Singular Set of $\mathbb{Z}$$_{2}$-Harmonic Spinors

    … study the comparison between the corresponding min-max theories. Therefore, we relate the classical theory for C$^{1}$-unctionals to the min-max theory introduced by Almgren and Pitts in the setting of geometric measure theory. In particular, we prove that min-max values for the latter always …

    cambridge Repository record for On the Variational Theory of Yang-Mills-Higgs Energies and the Structure of the Singular Set of $\mathbb{Z}$$_{2}$-Harmonic Spinors (opens in a new tab)

  13. Generative models and robustness in deep learning for inverse problems

    … adversarial examples, which is used in a min-max formulation to build robust image reconstruction networks. Theoretically, we show for a linear reconstruction scheme the min-max formulation results in a singular-value(s) filter regularized solution, which suppresses the effect of …

    uiuc Repository record for Generative models and robustness in deep learning for inverse problems (opens in a new tab)

  14. Optimal Two-Dimensional Triangulations

    A triangulation in the plane is a maximal connected plane graph with straight edges. It is thus a plane graph whose bounded faces are triangles. For a fixed set of vertices, there are, in general, exponentially many ways to form a triangulation. Various criteria related to the geometry of triangles …

    uiuc Repository record for Optimal Two-Dimensional Triangulations (opens in a new tab)

  15. Evaluation of process systems operating envelopes

    … or Stackelberg game, commonly known as the "minimax" problem, or more precisely as a max-min or min-max optimization problem. However, since the application here is to steady-state design, the problem formulation results in a more general nonconvex equality-constrained min-max program, for …

    mit Repository record for Evaluation of process systems operating envelopes (opens in a new tab)

  16. An algorithmic approach to continuous location

    … is associated with each edge. The continuous Max-Min tree partition problem (the continuous Min-Max tree partition problem) is to cut the edges in p - 1 places, so as to maximize (respectively minimize) the weight of the lightest (respectively heaviest) resulting subtree. Thus the tree is …

    cape-town Repository record for An algorithmic approach to continuous location (opens in a new tab)

  17. Application of goal programming techniques for optimal reservoir operations

    … derived from operating the reservoir are maximized. These are obtained on the basis of forecasted inflows to the reservoir, and forecasted precipitation in the downstream reaches. Five goal programming schemes, namely (i) preemptive goal programming (ii) weighted goal programming (iii) …

    vt Repository record for Application of goal programming techniques for optimal reservoir operations (opens in a new tab)

  18. On the Complexity of Nonconvex-Strongly-Concave Smooth Minimax Optimization Using First-Order Methods

    The problem of minimax optimization arises in a wide range of applications. When the objective function is convex-concave, almost the full picture is known. However, the general nonconvex-concave setting is less understood. In this work, we study the complexity of nonconvex-strongly-concave minimax …

    mit Repository record for On the Complexity of Nonconvex-Strongly-Concave Smooth Minimax Optimization Using First-Order Methods (opens in a new tab)

  19. A statistical approach towards performance analysis of multimodal biometrics systems

    … BSSR1 dataset. The proposed approach helps to examine the performance of typical fusion methods that use different normalization and data partitioning techniques. Experiment results demonstrate that the Simple Sum fusion method working with the Min-Max normalization and Re-Substitution data …

    windsor Repository record for A statistical approach towards performance analysis of multimodal biometrics systems (opens in a new tab)

Page 1 of 3