In recent years, photovoltaic (PV) power production have seen an increase and the PV power systems are often located in the distribution grids close to the consumers. Since the distributions grids rarely are designed for power production, investigation of its effects is needed. It is seen in this thesis that PV power production will cause voltages to rise, potentially to levels exceeding the limits that grid owners have to abide by. A model of a distribution grid is developed in MathWorks MATLAB. The model contains a transformer, cables, households, energy storage systems (ESS:s) and photovoltaic power systems. The system is simulated by implementing a numerical Forward Backward Sweep Method, solving for powers, currents and voltages in the grid. PV power systems are added in different configurations along with different configurations of ESS:s. The results are analysed, primarily concerning voltages and voltage limits. It is concluded that addition of PV power production in the distribution grid affects voltages, more or less depending on where in the grid the systems are placed and what peak power they have. It is also concluded that having energy storage systems in the grid, changing the power factor of the inverter for the PV systems or lowering the transformer secondary-side voltage can bring the voltages down. / På senare tid har det skett en ökning i antalet solcellsanläggningar som installeras i elnätet och dessa är ofta placerade i distributionsnäten nära hushållen. Eftersom distributionsnäten sällan är dimensionerade för produktion så behöver man utreda effekten av det. I det här arbetet visas det att solcellsproduktion kommer att öka spänningen i elnätet, potentiellt så mycket att de gränser elnätsägarna måste hålla nätet inom överstigs. En modell över lågspänningsnätet skapas i MathWorks MATLAB. Modellen innehåller transformator, kablar, hushåll, energilager och solcellsanläggningar. Systemet simuleras med hjälp av en numerisk Forward Backward Sweep-lösare som beräknar effekter, strömmar och spänningar i elnätet. Solcellanläggningarna placeras ut i elnätet i olika konfigurationer tillsammans med olika konfigurationer av energilager. Resultaten från simuleringarna analyseras främst med avseende på spänningen i elnätet utifrån dess gränser. De slutsatser som dras i arbetet är att solcellsproduktion kommer att påverka spänningen, mycket beroende på var i elnätet anläggningarna placeras och storleken hos dem. Det visas också att energilager, justering av effektfaktor hos solcellsanläggningarna eller en spänningssänkning på transformatorns lågspänningssida kan få ner spänningen i elnätet. / <p>LiTH-ISY-EX--19/5194--SE</p>

Nous étudions la convergence de systèmes dynamiques vers des équilibres. En particulier, nous nous intéressons à deux types d'équilibres. D'une part, les solutions d'inéquations variationnelles sous contraintes qui interviennent aussi dans la résolution de problèmes d'optimisation hiérarchique. D'autre part l'état stable d'un système dynamique, c'est à dire l'état où l'énergie du système est nulle. Cette thèse est divisée en deux parties principales, chacune focalisée sur la recherche d'un de ces équilibres. Dans la première partie nous étudions une classe d'algorithmes explicite-implicites pour résoudre certaines inéquations variationnelles sous contraintes. Nous introduisons un algorithme proximal-gradient pénalisé, "splitting forward-backward penalty scheme". Ensuite, nous prouvons sa convergence ergodique faible vers un équilibre dans le cas général d'un opérateur maximal monotone, et sa convergence forte vers l'unique équilibre si l'opérateur est de plus fortement monotone. Nous appliquons aussi notre algorithme pour résoudre des problèmes d'optimisation sous contrainte ou hiérarchique dont les fonctions objectif et de pénalisation sont formées d'une partie lisse et d'une autre non lisse. En effet, nous démontrons la convergence faible de l'algorithme vers un optimum hiérarchique lorsque l'opérateur est le sous-différentiel d'une fonction convexe semi-continue inférieurement et propre. Nous généralisons ainsi plusieurs algorithmes connus et nous retrouvons leurs résultats de convergence en affaiblissant les hypothèses utilisées dans nombre d'entre eux.Dans la deuxième partie, nous étudions l'action d'un contrôle interne local sur la stabilisation indirecte d'un système dynamique couplé formé de trois équations d'ondes, le système de Bresse. Sous la condition d'égalité des vitesses de propagation des ondes, nous montrons la stabilité exponentielle du système. En revanche, quand les vitesses sont différentes, nous prouvons sa stabilité polynomiale et nous établissons un nouveau taux de décroissance polynomial de l'énergie. Ceci étend des résultats présents dans la littérature au sens où le contrôle est localement distribué (et non pas appliqué à tout le domaine) et nous améliorons le taux de décroissance polynomial de l'énergie pour des conditions au bord de type Dirichlet et Dirichlet-Neumann. / We study the convergence of dynamical systems towards equilibria. In particular, we are interested in two types of equilibria. On one hand solutions of constrained variational inequations that are also involved in the resolution of hierarchical optimization problems. On the other hand the stable state of a dynamical system, i.e. the state when the energy of the system is zero. The thesis is divided into two parts, each focused on one of these equilibria. In the first part, we study a class of forward-backward algorithms for solving constrained variational inequalities. We consider a splitting forward-backward penalty scheme. We prove the weak ergodic convergence of the algorithm to an equilibrium for a general maximal monotone operator, and the strong convergence to the unique equilibrium if the operator is an addition strongly monotone. We also apply our algorithm for solving constrained or hierarchical optimization problems whose objective and penalization functions are formed of a smooth and a non-smooth part. In fact, we show the weak convergence to a hierarchical optimum when the operator is the subdifferential of a closed convex proper function. We then generalize several known algorithms and we find their convergence results by weakening assumptions used in a number of them. In the second part, we study the action of a locally internal dissipation law in the stabilization of a linear dynamical system coupling three wave equations, the Bresse system. Under the equal speed wave propagation condition we show that the system is exponentially stable. Otherwise, when the speeds are different, we prove the polynomial stability and establish a new polynomial energy decay rate. This extends results presented in the literature in the sense that the dissipation law is locally distributed (and not applied in the whole domain) and we improve the polynomial energy decay rate with both types of boundary conditions, Dirichlet and Dirichlet-Neumann.

In this thesis, we study the existence of pathwise random periodic solutions to both the semilinear stochastic differential equations with linear multiplicative noise and the semilinear stochastic partial differential equations with linear multiplicative noise in a Hilbert space. We identify them as the solutions of coupled forward-backward infinite horizon stochastic integral equations in general cases, and then perform the argument of the relative compactness of Wiener-Sobolev spaces in C([0, T],L2Ω,Rd)) or C([0, T],L2(Ω x O)) and Schauder's fixed point theorem to show the existence of a solution of the coupled stochastic forward-backward infinite horizon integral equations.

Made available in DSpace on 2017-07-10T16:41:34Z (GMT). No. of bitstreams: 1 Dissert Jonattan Emanuel Sarmiento2.pdf: 1326992 bytes, checksum: eeb1918a0e5e9c45ad54043cd1ea9c5e (MD5) Previous issue date: 2016-06-23 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / In recent years there has been a great increase in the use of distributed generators. This occurred not only by advances in production technologies of small generators and frequency inverters, but also by the benefits that brings to the distribution systems and the incentive policies. In the analysis of these systems is essential to calculate the power flow and properly solve it and the modeling of the inverter should be reviewed together with its implementation in the method employed, attempting to the fact that the inverters are beginning to use advanced functions that can to provide ancillary services. In this work the modelling of inverter with advanced functions such as Basic Intelligent Volt-Var Control (BIVV) and Intelligent Volt-Var With Hysteresis (IVVH) are reviewed, therefore it is propose methods the implements this models in the method sweep. In proposal implementation it is use of elements of the sensitivity matrix of nodes PV defined in the compensation method. In the analyzed cases, the implementations were effectiveness achieving solutions in convergent values and in accordance to the control strategies. In the results of simulations there were differences in the operating points of the inverter acting on a node of the distribution system comparing the different modeling analyzed in different system load conditions and different levels of active power supply. When comparing the voltage profiles of the various modeling, in general notice that there is a greater variation when it has large reactive power capacity. If in the future of distributed generation evolve to provide reactive support as the ancillary service, it shall be careful properly modelling the inverter avoiding mistaken results that will affect the plans of the concessionaires. / Nos últimos anos verificou-se um grande aumento no uso de geradores distribuídos. Isso ocorreu não apenas pelos avanços nas tecnologias de produção de pequenos geradores e inversores de frequência, mas também pelos benefícios que estes trazem aos sistemas de distribuição e pelas políticas de incentivos. Nas análises desses sistemas é fundamental calcular o fluxo de potência e, para resolvê-lo adequadamente, deve-se revisar a modelagem do inversor e sua implementação no método empregado, atentando-se ao fato de que os inversores estão começando a utilizar funções avançadas passíveis de fornecer serviços ancilares. Neste trabalho são revisadas as modelagens dos inversores com funções avançadas, tais como o controle Basic Intelligent Volt-Var (BIVV) e Intelligent Volt-Var With Hysteresis (IVVH), além de propor métodos de implementação para o método da varredura. Nas implementações propostas se faz uso de elementos da matriz de sensibilidade dos nós PV definida no método da compensação. Nos casos analisados, as implementações tiveram eficácia, conseguindo atingir soluções em valores convergentes e em concordância às estratégias de controle. Já nos resultados das simulações, ilustram-se as diferenças dos pontos operativos do inversor atuando em um nó do sistema de distribuição comparando-se as diferentes modelagens analisadas em distintas condições de carga do sistema e diversos níveis de fornecimento de potência ativa. Ao comparar-se os perfis de tensão das diversas modelagens, em geral, nota-se que há uma variação maior quando se tem maior capacidade de potência reativa. Se no futuro a geração distribuída evoluir para prestar suporte de potência reativa como um serviço ancilar, é necessário tomar precauções para modelar adequadamente o inversor, de modo a evitar obter resultados equivocados que afetarão os planejamentos das concessionárias.

Cette thèse aborde deux sujets de recherches, le premier est sur l’existence et l’unicité des solutions des Équations Différentielles Doublement Stochastiques Rétrogrades (EDDSRs) et les Équations aux Dérivées partielles Stochastiques (EDPSs) multidimensionnelles à croissance surlinéaire. Le deuxième établit l’existence d’un contrôle optimal strict pour un système controlé dirigé par des équations différentielles stochastiques progressives rétrogrades (EDSPRs) couplées dans deux cas de diffusions dégénérée et non dégénérée.• Existence et unicité des solutions des EDDSRs multidimensionnels :Nous considérons EDDSR avec un générateur de croissance surlinéaire et une donnée terminale de carré intégrable. Nous introduisons une nouvelle condition locale sur le générateur et nous montrons qu’elle assure l’existence, l’unicité et la stabilité des solutions. Même si notre intérêt porte sur le cas multidimensionnel, notre résultat est également nouveau en dimension un. Comme application, nous établissons l’existence et l’unicité des solutions des EDPS semi-linéaires.• Contrôle des EDSPR couplées :Nous étudions un problème de contrôle avec une fonctionnelle coût non linéaire dont le système contrôlé est dirigé par une EDSPR couplée. L’objective de ce travail est d’établir l’existence d’un contrôle optimal dans la classe des contrôle stricts, donc on montre que ce contrôle vérifie notre équation et qu’il minimise la fonctionnelle coût. La méthode consiste à approcher notre système par une suite de systèmes réguliers et on montre la convergence. En passant à la limite, sous des hypothèses de convexité, on obtient l’existence d’un contrôle optimal strict. on suit cette méthode théorique pour deux cas différents de diffusions dégénérée et non dégénérée. / In this Phd thesis, we considers two parts. The first one establish the existence and the uniquness of the solutions of multidimensional backward doubly stochastic differential equations (BDSDEs in short) and the stochastic partial differential equations (SPDEs in short) in the superlinear growth generators. In the second part, we study the stochastic controls problems driven by a coupled Forward-Backward stochastic differentialequations (FBSDEs in short).• BDSDEs and SPDEs with a superlinear growth generators :We deal with multidimensional BDSDE with a superlinear growth generator and a square integrable terminal datum. We introduce new local conditions on the generator then we show that they ensure the existence and uniqueness as well as the stability of solutions. Our work go beyond the previous results on the subject. Although we are focused on multidimensional case, the uniqueness result we establish is new in one dimensional too. As application, we establish the existence and uniqueness of probabilistic solutions tosome semilinear SPDEs with superlinear growth generator. By probabilistic solution, we mean a solution which is representable throughout a BDSDEs.• Controlled coupled FBSDEs :We establish the existence of an optimal control for a system driven by a coupled FBDSE. The cost functional is defined as the initial value of the backward component of the solution. We construct a sequence of approximating controlled systems, for which we show the existence of a sequence of feedback optimal controls. By passing to the limit, we get the existence of a feedback optimal control. The convexity condition is used to ensure that the optimal control is strict. In this part, we study two cases of diffusions : degenerate and non-degenerate.

Dans plusieurs domaines des statistiques, y compris le traitement du signal et des images, l'estimation en grande dimension est une tâche importante pour recouvrer un objet d'intérêt. Toutefois, dans la grande majorité de situations, ce problème est mal-posé. Cependant, bien que la dimension ambiante de l'objet à restaurer (signal, image, vidéo) est très grande, sa ``complexité'' intrinsèque est généralement petite. La prise en compte de cette information a priori peut se faire au travers de deux approches: (i) la pénalisation (très populaire) et (ii) l'agrégation à poids exponentiels (EWA). L'approche penalisée vise à chercher un estimateur qui minimise une attache aux données pénalisée par un terme promouvant des objets de faible complexité (simples). L'EWA combine une famille des pré-estimateurs, chacun associé à un poids favorisant exponentiellement des pré-estimateurs, lesquels privilègent les mêmes objets de faible complexité.Ce manuscrit se divise en deux grandes parties: une partie théorique et une partie algorithmique. Dans la partie théorique, on propose l'EWA avec une nouvelle famille d'a priori favorisant les signaux parcimonieux à l'analyse par group dont la performance est garantie par des inégalités oracle. Ensuite, on analysera l'estimateur pénalisé et EWA, avec des a prioris généraux favorisant des objets simples, dans un cardre unifié pour établir des garanties théoriques. Deux types de garanties seront montrés: (i) inégalités oracle en prédiction, et (ii) bornes en estimation. On les déclinera ensuite pour des cas particuliers dont certains ont été étudiés dans littérature. Quant à la partie algorithmique, on y proposera une implémentation de ces estimateurs en alliant simulation Monte-Carlo (processus de diffusion de Langevin) et algorithmes d'éclatement proximaux, et montrera leurs garanties de convergence. Plusieurs expériences numériques seront décrites pour illustrer nos garanties théoriques et nos algorithmes. / In many areas of statistics, including signal and image processing, high-dimensional estimation is an important task to recover an object of interest. However, in the overwhelming majority of cases, the recovery problem is ill-posed. Fortunately, even if the ambient dimension of the object to be restored (signal, image, video) is very large, its intrinsic ``complexity'' is generally small. The introduction of this prior information can be done through two approaches: (i) penalization (very popular) and (ii) aggregation by exponential weighting (EWA). The penalized approach aims at finding an estimator that minimizes a data loss function penalized by a term promoting objects of low (simple) complexity. The EWA combines a family of pre-estimators, each associated with a weight exponentially promoting the same objects of low complexity.This manuscript consists of two parts: a theoretical part and an algorithmic part. In the theoretical part, we first propose the EWA with a new family of priors promoting analysis-group sparse signals whose performance is guaranteed by oracle inequalities. Next, we will analysis the penalized estimator and EWA, with a general prior promoting simple objects, in a unified framework for establishing some theoretical guarantees. Two types of guarantees will be established: (i) prediction oracle inequalities, and (ii) estimation bounds. We will exemplify them for particular cases some of which studied in the literature. In the algorithmic part, we will propose an implementation of these estimators by combining Monte-Carlo simulation (Langevin diffusion process) and proximal splitting algorithms, and show their guarantees of convergence. Several numerical experiments will be considered for illustrating our theoretical guarantees and our algorithms.

La diffusion Raman est réalisée dans la géométrie inhabituelle de diffusion « en avant » (fonctionnant schématiquement en ‘mode de transmission’) pour explorer la nature et les propriétés des modes phonon-polaritons (polaires) de divers cristaux mixtes A1-xBxC à base de ZnSe. Un aperçu général est recherché en sélectionnant des systèmes qui se rapportent au même composé parent par souci de cohérence - à savoir ZnSe - mais avec différentes structures cristallines, i.e. de type zincblende (cubique : Zn1-xBexSe, ZnSe1-xSx, ZnxCd1-xSe) et de type wurtzite (hexagonal : Zn1-xMgxSe). Les systèmes retenus englobent toute la panoplie des comportements dans le régime de phonons natifs (non polaires) des phonons-polaritons, y compris les déviations sur-diversifiées [1 × (AB), 2 × (AC)] et sous-diversifiées de 1 × (AB, AC) par rapport au type -nominal [1 × (AB), 1 × (AC)], également dénommées multi-mode, 1-mode-mixte et 2-mode, respectivement, dans la classification admise des spectres Raman classiques de cristaux mixtes obtenus dans la géométrie conventionnelle de rétrodiffusion (fonctionnant schématiquement dans en 'mode réflexion'). La modélisation du contour des spectres Raman phonon-polariton obtenus est réalisée dans le cadre de la théorie de la réponse diélectrique linéaire en se basant sur des mesures d’ellipsométrie de l'indice de réfraction, avec des calculs ab initio en appui réalisés sur des motifs d'impureté prototypes dans les limites diluées (x~0,1), pour sécuriser le jeu réduit de paramètres d'entrée qui régissent le comportement phonon de base (non polaire) des cristaux mixtes étudiés. La discussion des spectres Raman obtenus en rétrodiffusion /avant est effectuée dans le cadre du modèle de percolation développé au sein de l’équipe pour une compréhension renouvelée des spectres optiques de vibration des cristaux mixtes. Ce modèle formalise une vision des choses selon laquelle les liaisons chimiques d'une espèce donnée vibrent à des fréquences différentes dans un cristal mixte selon que leur environnement est de même type ou de type différent à l'échelle très locale (des premiers, voire des seconds voisins). [...] / Inelastic Raman scattering is implemented in the unusual (near-)forward scattering geometry (schematically operating in the ‘transmission mode’) to explore the nature and properties of the (polar) phonon-polariton modes of various ZnSe-based A1-xBxC mixed crystals. An overall insight is searched by selecting systems that relate to the same parent compound for the sake of consistency – namely ZnSe – but with different crystal structures, i.e. of the zincblende (cubic: Zn1-xBexSe, ZnSe1-xSx, ZnxCd1-xSe) and wurtzite (hexagonal: Zn1-xMgxSe) types. Most of all, altogether the retained systems span the full variety of behavior in the native (non polar) phonon regime of the phonon-polaritons, including the over-diversified [1×(A−B),2×(A−C)] and sub-diversified 1×(A−B,A−C) deviations with respect to the nominal [1×(A−B),1×(A−C)] type, also referred to as the multi-mode, 1-mixed-mode and 2-mode types, respectively, in the admitted classification of the conventional Raman spectra of mixed crystals taken in the backscattering geometry (schematically operating in the ‘reflection mode’). Fair contour modeling of the obtained phonon-polariton Raman spectra is achieved within the linear dielectric response theory based on ellipsometry measurements of the refractive index and with ab initio calculations in support done on prototypal impurity motifs in both dilute limits (x~0,1), as needed to secure the reduced set of input parameters that govern the native (non polar) phonon mode behavior of the used mixed crystals. The backward/near-forward Raman spectra are discussed within the scope of the so-called percolation model developed within our group for a renewed understanding of the optical vibration spectra of the mixed crystals. This model formalizes a view that the chemical bonds of a given species vibrate at different frequencies in a mixed crystal depending on their like or foreign environment at the very local (first- or second-neighbor) scale. This introduces a generic 1-bond→2-mode phonon behavior for a mixed crystal, presumably a universal one. The main results enunciate as follows. [...]

In this paper we propose an algorithm for solving systems of coupled monotone inclusions in Hilbert spaces. The operators arising in each of the inclusions of the system are processed in each iteration separately, namely, the single-valued are evaluated explicitly (forward steps), while the set-valued ones via their resolvents (backward steps). In addition, most of the steps in the iterative scheme can be executed simultaneously, this making the method applicable to a variety of convex minimization problems. The numerical performances of the proposed splitting algorithm are emphasized through applications in average consensus on colored networks and image classification via support vector machines.

Submitted by Erika Demachki (erikademachki@gmail.com) on 2015-05-21T19:19:51Z No. of bitstreams: 2 Tese - Reinier Díaz Millán - 2015.pdf: 3568052 bytes, checksum: b4c892f77911a368e1b8f629afb5e66e (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Approved for entry into archive by Erika Demachki (erikademachki@gmail.com) on 2015-05-21T19:21:31Z (GMT) No. of bitstreams: 2 Tese - Reinier Díaz Millán - 2015.pdf: 3568052 bytes, checksum: b4c892f77911a368e1b8f629afb5e66e (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) / Made available in DSpace on 2015-05-21T19:21:31Z (GMT). No. of bitstreams: 2 Tese - Reinier Díaz Millán - 2015.pdf: 3568052 bytes, checksum: b4c892f77911a368e1b8f629afb5e66e (MD5) license_rdf: 23148 bytes, checksum: 9da0b6dfac957114c6a7714714b86306 (MD5) Previous issue date: 2015-02-27 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / Nesta tese apresentamos v arios algoritmos para resolver os problemas de Desigualdade Variacional e Inclus~ao. Para o problema de desigualdade variacional propomos, no Cap tulo 2 uma generaliza c~ao do algoritmo cl assico extragradiente, utilizando vetores normais n~ao nulos do conjunto vi avel. Em particular, dois algoritmos conceituais s~ao propostos e cada um deles cont^em tr^es variantes diferentes de proje c~ao que est~ao relacionadas com algoritmos extragradientes modi cados. Duas buscas diferentes s~ao propostas, uma sobre a borda do conjunto vi avel e a outra ao longo das dire c~oes vi aveis. Cada algoritmo conceitual tem uma estrat egia diferente de busca e tr^es formas de proje c~ao especiais, gerando tr^es sequ^encias com diferente e interessantes propriedades. E feito a an alise da converg^encia de ambos os algoritmos conceituais, pressupondo a exist^encia de solu c~oes, continuidade do operador e uma condi c~ao mais fraca do que pseudomonotonia. No Cap tulo 4, n os introduzimos um algoritmo direto de divis~ao para o problema variacional em espa cos de Hilbert. J a no Cap tulo 5, propomos um algoritmo de proje c~ao relaxada em Espa cos de Hilbert para a soma de m operadores mon otonos maximais ponto-conjunto, onde o conjunto vi avel do problema de desigualdade variacional e dado por uma fun c~ao n~ao suave e convexa. Neste caso, as proje c~oes ortogonais ao conjunto vi avel s~ao substitu das por proje c~oes em hiperplanos que separam a solu c~ao da itera c~ao atual. Cada itera c~ao do m etodo proposto consiste em proje c~oes simples de tipo subgradientes, que n~ao exige a solu c~ao de subproblemas n~ao triviais, utilizando apenas os operadores individuais, explorando assim a estrutura do problema. Para o problema de Inclus~ao, propomos variantes do m etodo de divis~ao de forward-backward para achar um zero da soma de dois operadores, a qual e a modi ca c~ao cl assica do forwardbackward proposta por Tseng. Um algoritmo conceitual e proposto para melhorar o apresentado por Tseng em alguns pontos. Nossa abordagem cont em, primeramente, uma busca linear tipo Armijo expl cita no esp rito dos m etodos tipo extragradientes para desigualdades variacionais. Durante o processo iterativo, a busca linear realiza apenas um c alculo do operador forward-backward em cada tentativa de achar o tamanho do passo. Isto proporciona uma consider avel vantagem computacional pois o operador forward-backward e computacionalmente caro. A segunda parte do esquema consiste em diferentes tipos de proje c~oes, gerando sequ^encias com caracter sticas diferentes. / In this thesis we present various algorithms to solve the Variational Inequality and Inclusion Problems. For the variational inequality problem we propose, in Chapter 2, a generalization of the classical extragradient algorithm by utilizing non-null normal vectors of the feasible set. In particular, two conceptual algorithms are proposed and each of them has three di erent projection variants which are related to modi ed extragradient algorithms. Two di erent linesearches, one on the boundary of the feasible set and the other one along the feasible direction, are proposed. Each conceptual algorithm has a di erent linesearch strategy and three special projection steps, generating sequences with di erent and interesting features. Convergence analysis of both conceptual algorithms are established, assuming existence of solutions, continuity and a weaker condition than pseudomonotonicity on the operator. In Chapter 4 we introduce a direct splitting method for solving the variational inequality problem for the sum of two maximal monotone operators in Hilbert space. In Chapter 5, for the same problem, a relaxed-projection splitting algorithm in Hilbert spaces for the sum of m nonsmooth maximal monotone operators is proposed, where the feasible set of the variational inequality problem is de ned by a nonlinear and nonsmooth continuous convex function inequality. In this case, the orthogonal projections onto the feasible set are replaced by projections onto separating hyperplanes. Furthermore, each iteration of the proposed method consists of simple subgradient-like steps, which does not demand the solution of a nontrivial subproblem, using only individual operators, which explores the structure of the problem. For the Inclusion Problem, in Chapter 3, we propose variants of forward-backward splitting method for nding a zero of the sum of two operators, which is a modi cation of the classical forward-backward method proposed by Tseng. The conceptual algorithm proposed here improves Tseng's method in many instances. Our approach contains rstly an explicit Armijo-type line search in the spirit of the extragradient-like methods for variational inequalities. During the iterative process, the line search performs only one calculation of the forward-backward operator in each tentative for nding the step size. This achieves a considerable computational saving when the forward-backward operator is computationally expensive. The second part of the scheme consists of special projection steps bringing several variants.

Cette thèse s'inscrit dans le domaine des problèmes inverses en traitement du signal. Elle est consacrée à la conception d'algorithmes de restauration et de séparation de signaux parcimonieux et à leur application à l'approximation de courbes de forces en microscopie de force atomique (AFM), où la notion de parcimonie est liée au nombre de points de discontinuité dans le signal (sauts, changements de pente, changements de courbure). Du point de vue méthodologique, des algorithmes sous-optimaux sont proposés pour le problème de l'approximation parcimonieuse basée sur la pseudo-norme l0 : l'algorithme Single Best Replacement (SBR) est un algorithme itératif de type « ajout-retrait » inspiré d'algorithmes existants pour la restauration de signaux Bernoulli-Gaussiens. L'algorithme Continuation Single Best Replacement (CSBR) est un algorithme permettant de fournir des approximations à des degrés de parcimonie variables. Nous proposons aussi un algorithme de séparation de sources parcimonieuses à partir de mélanges avec retards, basé sur l'application préalable de l'algorithme CSBR sur chacun des mélanges, puis sur une procédure d'appariement des pics présents dans les différents mélanges. La microscopie de force atomique est une technologie récente permettant de mesurer des forces d'interaction entre nano-objets. L'analyse de courbes de forces repose sur des modèles paramétriques par morceaux. Nous proposons un algorithme permettant de détecter les régions d'intérêt (les morceaux) où chaque modèle s'applique puis d'estimer par moindres carrés les paramètres physiques (élasticité, force d'adhésion, topographie, etc.) dans chaque région. Nous proposons finalement une autre approche qui modélise une courbe de force comme un mélange de signaux sources parcimonieux retardées. La recherche des signaux sources dans une image force-volume s'effectue à partir d'un grand nombre de mélanges car il y autant de mélanges que de pixels dans l'image / This thesis handles several inverse problems occurring in sparse signal processing. The main contributions include the conception of algorithms dedicated to the restoration and the separation of sparse signals, and their application to force curve approximation in Atomic Force Microscopy (AFM), where the notion of sparsity is related to the number of discontinuity points in the signal (jumps, change of slope, change of curvature).In the signal processing viewpoint, we propose sub-optimal algorithms dedicated to the sparse signal approximation problem based on the l0 pseudo-norm : the Single Best Replacement algorithm (SBR) is an iterative "forward-backward" algorithm inspired from existing Bernoulli-Gaussian signal restoration algorithms. The Continuation Single Best Replacement algorithm (CSBR) is an extension providing approximations at various sparsity levels. We also address the problem of sparse source separation from delayed mixtures. The proposed algorithm is based on the prior application of CSBR on every mixture followed by a matching procedure which attributes a label for each peak occurring in each mixture.Atomic Force Microscopy (AFM) is a recent technology enabling to measure interaction forces between nano-objects. The force-curve analysis relies on piecewise parametric models. We address the detection of the regions of interest (the pieces) where each model holds and the subsequent estimation of physical parameters (elasticity, adhesion forces, topography, etc.) in each region by least-squares optimization. We finally propose an alternative approach in which a force curve is modeled as a mixture of delayed sparse sources. The research of the source signals and the delays from a force-volume image is done based on a large number of mixtures since there are as many mixtures as the number of image pixels