No description available.

La caractérisation fine des matériaux inorganiques nécessite d'avoir accès à des informations complémentaires de celles apportées par des techniques d'analyse élémentaire ou de diffraction. La spectroscopie infrarouge à transformée de Fourier permet de caractériser les liaisons covalentes et l'environnement des groupes fonctionnels dans les matériaux. C'est donc une technique de choix pour l'étude des matériaux hydratés, amorphes ou sujets à des phénomènes de vieillissement. En couplant cette technique à une platine de déplacement, il est possible de réaliser des cartographies des phases sur quelques centimètres carrés : c'est la microscopie infrarouge. Cette thèse développe plus particulièrement l'utilisation de la lumière réfléchie au travers de l'étude de la réflexion spéculaire et de la réflexion totale atténuée (ATR).Après une première partie se focalisant sur les méthodes d'acquisitions disponibles, une seconde partie s'attache à obtenir de manière non supervisée les cartographies chimiques associées aux concentrations relatives des différents composants présents dans la zone analysée. Des techniques de réduction de données et d'analyse factorielle sont mises en place afin d'estimer le nombre de composants chimiques et leurs spectres relatifs ; des problèmes de minimisation sous contraintes sont résolus pour extraire l'information chimique. La réflexion spéculaire ne nécessite aucun contact avec l‘échantillon et, de ce fait, n'entraine aucune altération de la surface analysée. C'est sur le papier une technique de choix pour suivre l'évolution d'un matériau. Cependant, elle souffre de la complexité d'interprétation liée à l'allure des spectres obtenus. Afin de développer la cartographie issue de la réflexion spéculaire, des modèles prenant en compte l'optique géométrique, l'optique ondulatoire, des corrections d'interférogrammes et des méthodes classiques d'homogénéisation ont été développés. Ce travail a permis d'aboutir à un modèle optique liant les spectres issus de la réflexion spéculaire avec les concentrations relatives des composants. Ce modèle tient compte de la polarisation, de l'angle d'incidence et utilise les constantes diélectriques du matériau. Ce modèle a été validé sur un matériau contenant trois composants distincts facilement identifiables en infrarouge et spécialement mis en forme pour cette étude. Ce modèle a ouvert la voie à l'utilisation innovante de lumières polarisées elliptiquement pour déterminer l'indice de réfraction complexe d'un matériau. Ainsi, des spectroscopes infrarouges couplés à un accessoire de contrôle de l'angle d'incidence peuvent être utilisés en complément de l'ellipsométrie / Complementary information, to that provided by elemental analysis and diffraction techniques, is needed to characterize inorganic materials. Fourier Transform Infrared spectroscopy enables to characterize covalent bonds and the environment of functional groups in materials. Thus, it is a technique of interest to study hydrated materials, amorphous materials or any materials, which may experience ageing phenomena. By combining this technique with a micrometric motorized stage, cartographies of chemical compounds can be obtained on several square millimeters: this is the infrared microscopy technique. This Ph.D. thesis focuses on the use of reflected light, in particular through the study of specular reflection and of Attenuated Total Reflectance (ATR). After a first part focused on the different acquisition set-ups, a second part covers the unsupervised methodologies of resolution employed to obtain chemical maps. They result in one map for each component present in the analyzed area. Dimensions reduction techniques and multivariate statistics techniques are implemented to estimate the number of components and their infrared spectra; minimization problems under constraints are solved to retrieve chemical information. When specular reflection is used to acquire spectra, no contact is made with the sample, thus no damage of the analyzed area occurs during the acquisition. A priori, it is a great technique to study the evolution of a material. However, this technique suffers from the complexity of interpretation of the resulting spectra. With the objective to democratize the use of specular reflection to obtain chemical maps, models based on geometrical optics and including diffraction, correction of interferograms and classical homogenization techniques have been developed. This work resulted in an optical model linking the angle of incidence, the polarization state and the dielectric optical constants of the material with the reflected light, which is measured. A model material, constituted of three distinct phases, detectable in the infrared range, has specially been fabricated to validate this optical model. This model set the stage for the use of elliptically polarized light in the determining of the complex refractive indices of materials in the infrared range. Thanks to this development, infrared spectroscopes, equipped with a classical set-up to control the angle of incidence, can now be used in addition to ellipsometry techniques

Η παρούσα διδακτορική διατριβή πραγματεύεται το θέμα της αποδοτικής και με βεβαιότητα εύρεσης όλων των ριζών της παραμετρικής εξίσωσης f(x;[p]) = 0, μιας συνεχώς διαφορίσιμης συνάρτησης f με [p] ένα διάνυσμα που περιγράφει όλες τις παραμέτρους της παραμετρικής εξίσωσης και τυποποιούνται με τη μορφή διαστημάτων. Για την επίλυση αυτού του προβλήματος χρησιμοποιήθηκαν εργαλεία της Διαστηματικής Ανάλυσης. Το κίνητρο για την ερευνητική ενασχόληση με το παραπάνω πρόβλημα προέκυψε μέσα από ένα κλασικό πρόβλημα αριθμητικής ανάλυσης: την αριθμητική επίλυση συστημάτων πολυωνυμικών εξισώσεων μέσω διαστηματικής ανάλυσης. Πιο συγκεκριμένα, προτάθηκε μια ευρετική τεχνική αναδιάταξης του αρχικού πολυωνυμικού συστήματος που φαίνεται να βελτιώνει σημαντικά, κάθε φορά, τον χρησιμοποιούμενο επιλυτή. Η ανάπτυξη, καθώς και τα αποτελέσματα αυτής της εργασίας αποτυπώνονται στο Κεφάλαιο 2 της παρούσας διατριβής. Στο επόμενο Κεφάλαιο 3, προτείνεται μια μεθοδολογία για την αποδοτική και αξιόπιστη επίλυση μη-γραμμικών εξισώσεων με διαστηματικές παραμέτρους, δηλαδή την αποδοτική και αξιόπιστη επίλυση διαστηματικών εξισώσεων. Πρώτα, δίνεται μια νέα διατύπωση της Διαστηματικής Αριθμητικής και αποδεικνύεται η ισοδυναμία της με τον κλασσικό ορισμό. Στη συνέχεια, χρησιμοποιείται η νέα διατύπωση της Διαστηματικής Αριθμητικής ως θεωρητικό εργαλείο για την ανάπτυξη μιας επέκτασης της διαστηματικής μεθόδου Newton που δύναται να επιλύσει όχι μόνο κλασικές μη-παραμετρικές μη-γραμμικές εξισώσεις, αλλά και παραμετρικές (διαστηματικές) μη-γραμμικές εξισώσεις. Στο Κεφάλαιο 4 προτείνεται μια νέα προσέγγιση για την αριθμητική επίλυση του προβλήματος της Ολικής Βελτιστοποίησης με περιορισμούς διαστήματα, χρησιμοποιώντας τα αποτελέσματα του Κεφαλαίου 3. Το πρόβλημα της ολικής βελτιστοποίησης, ανάγεται σε πρόβλημα επίλυσης διαστηματικών εξισώσεων, και γίνεται εφικτή η επίλυσή του με τη βοήθεια των θεωρητικών αποτελεσμάτων και της αντίστοιχης μεθοδολογίας του Κεφαλαίου 3. Στο τελευταίο Κεφάλαιο δίνεται μια νέα αλγοριθμική προσέγγιση για το πρόβλημα της επίλυσης διαστηματικών πολυωνυμικών εξισώσεων. Η νέα αυτή προσέγγιση, βασίζεται και γενικεύει την εργασία των Hansen και Walster, οι οποίοι πρότειναν μια μέθοδο για την επίλυση διαστηματικών πολυωνυμικών εξισώσεων 2ου βαθμού. / In this dissertation the problem of finding reliably and with certainty all the zeros a pa-rameterized equation f(x;[p]) = 0, of a continuously differentiable function f is considered, where [p] is an interval vector describing all the parameters of the Equation, which are formed with interval numbers. For this kind of problem, methods of Interval Analysis are used. The incentive to this scientific research was emerged from a classic numerical analysis problem: the numerical solution of polynomial systems of equations using interval analysis. In particular, a heuristic reordering technique of the initial polynomial systems of equations is proposed. This approach seems to improve significantly the used solver. The proposed technique, as well as the results of this publication are presented in Chapter 2 of this dissertation. In the next Chapter 3, a methodology is proposed for solving reliably and efficiently parameterized (interval) equations. Firstly, a new formulation of interval arithmetic is given and the equivalence with the classic one is proved. Then, an extension of interval Newton method is proposed and developed, based on the new formulation of interval arithmetic. The new method is able to solve not only classic non-linear equations but, non-linear parameterized (interval) equation too. In Chapter 4 a new approach on solving the Box-Constrained Global Optimization problem is proposed, based on the results of Chapter 3. In details, the Box-Constrained Global Optimization problem is reduced to a problem of solving interval equations. The solution of this reduction is attainable through the methodology developed in Chapter 3. In the last Chapter of this dissertation a new algorithmic approach is given for the problem of solving reliably and with certainty an interval polynomial equation of degree $n$. This approach consists in a generalization of the work of Hansen and Walster. Hansen and Walster proposed a method for solving only quadratic interval polynomial equations

Submitted by Jaqueline Silva (jtas29@gmail.com) on 2016-12-09T17:10:49Z No. of bitstreams: 2 Tese - Edvaldo Elias de Almeida Batista - 2016.pdf: 1198471 bytes, checksum: 88d7db305f0cfe6be9b62496a226217f (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Approved for entry into archive by Jaqueline Silva (jtas29@gmail.com) on 2016-12-09T17:11:03Z (GMT) No. of bitstreams: 2 Tese - Edvaldo Elias de Almeida Batista - 2016.pdf: 1198471 bytes, checksum: 88d7db305f0cfe6be9b62496a226217f (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Made available in DSpace on 2016-12-09T17:11:03Z (GMT). No. of bitstreams: 2 Tese - Edvaldo Elias de Almeida Batista - 2016.pdf: 1198471 bytes, checksum: 88d7db305f0cfe6be9b62496a226217f (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2016-10-20 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / In this thesis, we study variational inequalities and generalized vector equilibrium problems. In Chapter 1, several results and basic definitions of Riemannian geometry are listed; we present the concept of the monotone vector field in Hadamard manifolds and many of their properties, besides, we introduce the concept of enlargement of a monotone vector field, and we display its properties in a Riemannian context. In Chapter 2, an inexact proximal point method for variational inequalities in Hadamard manifolds is introduced, and its convergence properties are studied; see [7]. To present our method, we generalize the concept of enlargement of monotone operators, from a linear setting to the Riemannian context. As an application, an inexact proximal point method for constrained optimization problems is obtained. In Chapter 3, we present an extragradient algorithm for variational inequality associated with the point-to-set vector field in Hadamard manifolds and study its convergence properties; see [8]. In order to present our method, the concept of enlargement of maximal monotone vector fields is used and its lower-semicontinuity is established to obtain the convergence of the method in this new context. In Chapter 4, we present a sufficient condition for the existence of a solution to the generalized vector equilibrium problem on Hadamard manifolds using a version of the KnasterKuratowski-Mazurkiewicz Lemma; see [6]. In particular, the existence of solutions to optimization, vector optimization, Nash equilibria, complementarity, and variational inequality is a special case of the existence result for the generalized vector equilibrium problem. / Nesta tese, estudamos desigualdades variacionais e o problema de equilíbrio vetorial generalizado. No Capítulo 1, vários resultados e definições elementares sobre geometria Riemanniana são enunciados; apresentamos o conceito de campo vetorial monótono e muitas de suas propriedades, além de introduzir o conceito de alargamento de um campo vetorial monótono e exibir suas propriedades em um contexto Riemanniano. No Capítulo 2, um método de ponto proximal inexato para desigualdades variacionais em variedades de Hadamard é introduzido e suas propriedades de convergência são estudadas; veja [7]. Para apresentar o nosso método, generalizamos o conceito de alargamento de operadores monótonos, do contexto linear ao contexto de Riemanniano. Como aplicação, é obtido um método de ponto proximal inexato para problemas de otimização com restrições. No Capítulo 3, apresentamos um algoritmo extragradiente para desigualdades variacionais associado a um campo vetorial ponto-conjunto em variedades de Hadamard e estudamos suas propriedades de convergência; veja [8]. A fim de apresentar nosso método, o conceito de alargamento de campos vetoriais monótonos é utilizado e sua semicontinuidade inferior é estabelecida, a fim de obter a convergência do método neste novo contexto. No Capítulo 4, apresentamos uma condição suficiente para a existência de soluções para o problema de equilíbrio vetorial generalizado em variedades de Hadamard usando uma versão do Lema Knaster-Kuratowski-Mazurkiewicz; veja [6]. Em particular, a existência de soluções para problemas de otimização, otimização vetorial, equilíbrio de Nash, complementaridade e desigualdades variacionais são casos especiais do resultado de existência do problema de equilíbrio vetorial generalizado.

Submitted by Renata Lopes (renatasil82@gmail.com) on 2016-05-16T17:51:25Z No. of bitstreams: 1 guilhermedeoliveiraalves.pdf: 1293169 bytes, checksum: a76074780b2af177b66be7c6435b16d1 (MD5) / Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2016-06-28T12:25:31Z (GMT) No. of bitstreams: 1 guilhermedeoliveiraalves.pdf: 1293169 bytes, checksum: a76074780b2af177b66be7c6435b16d1 (MD5) / Made available in DSpace on 2016-06-28T12:25:31Z (GMT). No. of bitstreams: 1 guilhermedeoliveiraalves.pdf: 1293169 bytes, checksum: a76074780b2af177b66be7c6435b16d1 (MD5) Previous issue date: 2015-09-18 / CAPES - Coordenação de Aperfeiçoamento de Pessoal de Nível Superior / O presente trabalho tem por objetivo apresentar uma nova metodologia para estimação estática de estados em sistemas de distribuição de energia elétrica que estima as correntes nos ramos como variáveis de estado utilizando medições de tensão e corrente de ramo fasoriais oriundas de unidades de medição fasorial (Phasor Measurement Units - PMUs). A metodologia consiste em resolver um problema de otimização não linear minimizando uma função objetivo quadrática associada com as medições e estados estimados sujeito às restrições de carga das barras da rede que não apresentam PMUs instaladas baseadas em dados históricos, sendo esta a principal contribuição deste trabalho. Uma proposta de alocação de PMUs também é apresentada e que consiste em alocar duas unidades em cada ramificação do sistema, uma no começo e outra no final do trecho, procurando utilizar o menor número possível e que não comprometa a qualidade dos estados estimados. A resolução do problema de otimização é realizada de duas formas, através da ‘toolbox fmincon’ do software Matlab, que é uma ferramenta muito utilizada na resolução de problemas de otimização, e através da implementação computacional do Método de Pontos Interiores com Barreira de Segurança (Safety Barrier Interior Point Method - SFTB - IPM) proposto na literatura utilizada. Durante o processo de estimação de estados são utilizadas medidas obtidas através de um fluxo de potência que simulam as PMUs instaladas nos sistemas analisados variando o carregamento de cada sistema em torno da sua média histórica de carga até atingir os limites superior e inferior estabelecidos, sendo verificado o comportamento do estimador de estados perante a ocorrência de ruídos brancos nas medidas de todos os sistemas analisados. Foram analisados um sistema de distribuição tutorial de 15 barras e três sistemas encontrados na literatura contendo 33, 50 e 70 barras respectivamente. No sistema tutorial e no de 70 barras foram incluídas unidades de geração distribuída para se verificar o comportamento do estimador de estados. Todos os resultados do processo de estimação de estados são obtidos com os dois métodos de resolução apresentados e são comparados o desempenho de cada método, principalmente em relação ao tempo computacional. Todos os resultados obtidos foram validados usando um programa de fluxo de potência convencional e apresentam boa precisão com valor de função objetivo baixo mesmo na presença de ruídos nas medidas refletindo de maneira confiável o real estado do sistema de distribuição, o que torna a metodologia proposta atraente. / This work aims at presenting a new methodology for static state estimation in electric power distribution systems which estimates the branch currents as state variables using voltage measurements and current phasor branch obtained from phasor measurement units (Phasor Measurement Units - PMUs). The methodology consists of solving a nonlinear optimization problem minimizing a quadratic objective function associated with the estimated measurements and states, subject to load constraints for the non monitored loads based on historical data, which is the main contribution of this work. A PMU allocation strategy is presented which consists of allocating two PMUs for each system branch, one at the beginning and another at the end, trying to use as little PMUs as possible in such a way that the quality of the estimated states are not compromised. The solution of the optimization problem is obtained through two ways, the first is the toolbox ‘fmincon’ from Matlab solver software which is a widely used tool in the optimization problem. The second is a computer implementation of interior point method with security barrier (SFTB - IPM) proposed in the literature. Comparisons of computing times and results obtained with both methods are shown. A power flow program is used to obtain the voltages and branch currents in order to emulate the PMUs data in the state estimation process. Additionaly the non monitored loads are varied from the minimum bounds to their maximum, allowing white noise errors from the PMUs measurements. A tutorial test system of 15 buses is fully explored and three IEEE test systems of 33, 50 and 70 buses are used to show the effectiveness of the proposed methodology. For the tutorial and 70 bus systems, distribued generation units were included to see the state estimator behavior. All results from the state estimation process are obtained considering the two presented solving methods and the computing times performance compared. The results obtained were validated using a conventional power flow program and have good accuracy with low objective function value even in the presence of white noise errors in the measurements reflecting the reliability of the proposed methodology, making it very attractive for distribution system monitoring.

Le progrès technologique nécessite des techniques de plus en plus sophistiquées et précises de traitement de matériaux. Nous étudions le traitement de matériaux par faisceaux de haute énergie : un jet d’eau abrasif, une sonde ionique focalisée, un laser. L’évolution de la surface du matériau sous l’action du faisceau de haute énergie est modélisée par une EDP. Cette équation contient l’ensemble des coefficients inconnus - les paramètres de calibration de mo- dèle. Les paramètres inconnus peuvent être calibrés par minimisation de la fonction coût, c’est-à-dire, la fonction qui décrit la différence entre le résultat de la modélisation et les données expérimentales. Comme la surface modélisée est une solution du problème d’EDP, cela rentre dans le cadre de l’optimisation sous contrainte d’EDP. L’identification a été rendue bien posée par la régularisation du type Tikhonov. Le gradient de la fonction coût a été obtenu en utilisant les deux méthodes : l’approche adjointe et la différen- ciation automatique. Une fois la fonction coût et son gradient obtenus, nous avons utilisé un minimiseur L-BFGS pour réaliser la minimisation.Le problème de la non-unicité de la solution a été résolu pour le problème de traitement par le jet d’eau abrasif. Des effets secondaires ne sont pas inclus dans le modèle. Leur impact sur le procédé de calibration a été évité. Ensuite, le procédé de calibration a été validé pour les données synthétiques et expérimentales. Enfin, nous avons proposé un critère pour distinguer facilement entre le régime thermique et non- thermique d’ablation par laser. / The technological progress demands more and more sophisticated and precise techniques of the treatment of materials. We study the machining of the material with the high energy beams: the abrasive waterjet, the focused ion beam and the laser. Although the physics governing the energy beam interaction with material is very different for different application, we can use the same approach to the mathematical modeling of these processes.The evolution of the material surface under the energy beam impact is modeled by PDE equation. This equation contains a set of unknown parameters - the calibration parameters of the model. The unknown parameters can be identified by minimization of the cost function, i.e., function that describes the differ- ence between the result of modeling and the corresponding experimental data. As the modeled surface is a solution of the PDE problem, this minimization is an example of PDE-constrained optimization problem. The identification problem was regularized using Tikhonov regularization. The gradient of the cost function was obtained both by using the variational approach and by means of the automatic differentiation. Once the cost function and its gradient calculated, the minimization was performed using L-BFGS minimizer.For the abrasive waterjet application the problem of non-uniqueness of numerical solution is solved. The impact of the secondary effects non included into the model is avoided as well. The calibration procedure is validated on both synthetic and experimental data.For the laser application, we presented a simple criterion that allows to distinguish between the thermal and non-thermal laser ablation regimes.

Indiana University-Purdue University Indianapolis (IUPUI) / Our ability to engineer materials is limited by our capacity to tailor the material’s microstructure morphology and predict resulting properties. The insufficient knowledge on microstructure-property relationship is due to complexity and randomness in all materials at different scales. The objective of this research is to establish a design optimization methodology for microstructured materials. The material design problem is stated as finding the optimum microstructure to maximize the desired performance satisfying material processing constrains. This problem has been solved in this thesis by means of numerical techniques through four main steps: microstructure characterization, model reconstruction, property evaluation, and optimization. Two methods of microstructure characterizations have been investigated along with the advantages and disadvantages of each method. The first microstructure characterization method is a statistical method which utilizes correlation functions to extract the microstructural information. Algorithms for calculating these correlations functions have been developed and optimized based on their computational cost using MATLAB software. The second microstructure characterization method is physical characterization which works based on evaluation of physical features in microstructured domain. These features have been measured by means of MATLAB codes. Three model reconstruction techniques are proposed based on these characterization methods and employed to generate material models for further evaluation. The first reconstructing algorithm uses statistical functions to reconstruct the statistical equivalent model through simulating annealing optimization method. The second algorithm uses cellular automaton concepts to simulate the grain growth utilizing physical descriptors, and the third one generates elliptical inclusions in a material matrix using physical characteristic of microstructure. The finite element method is used to analysis the mechanical behavior of material models. Several material samples with different microstructural characteristics have been generated to model the micro-scale design domain of AZ31 magnesium alloy and magnesium matrix composite with silicon carbide fibers. Then, surrogate models have been created based on these samples to approximate the entire design domain and demonstrate the sensitivity of the desired mechanical property to two independent microstructural features. Finally, the optimum microstructure characteristics of material samples for fracture strength maximization have been obtained.

Nichtglatte Optimierungsprobleme in reflexiven Banachräumen treten in vielen Anwendungen auf. Häufig wird angenommen, dass alle vorkommenden Nichtdifferenzierbarkeiten durch Lipschitz-stetige Operatoren wie abs, min und max gegeben sind. Bei solchen Problemen kann es sich zum Beispiel um optimale Steuerungsprobleme mit möglicherweise nicht glatten Zielfunktionen handeln, welche durch partielle Differentialgleichungen (PDG) eingeschränkt sind, die ebenfalls nicht glatte Terme enthalten können. Eine effiziente und robuste Lösung erfordert eine Kombination numerischer Simulationen und spezifischer Optimierungsalgorithmen. Lokal Lipschitz-stetige, nichtglatte Nemytzkii-Operatoren, welche direkt in der Problemformulierung auftreten, spielen eine wesentliche Rolle in der Untersuchung der zugrundeliegenden Optimierungsprobleme. In dieser Dissertation werden zwei spezifische Methoden und Algorithmen zur Lösung solcher nichtglatter Optimierungsprobleme in reflexiven Banachräumen vorgestellt und diskutiert. Als erste Lösungsmethode wird in dieser Dissertation die Minimierung von nichtglatten Operatoren in reflexiven Banachräumen mittels sukzessiver quadratischer Überschätzung vorgestellt, SALMIN. Ein neuartiger Optimierungsansatz für Optimierungsprobleme mit nichtglatten elliptischen PDG-Beschränkungen, welcher auf expliziter Strukturausnutzung beruht, stellt die zweite Lösungsmethode dar, SCALi. Das zentrale Merkmal dieser Methoden ist ein geeigneter Umgang mit Nichtglattheiten. Besonderes Augenmerk liegt dabei auf der zugrundeliegenden nichtglatten Struktur des Problems und der effektiven Ausnutzung dieser, um das Optimierungsproblem auf angemessene und effiziente Weise zu lösen. / Non-smooth optimization problems in reflexive Banach spaces arise in many applications. Frequently, all non-differentiabilities involved are assumed to be given by Lipschitz-continuous operators such as abs, min and max. For example, such problems can refer to optimal control problems with possibly non-smooth objective functionals constrained by partial differential equations (PDEs) which can also include non-smooth terms. Their efficient as well as robust solution requires numerical simulations combined with specific optimization algorithms. Locally Lipschitz-continuous non-smooth non-linearities described by appropriate Nemytzkii operators which arise directly in the problem formulation play an essential role in the study of the underlying optimization problems. In this dissertation, two specific solution methods and algorithms to solve such non-smooth optimization problems in reflexive Banach spaces are proposed and discussed. The minimization of non-smooth operators in reflexive Banach spaces by means of successive quadratic overestimation is presented as the first solution method, SALMIN. A novel structure exploiting optimization approach for optimization problems with non-smooth elliptic PDE constraints constitutes the second solution method, SCALi. The central feature of these methods is the appropriate handling of non-differentiabilities. Special focus lies on the underlying structure of the problem stemming from the non-smoothness and how it can be effectively exploited to solve the optimization problem in an appropriate and efficient way.

<p>Set-based methods have been leveraged in many engineering applications from robust control and global optimization, to probabilistic planning and estimation. While useful, these methods have most widely been applied to analysis over sets that are convex, due to their ease in both representation and calculation. The representation and analysis of nonconvex sets is inherently complex. When nonconvexity arises in design and control applications, the nonconvex set is often over-approximated by a convex set to provide conservative results. However, the level of conservatism may be large and difficult to quantify, often leading to trivial results and requiring repetitive analysis by the engineer. Nonconvexity is inherent and unavoidable in many applications, such as the analysis of hybrid systems and robust safety constraints. </p> <p>In this dissertation, I present a new nonconvex set representation named the hybrid zonotope. The hybrid zonotope builds upon a combination of recent advances in the compact representation of convex sets in the controls literature with methods leveraged in solving mixed-integer programming problems. It is shown that the hybrid zonotope is equivalent to the union of an exponential number of convex sets while using a linear number of continuous and binary variables in the set’s representation. I provide identities for, and derivations of, the set operations of hybrid zonotopes for linear mappings, Minkowski sums, generalized intersections, halfspace intersections, Cartesian products, unions, complements, point containment, set containment, support functions, and convex enclosures. I also provide methods for redundancy removal and order reduction to improve the compactness and computational efficiency of the represented sets. Therefore proving the hybrid zonotopes expressive power and applicability to many nonconvex set-theoretic methods. Beyond basic set operations, I specifically show how the exact forward and backward reachable sets of linear hybrid systems may be found using identities that are calculated algebraically and scale linearly. Numerical examples show the scalability of the proposed methods and how they may be used to verify the safety and performance of complex systems. These exact methods may also be used to evaluate the level of conservatism of the existing approximate methods provided in the literature.  </p>

In dieser Arbeit wird ein Algorithmus zur Lösung von endlichdimensionalen Optimierungsproblemen mit stückweise linearer Zielfunktion und stückweise linearen Nebenbedingungen vorgestellt. Dabei wird angenommen, dass die Funktionen in der sogenannten Abs-Linear Form, einer Matrix-Vektor-Darstellung, vorliegen. Mit Hilfe dieser Form lässt sich der Urbildraum in Polyeder zerlegen, so dass die Nichtglattheiten der stückweise linearen Funktionen mit den Kanten der Polyeder zusammenfallen können. Für die Klasse der abs-linearen Funktionen werden sowohl für den unbeschränkten als auch für den beschränkten Fall notwendige und hinreichende Optimalitätsbedingungen bewiesen, die in polynomialer Zeit verifiziert werden können. Für unbeschränkte stückweise lineare Optimierungsprobleme haben Andrea Walther und Andreas Griewank bereits 2019 mit der Active Signature Method (ASM) einen Lösungsalgorithmus vorgestellt. Aufbauend auf dieser Methode und in Kombination mit der Idee der aktiven Mengen Strategie zur Behandlung von Ungleichungsnebenbedingungen entsteht ein neuer Algorithmus mit dem Namen Constrained Active Signature Method (CASM) für beschränkte Probleme. Beide Algorithmen nutzen die stückweise lineare Struktur der Funktionen explizit aus, indem sie die Abs-Linear Form verwenden. Teil der Analyse der Algorithmen ist der Nachweis der endlichen Konvergenz zu lokalen Minima der jeweiligen Probleme sowie die Betrachtung effizienter Berechnung von Lösungen der in jeder Iteration der Algorithmen auftretenden Sattelpunktsysteme. Die numerische Performanz von CASM wird anhand verschiedener Beispiele demonstriert. Dazu gehören akademische Probleme, einschließlich bi-level und lineare Komplementaritätsprobleme, sowie Anwendungsprobleme aus der Gasnetzwerkoptimierung und dem Einzelhandel. / This thesis presents an algorithm for solving finite-dimensional optimization problems with a piecewise linear objective function and piecewise linear constraints. For this purpose, it is assumed that the functions are in the so-called Abs-Linear Form, a matrix-vector representation. Using this form, the domain space can be decomposed into polyhedra, so that the nonsmoothness of the piecewise linear functions can coincide with the edges of the polyhedra. For the class of abs-linear functions, necessary and sufficient optimality conditions that can be verified in polynomial time are given for both the unconstrained and the constrained case. For unconstrained piecewise linear optimization problems, Andrea Walther and Andreas Griewank already presented a solution algorithm called the Active Signature Method (ASM) in 2019. Building on this method and combining it with the idea of the Active Set Method to handle inequality constraints, a new algorithm called the Constrained Active Signature Method (CASM) for constrained problems emerges. Both algorithms explicitly exploit the piecewise linear structure of the functions by using the Abs-Linear Form. Part of the analysis of the algorithms is to show finite convergence to local minima of the respective problems as well as an efficient solution of the saddle point systems occurring in each iteration of the algorithms. The numerical performance of CASM is illustrated by several examples. The test problems cover academic problems, including bi-level and linear complementarity problems, as well as application problems from gas network optimization and inventory problems.