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 21 for “"Variational inequality problems"”.

  1. Optimization,minimax, and variational inequality problems: algorithms and applications

    Optimization, minimax, and variational inequality problems, particularly those involving certain structures, such as finite-sum structures, are central to modern machine learning and computational biology research. This thesis investigates the algorithmic complexity of such problems, focusing on …

    umn Repository record for Optimization,minimax, and variational inequality problems: algorithms and applications (opens in a new tab)

  2. Extragradient-type Methods for (L0, L1)-Lipschitz Variational Inequality Problems

    Variational inequality problems (VIPs) capture a variety of optimization problems of interest for current machine learning tasks, including min-max optimization and finding game equilibria. These problems are commonly solved using first-order iterative methods known as extragradient-type …

    jhu Repository record for Extragradient-type Methods for (L0, L1)-Lipschitz Variational Inequality Problems (opens in a new tab)

  3. Studies on Optimization Based Solution Methods for Variational Inequality Problems

    本文データは平成22年度国立国会図書館の学位論文(博士)のデジタル化実施により作成された画像ファイルを基にpdf変換したものである

    kyoto Repository record for Studies on Optimization Based Solution Methods for Variational Inequality Problems (opens in a new tab)

  4. On the analysis of stochastic optimization and variational inequality problems

    … problem classes: [(1)] Convex Nash games; [(2)] Variational inequality problems and complementarity problems; [(3)] Hierarchical risk management problems in financial networks. Accordingly, this dissertation considers the analysis of a broad class of stochastic optimization and variational …

    uiuc Repository record for On the analysis of stochastic optimization and variational inequality problems (opens in a new tab)

  5. A Modern Treatise on Variational Inequality Problems: Structures, Algorithms, and Iteration Complexities

    In this thesis, we study the variational inequality (VI) problem with the methodology of designing efficient (or optimal) algorithms and analyzing their (sample/gradient) iteration complexities. In particular, we aim to explore the hidden structures in VI that have not been (fully) studied before …

    umn Repository record for A Modern Treatise on Variational Inequality Problems: Structures, Algorithms, and Iteration Complexities (opens in a new tab)

  6. Variational Inclusions with General Over-relaxed Proximal Point and Variational-like Inequalities with Densely Pseudomonotonicity

    … the existence and uniqueness of the solutions of variational inclusion and variational inequality problems and then attempts to develop efficient algorithms to estimate numerical solutions for the problems. The dissertation consists a total of five chapters. Chapter 1 is an introduction to …

    ucf Repository record for Variational Inclusions with General Over-relaxed Proximal Point and Variational-like Inequalities with Densely Pseudomonotonicity (opens in a new tab)

  7. Results on the fixed points of multifunctions with applications to problems in optimization and equilibrium theory

    … of multifunction theory are applied to problems in optimization and equilibrium theory. First, fixed point index theory for multifunctions is used to extend a continuation result of F. E. Browder. This extension is then used to obtain existence results for several types of variational …

    uiuc Repository record for Results on the fixed points of multifunctions with applications to problems in optimization and equilibrium theory (opens in a new tab)

  8. On alternating direction methods for monotropic semidefinite programming

    … for solving monotropic semidefinite programming problems. In order to avoid solving difficult sub-variational inequality problems on matrix space at each iteration, we establish a set of projection-based algorithms. We discuss alternating direction methods in different ways to deal with quadratic …

    nus Repository record for On alternating direction methods for monotropic semidefinite programming (opens in a new tab) Download file for On alternating direction methods for monotropic semidefinite programming (opens in a new tab)

  9. Hardness and totality of problems related to Nash equilibrium

    … computational complexity of various equilibrium problems and their applications—a central topic in algorithmic game theory. While the existence of solutions for classical equilibrium notions, such as generalized Nash equilibria and multi-leader–follower games with convex constraints, is well …

    uvic Repository record for Hardness and totality of problems related to Nash equilibrium (opens in a new tab)

  10. ΕΦΑΡΜΟΓΕΣ ΤΗΣ ΓΕΝΙΚΕΥΜΕΝΗΣ ΜΟΝΟΤΟΝΙΑΣ ΚΑΙ ΤΗΣ ΓΕΝΙΚΕΥΜΕΝΗΣ ΚΥΡΤΟΤΗΤΑΣ ΣΤΙΣ ΑΝΙΣΩΣΕΙΣ ΜΕΤΑΒΟΛΩΝ ΚΑΙ ΣΤΗ ΔΙΑΝΥΣΜΑΤΙΚΗ ΒΕΛΤΙΣΤΟΠΟΙΗΣΗ

    … PART OF THIS THESIS IS DEVOTED TO THE VECTOR VARIATIONAL INEQUALITY PROBLEMS WITH GENERALIZED MONOTONE OPERATORS. EXISTENCE THEOREMS CONCERNING THE CLASS OF (VECTOR) PSEUDOMONOTONE AND QUASIMONOTONE OPERATORS ARE OBTAINED, WHILE BY MEANS OF A COUNTEREXAMPLE, A MISTAKE IN THE PROOF OF SIMILAR …

    greece Repository record for ΕΦΑΡΜΟΓΕΣ ΤΗΣ ΓΕΝΙΚΕΥΜΕΝΗΣ ΜΟΝΟΤΟΝΙΑΣ ΚΑΙ ΤΗΣ ΓΕΝΙΚΕΥΜΕΝΗΣ ΚΥΡΤΟΤΗΤΑΣ ΣΤΙΣ ΑΝΙΣΩΣΕΙΣ ΜΕΤΑΒΟΛΩΝ ΚΑΙ ΣΤΗ ΔΙΑΝΥΣΜΑΤΙΚΗ ΒΕΛΤΙΣΤΟΠΟΙΗΣΗ (opens in a new tab)

  11. Essays on optimal investment in mathematical finance

    … Then, we formulate four stock buying/selling problems by minimizing/maximizing the expectation of the ratio of the buying/selling price to the global maximum (minimum) price. These are optimal stopping problems that can be formulated as variational inequality problems. We solve them by a …

    oxford Repository record for Essays on optimal investment in mathematical finance (opens in a new tab)

  12. Bregman Augmented Lagrangian Method: Convergence, acceleration, and applications in reinforcement learning

    … show that the algorithm can also be applied to variational inequality problems with convex constraints, and fully characterize the iteration complexity of the algorithm derived from the inexact version of BALM. Furthermore, we develop, for the first time, an accelerated Bregman proximal point …

    uiuc Repository record for Bregman Augmented Lagrangian Method: Convergence, acceleration, and applications in reinforcement learning (opens in a new tab)

  13. Distributed algorithms for networked multi-agent systems: optimization and competition

    … goals, ranging from the solution of optimization problems to addressing the solution of variational inequality problems. Two key complicating characteristics of multi-agent systems are the following: (i) the lack of availability of system-wide information at any given location; and (ii) the …

    uiuc Repository record for Distributed algorithms for networked multi-agent systems: optimization and competition (opens in a new tab)

  14. Stochastic approximation schemes for stochastic optimization and variational problems: adaptive steplengths, smoothing, and regularization

    … by Robbins and Monro in 1951 for root- finding problems, have been widely used in the literature to solve problems arising from stochastic convex optimization, stochastic Nash games and more recently stochastic variational inequalities. Several challenges arise in the development of SA schemes. …

    uiuc Repository record for Stochastic approximation schemes for stochastic optimization and variational problems: adaptive steplengths, smoothing, and regularization (opens in a new tab)

  15. On the resolution of misspecification in stochastic optimization, variational inequality, and game-theoretic problems

    … approaches in resolving such a set of coupled problems have been either sequential or direct variational approaches. In the case of the former, this entails the following steps: (i) a solution to the learning problem for parameters is first obtained; and (ii) a solution is obtained to the …

    uiuc Repository record for On the resolution of misspecification in stochastic optimization, variational inequality, and game-theoretic problems (opens in a new tab)

  16. Risk-averse Nash equilibria for power trading with market frictions

    … we consider the problem of solving generalised variational inequality problems, which is a classical way of reformulating generalised Nash games in order to find subsets of solutions. We introduce a new numerical method that combines the dual extrapolation method with the cutting plane method. …

    oxford Repository record for Risk-averse Nash equilibria for power trading with market frictions (opens in a new tab)

  17. Discrete Choice-based Equilibrium Modeling of Supply Chain Network with Conflicting Objectives and Demand Uncertainty

    This PhD thesis discusses several equilibrium problems in supply chain network integration and specifically concentrates on the importance of collaboration under conflicting objective decision-making and uncertainty management in a supply chain network. In particular, discrete choice models are …

    calgary Repository record for Discrete Choice-based Equilibrium Modeling of Supply Chain Network with Conflicting Objectives and Demand Uncertainty (opens in a new tab)

  18. Learning and Optimization on Geodesic Metric Spaces

    … in the online setting as well as in minimax problems, which is the focus of the present work. In the first part, we explore minimizing dynamic regret on Riemannian manifolds. We introduce optimistic mirror descent on manifolds in the online improper learning setting and apply the technique to …

    gatech Repository record for Learning and Optimization on Geodesic Metric Spaces (opens in a new tab)

Page 1 of 2