• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 15
  • 2
  • 1
  • 1
  • 1
  • Tagged with
  • 22
  • 22
  • 6
  • 6
  • 5
  • 5
  • 5
  • 4
  • 4
  • 4
  • 4
  • 3
  • 3
  • 3
  • 3
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
11

Applications of Degree Theories to Nonlinear Operator Equations in Banach Spaces

Adhikari, Dhruba R 26 April 2007 (has links)
Let X be a real Banach space and G1, G2 two nonempty, open and bounded subsets of X such that 0 ∈ G2 and G2 ⊂ G1. The problem (∗) T x + Cx = 0 is considered, where T : X ⊃ D(T) → X is an accretive or monotone operator with 0 ∈ D(T) and T(0) = 0, while C : X ⊃ D(C) → X can be, e.g., one of the following types: (a) compact; (b) continuous and bounded with the resolvents of T compact; (c) demicontinuous, bounded and of type (S+) with T positively homogeneous of degree one; (d) quasi-bounded and satisfies a generalized (S+)-condition w.r.t. the operator T, while T is positively homogeneous of degree one. Solutions are sought for the problem (∗) lying in the set D(T + C) ∩ (G1 \ G2). Nontrivial solutions of (∗) exist even when C(0) = 0. The degree theories of Leray and Schauder, Browder, and Skrypnik as well as the degree theory by Kartsatos and Skrypnik for densely defined operators T, C are used. The last three degree theories do not assume any compactness conditions on the operator C. The excision and additivity properties of these degree theories are employed, and the main results are significant extensions or generalizations of previous results by Krasnoselskii, Guo, Ding and Kartsatos involving the relaxation of compactness conditions and/or conditions on the boundedness of the operator T. Moreover, a new degree theory developed by Kartsatos and Skrypnik has been used to prove a similar result for operators of type T + C, where T : X ⊃ D(T) → 2 X∗ is a multi-valued maximal monotone operator, with 0 ∈ D(T) and 0 ∈ T(0), and C : X ⊃ D(C) → X∗ is a densely defined quasi-bounded and finitely continuous operator of type (S˜+). The problem of existence of nonzero solutions for T x + Cx + Gx 3 0 is also considered. Here, T is maximal monotone, C is bounded demicontinuous of type (S+), and G is of class (P). Eigenvalue and invariance of domain results have also been established for the sum L + T + C : G ∩ D(L) → 2 X∗ , where G ⊂ X is open and bounded, L : X ⊃ D(L) → X∗ densely defined linear maximal monotone, T : X → 2X∗ bounded maximal monotone, and C : G → X∗ bounded demicontinuous of type (S+) w. r. t. D(L).
12

Well-posedness and causality for a class of evolutionary inclusions

Trostorff, Sascha 05 December 2011 (has links) (PDF)
We study a class of differential inclusions involving maximal monotone relations, which cover a huge class of problems in mathematical physics. For this purpose we introduce the time derivative as a continuously invertible operator in a suitable Hilbert space. It turns out that this realization is a strictly monotone operator and thus, the question on existence and uniqueness can be answered by well-known results in the theory of maximal monotone relations. Furthermore, we show that the resulting solution operator is Lipschitz-continuous and causal, which is a natural property of evolutionary processes. Finally, the results are applied to a system of partial differential equations and inclusions, which describes the diffusion of a compressible fluid through a saturated, porous, plastically deforming media, where certain hysteresis phenomena are modeled by maximal montone relations.
13

Algoritmo do ponto proximal para operadores não monótonos / Proximal point algorithm for non-monotone operators

Baygorrea Cusihuallpa, Nancy, 1982- 22 August 2018 (has links)
Orientador: Roberto Andreani / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matemática, Estatística e Computação Científica / Made available in DSpace on 2018-08-22T06:15:13Z (GMT). No. of bitstreams: 1 BaygorreaCusihuallpa_Nancy_M.pdf: 1656614 bytes, checksum: 036b8eeb6a7f3e461c7ca051fed6fd3d (MD5) Previous issue date: 2013 / Resumo: Esta dissertação desenvolve um estudo detalhado da convergência local do método de ponto proximal para resolver o problema de encontrar zeros de operadores maximais sem a condição de monotonicidade. Em particular, é estudada a convergência dos métodos de multiplicadores proximais para resolver problemas de otimização não linear sem a condição de convexidade. Para obter os resultados desejados apresentaremos ferramentas de análise variacional para substituir a condição de monotonicidade maximal do operador como também, a teoria de dualidade generalizada para a aplicação do método de multiplicadores proximais. Apresentamos também uma aplicação do algoritmo do ponto proximal aos métodos dos multiplicadores para uma classe de problemas gerais baseados num esquema de dualidade generalizada / Abstract: In this dissertation we will develop a detailed study of local convergence of proximal point method for finding a root of maximal operators without monotonicity. In particular, it is studied the convergence for proximal method of multipliers by solving nonlinear optimization problems without convexity conditions. In order to obtain the desired results we will study some variational analysis tools to replace maximal monotonicity condition of operators as well as general duality theory which is t reacted to study an application to proximal method of multipliers. Also, we show an application of the proximal point algorithm to the multipliers methods for a class of problems which is based in general duality scheme / Mestrado / Matematica Aplicada / Mestra em Matemática Aplicada
14

Overcoming the failure of the classical generalized interior-point regularity conditions in convex optimization. Applications of the duality theory to enlargements of maximal monotone operators

Csetnek, Ernö Robert 08 December 2009 (has links)
The aim of this work is to present several new results concerning duality in scalar convex optimization, the formulation of sequential optimality conditions and some applications of the duality to the theory of maximal monotone operators. After recalling some properties of the classical generalized interiority notions which exist in the literature, we give some properties of the quasi interior and quasi-relative interior, respectively. By means of these notions we introduce several generalized interior-point regularity conditions which guarantee Fenchel duality. By using an approach due to Magnanti, we derive corresponding regularity conditions expressed via the quasi interior and quasi-relative interior which ensure Lagrange duality. These conditions have the advantage to be applicable in situations when other classical regularity conditions fail. Moreover, we notice that several duality results given in the literature on this topic have either superfluous or contradictory assumptions, the investigations we make offering in this sense an alternative. Necessary and sufficient sequential optimality conditions for a general convex optimization problem are established via perturbation theory. These results are applicable even in the absence of regularity conditions. In particular, we show that several results from the literature dealing with sequential optimality conditions are rediscovered and even improved. The second part of the thesis is devoted to applications of the duality theory to enlargements of maximal monotone operators in Banach spaces. After establishing a necessary and sufficient condition for a bivariate infimal convolution formula, by employing it we equivalently characterize the $\varepsilon$-enlargement of the sum of two maximal monotone operators. We generalize in this way a classical result concerning the formula for the $\varepsilon$-subdifferential of the sum of two proper, convex and lower semicontinuous functions. A characterization of fully enlargeable monotone operators is also provided, offering an answer to an open problem stated in the literature. Further, we give a regularity condition for the weak$^*$-closedness of the sum of the images of enlargements of two maximal monotone operators. The last part of this work deals with enlargements of positive sets in SSD spaces. It is shown that many results from the literature concerning enlargements of maximal monotone operators can be generalized to the setting of Banach SSD spaces.
15

Well-posedness and causality for a class of evolutionary inclusions

Trostorff, Sascha 25 October 2011 (has links)
We study a class of differential inclusions involving maximal monotone relations, which cover a huge class of problems in mathematical physics. For this purpose we introduce the time derivative as a continuously invertible operator in a suitable Hilbert space. It turns out that this realization is a strictly monotone operator and thus, the question on existence and uniqueness can be answered by well-known results in the theory of maximal monotone relations. Furthermore, we show that the resulting solution operator is Lipschitz-continuous and causal, which is a natural property of evolutionary processes. Finally, the results are applied to a system of partial differential equations and inclusions, which describes the diffusion of a compressible fluid through a saturated, porous, plastically deforming media, where certain hysteresis phenomena are modeled by maximal montone relations.
16

Random monotone operators and application to stochastic optimization / Opérateurs monotones aléatoires et application à l'optimisation stochastique

Salim, Adil 26 November 2018 (has links)
Cette thèse porte essentiellement sur l'étude d'algorithmes d'optimisation. Les problèmes de programmation intervenant en apprentissage automatique ou en traitement du signal sont dans beaucoup de cas composites, c'est-à-dire qu'ils sont contraints ou régularisés par des termes non lisses. Les méthodes proximales sont une classe d'algorithmes très efficaces pour résoudre de tels problèmes. Cependant, dans les applications modernes de sciences des données, les fonctions à minimiser se représentent souvent comme une espérance mathématique, difficile ou impossible à évaluer. C'est le cas dans les problèmes d'apprentissage en ligne, dans les problèmes mettant en jeu un grand nombre de données ou dans les problèmes de calcul distribué. Pour résoudre ceux-ci, nous étudions dans cette thèse des méthodes proximales stochastiques, qui adaptent les algorithmes proximaux aux cas de fonctions écrites comme une espérance. Les méthodes proximales stochastiques sont d'abord étudiées à pas constant, en utilisant des techniques d'approximation stochastique. Plus précisément, la méthode de l'Equation Differentielle Ordinaire est adaptée au cas d'inclusions differentielles. Afin d'établir le comportement asymptotique des algorithmes, la stabilité des suites d'itérés (vues comme des chaines de Markov) est étudiée. Ensuite, des généralisations de l'algorithme du gradient proximal stochastique à pas décroissant sont mises au point pour resoudre des problèmes composites. Toutes les grandeurs qui permettent de décrire les problèmes à résoudre s'écrivent comme une espérance. Cela inclut un algorithme primal dual pour des problèmes régularisés et linéairement contraints ainsi qu'un algorithme d'optimisation sur les grands graphes. / This thesis mainly studies optimization algorithms. Programming problems arising in signal processing and machine learning are composite in many cases, i.e they exhibit constraints and non smooth regularization terms. Proximal methods are known to be efficient to solve such problems. However, in modern applications of data sciences, functions to be minimized are often represented as statistical expectations, whose evaluation is intractable. This cover the case of online learning, big data problems and distributed computation problems. To solve this problems, we study in this thesis proximal stochastic methods, that generalize proximal algorithms to the case of cost functions written as expectations. Stochastic proximal methods are first studied with a constant step size, using stochastic approximation techniques. More precisely, the Ordinary Differential Equation method is adapted to the case of differential inclusions. In order to study the asymptotic behavior of the algorithms, the stability of the sequences of iterates (seen as Markov chains) is studied. Then, generalizations of the stochastic proximal gradient algorithm with decreasing step sizes are designed to solve composite problems. Every quantities used to define the optimization problem are written as expectations. This include a primal dual algorithm to solve regularized and linearly constrained problems and an optimization over large graphs algorithm.
17

Distributed Solutions for a Class of Multi-agent Optimization Problems

Xiaodong Hou (6259343) 10 May 2019 (has links)
Distributed optimization over multi-agent networks has become an increasingly popular research topic as it incorporates many applications from various areas such as consensus optimization, distributed control, network resource allocation, large scale machine learning, etc. Parallel distributed solution algorithms are highly desirable as they are more scalable, more robust against agent failure, align more naturally with either underlying agent network topology or big-data parallel computing framework. In this dissertation, we consider a multi-agent optimization formulation where the global objective function is the summation of individual local objective functions with respect to local agents' decision variables of different dimensions, and the constraints include both local private constraints and shared coupling constraints. Employing and extending tools from the monotone operator theory (including resolvent operator, operator splitting, etc.) and fixed point iteration of nonexpansive, averaged operators, a series of distributed solution approaches are proposed, which are all iterative algorithms that rely on parallel agent level local updates and inter-agent coordination. Some of the algorithms require synchronizations across all agents for information exchange during each iteration while others allow asynchrony and delays. The algorithms' convergence to an optimal solution if one exists are established by first characterizing them as fixed point iterations of certain averaged operators under certain carefully designed norms, then showing that the fixed point sets of these averaged operators are exactly the optimal solution set of the original multi-agent optimization problem. The effectiveness and performances of the proposed algorithms are demonstrated and compared through several numerical examples.<br>
18

Homogenization of Some Selected Elliptic and Parabolic Problems Employing Suitable Generalized Modes of Two-Scale Convergence

Persson, Jens January 2010 (has links)
<p>The present thesis is devoted to the homogenization of certain elliptic and parabolic partial differential equations by means of appropriate generalizations of the notion of two-scale convergence. Since homogenization is defined in terms of H-convergence, we desire to find the H-limits of sequences of periodic monotone parabolic operators with two spatial scales and an arbitrary number of temporal scales and the H-limits of sequences of two-dimensional possibly non-periodic linear elliptic operators by utilizing the theories for evolution-multiscale convergence and λ-scale convergence, respectively, which are generalizations of the classical two-scale convergence mode and custom-made to treat homogenization problems of the prescribed kinds. Concerning the multiscaled parabolic problems, we find that the result of the homogenization depends on the behavior of the temporal scale functions. The temporal scale functions considered in the thesis may, in the sense explained in the text, be slow or rapid and in resonance or not in resonance with respect to the spatial scale function. The homogenization for the possibly non-periodic elliptic problems gives the same result as for the corresponding periodic problems but with the exception that the local gradient operator is everywhere substituted by a differential operator consisting of a product of the local gradient operator and matrix describing the geometry and which depends, effectively, parametrically on the global variable.</p>
19

Homogenization of Some Selected Elliptic and Parabolic Problems Employing Suitable Generalized Modes of Two-Scale Convergence

Persson, Jens January 2010 (has links)
The present thesis is devoted to the homogenization of certain elliptic and parabolic partial differential equations by means of appropriate generalizations of the notion of two-scale convergence. Since homogenization is defined in terms of H-convergence, we desire to find the H-limits of sequences of periodic monotone parabolic operators with two spatial scales and an arbitrary number of temporal scales and the H-limits of sequences of two-dimensional possibly non-periodic linear elliptic operators by utilizing the theories for evolution-multiscale convergence and λ-scale convergence, respectively, which are generalizations of the classical two-scale convergence mode and custom-made to treat homogenization problems of the prescribed kinds. Concerning the multiscaled parabolic problems, we find that the result of the homogenization depends on the behavior of the temporal scale functions. The temporal scale functions considered in the thesis may, in the sense explained in the text, be slow or rapid and in resonance or not in resonance with respect to the spatial scale function. The homogenization for the possibly non-periodic elliptic problems gives the same result as for the corresponding periodic problems but with the exception that the local gradient operator is everywhere substituted by a differential operator consisting of a product of the local gradient operator and matrix describing the geometry and which depends, effectively, parametrically on the global variable.
20

Contribution à la stabilité de Lyapunov non-régulière des inclusions différentielles avec opérateurs monotones maximaux / Contribution to nonsmooth Lyapunov stability of differential inclusions with maximal monotone operators

Nguyen, Bao tran 31 October 2017 (has links)
Dans cette thèse de doctorat, nous apportons quelques contributions à la stabilité de Lyapunov non-régulière des inclusions différentielles de premier ordre avec opérateurs monotones maximaux, dans un cadre Hilbertien de dimension infini. Nous fournissons des caractérisations explicites, primales et/ou duales, des paires de Lyapunov faibles et fortes, dont les fonctions sont semi-continues inférieurement à valeurs réelles étendues, et associées à des inclusions différentielles dont la partie de droite est gouvernée par des perturbations Lipschitziennes des opérateurs dits Cusco F, ou des opérateurs monotones maximaux A, ou les deux à la fois x(t) ∈ F(x(t}} A(x(t}} t ≥ 0, x(0) ∈ domA. De manière équivalente, nous étudions l'invariance faible et forte des ensembles fermés pour ces inclusions différentielles. Comme dans L'approche classique de Lyapunov à la stabilité des équations différentielles, les résultats présentés dans cette thèse n'utilisent que les données du système différentiel; c'est-à-dire, l'opérateur A et la multifonction F, et donc pas besoin de connaître les solutions, ni les semi-groupes générés par les opérateurs monotones en question. Parce que les paires de Lyapunov sont formées par des fonctions qui sont simplement semi-continues inférieurement, et les ensembles invariants ne sont que ensembles fermés, nous faisons usage dans cette thèse à des outils de l'analyse non-lisse, afin de fournir des critères du premier ordre, utilisant des sous-différentiels généraux et des cônes normaux. Nous fournissons une analyse similaire pour les inclusions différentielles gouvernées par le cône normal proximal à des ensembles prox-réguliers. Notre analyse ci-dessus, nous a permis de présenter ces systèmes prox-réguliers d’apparence plus générale, comme des inclusions différentielles avec opérateurs monotones maximaux. Nous utilisons aussi nos résultats pour étudier la géométrie des opérateurs monotones maximaux, et plus précisément, la caractérisation de la frontière des valeurs de ces opérateurs seulement au moyen des valeurs situées à proximité, distinctes du point de référence. Ce résultat a des applications dans la stabilité des problèmes de la programmation semi-infinie. Nous utilisons également nos résultats sur les paires de Lyapunov et les ensembles invariants pour établir une étude systématique des observateurs de type Luenberger pour des inclusions différentielles avec des cônes normaux à des ensembles prox-réguliers. / In this PhD thesis, we make some contributions to nonsmooth Lyapunov stability of first-order differential inclusions with maximal monotone operators, in the setting of infinite-dimensional Hilbert spaces. We provide primal and dual explicit characterizations for parameterized weak and strong Lyapunov pairs of lower semicontinuous extended-real-valued functions, referred to as a-Lyapunov pairs, associated to differential inclusions with right-hand-sides governed by Lipschitz or Cusco perturbationsF of maximal monotone operators A, x(t) ∈ F(x(t}} A(x(t}} t ≥ 0, x(0) ∈ domA. Equivalently, we study the weak and strong invariance of sets with respect to such differential inclusions. As in the classical Lyapunov approach to the stability of differential equations, the presented results make use of only the data of the differential system; that is, the operator A and the multifunction F, and so no need to know about the solutions, nor the semi-groups generated by the monotone operators. Because our Lyapunov pairs and invariant sets candidates are just lower semicontinuous and closed, respectively, we make use of nonsmooth analysis to provide first-order-like criteria using general subdifferentials and normal cones. We provide similar analysis to non-convex differential inclusions governed by proximal normal cones to prox-regular sets. Our analysis above allowed to prove that such apparently more general systems can be easily coined into our convex setting. We also use our results to study the geometry of maximal monotone operators, and specifically, the characterization of the boundary of the values of such operators by means only of the values at nearby points, which are distinct of the reference point. This result has its application in the stability of semi-infinite programming problems. We also use our results on Lyapunov pairs and invariant sets to provide a systematic study of Luenberger-like observers design for differential inclusions with normal cones to prox-regular sets.

Page generated in 0.1043 seconds