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.

It is known that fission yeast Schizosaccharomyces pombe maintains its nuclear envelope during mitosis and it undergoes an interesting shape change during cell division - from a spherical via an ellipsoidal and a peanut-like to a dumb-bell shape. However, the biomechanical system behind this amazing transformation is still not understood. What we know is, that the shape must change due to forces acting on the membrane surrounding the nucleus and the microtubule based mitotic spindle is thought to play a key role. To estimate the locations and directions of the forces, the shape of the nucleus was recorded by confocal light microscopy. But such data is often inhomogeneously labeled with gaps in the boundary, making classical segmentation impractical. In order to accurately determine the shape we developed a global parametric shape description method, based on a Fourier coordinate expansion. The method implicitly assumes a closed and smooth surface. We will calculate the geometrical properties of the 2-dimensional shape and extend it to 3-dimensional properties, assuming rotational symmetry. Using a mechanical model for the lipid bilayer and the so called Helfrich-Canham free energy we want to calculate the minimum energy shape while respecting system-specific constraints to the surface and the enclosed volume. Comparing it with the observed shape leads to the forces. This provides the needed research tools to study forces based on images.

It is known that fission yeast Schizosaccharomyces pombe maintains its nuclear envelope during mitosis and it undergoes an interesting shape change during cell division - from a spherical via an ellipsoidal and a peanut-like to a dumb-bell shape. However, the biomechanical system behind this amazing transformation is still not understood. What we know is, that the shape must change due to forces acting on the membrane surrounding the nucleus and the microtubule based mitotic spindle is thought to play a key role. To estimate the locations and directions of the forces, the shape of the nucleus was recorded by confocal light microscopy. But such data is often inhomogeneously labeled with gaps in the boundary, making classical segmentation impractical. In order to accurately determine the shape we developed a global parametric shape description method, based on a Fourier coordinate expansion. The method implicitly assumes a closed and smooth surface. We will calculate the geometrical properties of the 2-dimensional shape and extend it to 3-dimensional properties, assuming rotational symmetry. Using a mechanical model for the lipid bilayer and the so called Helfrich-Canham free energy we want to calculate the minimum energy shape while respecting system-specific constraints to the surface and the enclosed volume. Comparing it with the observed shape leads to the forces. This provides the needed research tools to study forces based on images.

The multiple constant multiplication (MCM) operation is a fundamental operation in digital signal processing (DSP) and digital image processing (DIP). Examples of the MCM are in finite impulse response (FIR) and infinite impulse response (IIR) filters, matrix multiplication, and transforms. The aim of this work is minimizing the complexity of the MCM operation using common subexpression elimination (CSE) technique and redundant number representations. The CSE technique searches and eliminates common digit patterns (subexpressions) among MCM coefficients. More common subexpressions can be found by representing the MCM coefficients using redundant number representations. A CSE algorithm is proposed that works on a type of redundant numbers called the zero-dominant set (ZDS). The ZDS is an extension over the representations of minimum number of non-zero digits called minimum Hamming weight (MHW). Using the ZDS improves CSE algorithms' performance as compared with using the MHW representations. The disadvantage of using the ZDS is it increases the possibility of overlapping patterns (digit collisions). In this case, one or more digits are shared between a number of patterns. Eliminating a pattern results in losing other patterns because of eliminating the common digits. A pattern preservation algorithm (PPA) is developed to resolve the overlapping patterns in the representations. A tree and graph encoders are proposed to generate a larger space of number representations. The algorithms generate redundant representations of a value for a given digit set, radix, and wordlength. The tree encoder is modified to search for common subexpressions simultaneously with generating of the representation tree. A complexity measure is proposed to compare between the subexpressions at each node. The algorithm terminates generating the rest of the representation tree when it finds subexpressions with maximum sharing. This reduces the search space while minimizes the hardware complexity. A combinatoric model of the MCM problem is proposed in this work. The model is obtained by enumerating all the possible solutions of the MCM that resemble a graph called the demand graph. Arc routing on this graph gives the solutions of the MCM problem. A similar arc routing is found in the capacitated arc routing such as the winter salting problem. Ant colony optimization (ACO) meta-heuristics is proposed to traverse the demand graph. The ACO is simulated on a PC using Python programming language. This is to verify the model correctness and the work of the ACO. A parallel simulation of the ACO is carried out on a multi-core super computer using C++ boost graph library.

This thesis deals with regularization parameter selection methods in the context of Tikhonov-type regularization with Poisson distributed data, in particular the reconstruction of images, as well as with the identification of the volatility surface from observed option prices. In Part I we examine the choice of the regularization parameter when reconstructing an image, which is disturbed by Poisson noise, with Tikhonov-type regularization. This type of regularization is a generalization of the classical Tikhonov regularization in the Banach space setting and often called variational regularization. After a general consideration of Tikhonov-type regularization for data corrupted by Poisson noise, we examine the methods for choosing the regularization parameter numerically on the basis of two test images and real PET data. In Part II we consider the estimation of the volatility function from observed call option prices with the explicit formula which has been derived by Dupire using the Black-Scholes partial differential equation. The option prices are only available as discrete noisy observations so that the main difficulty is the ill-posedness of the numerical differentiation. Finite difference schemes, as regularization by discretization of the inverse and ill-posed problem, do not overcome these difficulties when they are used to evaluate the partial derivatives. Therefore we construct an alternative algorithm based on the weak formulation of the dual Black-Scholes partial differential equation and evaluate the performance of the finite difference schemes and the new algorithm for synthetic and real option prices.

The aim of this thesis is to present new results concerning duality in scalar optimization. We show how the theory can be applied to optimization problems arising in the theory of risk measures, portfolio optimization and machine learning. First we give some notations and preliminaries we need within the thesis. After that we recall how the well-known Lagrange dual problem can be derived by using the general perturbation theory and give some generalized interior point regularity conditions used in the literature. Using these facts we consider some special scalar optimization problems having a composed objective function and geometric (and cone) constraints. We derive their duals, give strong duality results and optimality condition using some regularity conditions. Thus we complete and/or extend some results in the literature especially by using the mentioned regularity conditions, which are weaker than the classical ones. We further consider a scalar optimization problem having single chance constraints and a convex objective function. We also derive its dual, give a strong duality result and further consider a special case of this problem. Thus we show how the conjugate duality theory can be used for stochastic programming problems and extend some results given in the literature. In the third chapter of this thesis we consider convex risk and deviation measures. We present some more general measures than the ones given in the literature and derive formulas for their conjugate functions. Using these we calculate some dual representation formulas for the risk and deviation measures and correct some formulas in the literature. Finally we proof some subdifferential formulas for measures and risk functions by using the facts above. The generalized deviation measures we introduced in the previous chapter can be used to formulate some portfolio optimization problems we consider in the fourth chapter. Their duals, strong duality results and optimality conditions are derived by using the general theory and the conjugate functions, respectively, given in the second and third chapter. Analogous calculations are done for a portfolio optimization problem having single chance constraints using the general theory given in the second chapter. Thus we give an application of the duality theory in the well-developed field of portfolio optimization. We close this thesis by considering a general Support Vector Machines problem and derive its dual using the conjugate duality theory. We give a strong duality result and necessary as well as sufficient optimality conditions. By considering different cost functions we get problems for Support Vector Regression and Support Vector Classification. We extend the results given in the literature by dropping the assumption of invertibility of the kernel matrix. We use a cost function that generalizes the well-known Vapnik's ε-insensitive loss and consider the optimization problems that arise by using this. We show how the general theory can be applied for a real data set, especially we predict the concrete compressive strength by using a special Support Vector Regression problem.

This thesis deals with regularization parameter selection methods in the context of Tikhonov-type regularization with Poisson distributed data, in particular the reconstruction of images, as well as with the identification of the volatility surface from observed option prices. In Part I we examine the choice of the regularization parameter when reconstructing an image, which is disturbed by Poisson noise, with Tikhonov-type regularization. This type of regularization is a generalization of the classical Tikhonov regularization in the Banach space setting and often called variational regularization. After a general consideration of Tikhonov-type regularization for data corrupted by Poisson noise, we examine the methods for choosing the regularization parameter numerically on the basis of two test images and real PET data. In Part II we consider the estimation of the volatility function from observed call option prices with the explicit formula which has been derived by Dupire using the Black-Scholes partial differential equation. The option prices are only available as discrete noisy observations so that the main difficulty is the ill-posedness of the numerical differentiation. Finite difference schemes, as regularization by discretization of the inverse and ill-posed problem, do not overcome these difficulties when they are used to evaluate the partial derivatives. Therefore we construct an alternative algorithm based on the weak formulation of the dual Black-Scholes partial differential equation and evaluate the performance of the finite difference schemes and the new algorithm for synthetic and real option prices.

The aim of this thesis is to present new results concerning duality in scalar optimization. We show how the theory can be applied to optimization problems arising in the theory of risk measures, portfolio optimization and machine learning. First we give some notations and preliminaries we need within the thesis. After that we recall how the well-known Lagrange dual problem can be derived by using the general perturbation theory and give some generalized interior point regularity conditions used in the literature. Using these facts we consider some special scalar optimization problems having a composed objective function and geometric (and cone) constraints. We derive their duals, give strong duality results and optimality condition using some regularity conditions. Thus we complete and/or extend some results in the literature especially by using the mentioned regularity conditions, which are weaker than the classical ones. We further consider a scalar optimization problem having single chance constraints and a convex objective function. We also derive its dual, give a strong duality result and further consider a special case of this problem. Thus we show how the conjugate duality theory can be used for stochastic programming problems and extend some results given in the literature. In the third chapter of this thesis we consider convex risk and deviation measures. We present some more general measures than the ones given in the literature and derive formulas for their conjugate functions. Using these we calculate some dual representation formulas for the risk and deviation measures and correct some formulas in the literature. Finally we proof some subdifferential formulas for measures and risk functions by using the facts above. The generalized deviation measures we introduced in the previous chapter can be used to formulate some portfolio optimization problems we consider in the fourth chapter. Their duals, strong duality results and optimality conditions are derived by using the general theory and the conjugate functions, respectively, given in the second and third chapter. Analogous calculations are done for a portfolio optimization problem having single chance constraints using the general theory given in the second chapter. Thus we give an application of the duality theory in the well-developed field of portfolio optimization. We close this thesis by considering a general Support Vector Machines problem and derive its dual using the conjugate duality theory. We give a strong duality result and necessary as well as sufficient optimality conditions. By considering different cost functions we get problems for Support Vector Regression and Support Vector Classification. We extend the results given in the literature by dropping the assumption of invertibility of the kernel matrix. We use a cost function that generalizes the well-known Vapnik's ε-insensitive loss and consider the optimization problems that arise by using this. We show how the general theory can be applied for a real data set, especially we predict the concrete compressive strength by using a special Support Vector Regression problem.

Dans cette thèse, tout d’abord, nous faisons l’Analyse Mathématique du modèle exact du chauffage radiatif d’un corps semi-transparent $\Omega$ par une source radiative noire qui l’entoure. Il s’agit donc d’étudier le couplage d’un système d’Equations de Transfert Radiatif avec condition au bord de réflectivité indépendantes avec une équation de conduction de la chaleur non linéaire avec condition limite non linéaire de type Robin. Nous prouvons l’existence et l’unicité de la solution et nous démontrons des bornes uniformes sur la solution et les intensités radiatives dans chaque bande de longueurs d’ondes pour laquelle le corps est semi-transparent, en fonction de bornes sur les données, Deuxièmement, nous considérons le problème du contrôle optimal de la température absolue à l’intérieur du corps semi-transparent $\Omega$ en agissant sur la température absolue de la source radiative noire qui l’entoure. À cet égard, nous introduisons la fonctionnelle coût appropriée et l’ensemble des contrôles admissibles $T_{S}$, pour lesquels nous prouvons l’existence de contrôles optimaux. En introduisant l’espace des états et l’équation d’état, une condition nécessaire de premier ordre pour qu’un contrôle $T_{S}$ : t ! $T_{S}$ (t) soit optimal, est alors dérivée sous la forme d’une inéquation variationnelle en utilisant le théorème des fonctions implicites et le problème adjoint. Ensuite, nous considérons le problème de l’existence et de l’unicité d’une solution faible des équations de la thermoviscoélasticité dans une formulation mixte de type Hellinger- Reissner, la nouveauté par rapport au travail de M.E. Rognes et R. Winther (M3AS, 2010) étant ici l’apparition de la viscosité dans certains coefficients de l’équation constitutive, viscosité qui dépend dans ce contexte de la température absolue T(x, t) et donc en particulier du temps t. Enfin, nous considérons dans ce cadre le problème du contrôle optimal de la déformation du corps semi-transparent $\Omega$, en agissant sur la température absolue de la source radiative noire qui l’entoure. Nous prouvons l’existence d’un contrôle optimal et nous calculons la dérivée Fréchet de la fonctionnelle coût réduite. / This thesis begins with a rigorous mathematical analysis of the radiative heating of a semi-transparent body made of glass, by a black radiative source surrounding it. This requires the study of the coupling between quasi-steady radiative transfer boundary value problems with nonhomogeneous reflectivity boundary conditions (one for each wavelength band in the semi-transparent electromagnetic spectrum of the glass) and a nonlinear heat conduction evolution equation with a nonlinear Robin boundary condition which takes into account those wavelengths for which the glass behaves like an opaque body. We prove existence and uniqueness of the solution, and give also uniform bounds on the solution i.e. on the absolute temperature distribution inside the body and on the radiative intensities. Now, we consider the temperature $T_{S}$ of the black radiative source S surrounding the semi-transparent body $\Omega$ as the control variable. We adjust the absolute temperature distribution (x, t) 7! T(x, t) inside the semi-transparent body near a desired temperature distribution Td(·, ·) during the time interval of radiative heating ]0, tf [ by acting on $T_{S}$. In this respect, we introduce the appropriate cost functional and the set of admissible controls $T_{S}$, for which we prove the existence of optimal controls. Introducing the State Space and the State Equation, a first order necessary condition for a control $T_{S}$ : t 7! $T_{S}$ (t) to be optimal is then derived in the form of a Variational Inequality by using the Implicit Function Theorem and the adjoint problem. We come now to the goal problem which is the deformation of the semi-transparent body $\Omega$ by heating it with a black radiative source surrounding it. We introduce a weak mixed formulation of this thermoviscoelasticity problem and study the existence and uniqueness of its solution, the novelty here with respect to the work of M.E. Rognes et R. Winther (M3AS, 2010) being the apparition of the viscosity in some of the coefficients of the constitutive equation, viscosity which depends on the absolute temperature T(x, t) and thus in particular on the time t. Finally, we state in this setting the related optimal control problem of the deformation of the semi-transparent body $\Omega$, by acting on the absolute temperature of the black radiative source surrounding it. We prove the existence of an optimal control and we compute the Fréchet derivative of the associated reduced cost functional.

The importance of cooperative relaying communication in substituting for, or complementing, multiantenna systems is described, and a brief literature review is presented. Amplify-and-forward (AF) and decode-and-forward (DF) relaying are investigated and compared for a dual-hop relay channel. The optimal strategy, source and relay optimal power allocation, and maximum cooperative gain are determined for the relay channel. It is shown that while DF relaying is preferable to AF relaying for strong source-relay links, AF relaying leads to more gain for strong source-destination or relay-destination links. Superimposed and selection AF relaying are investigated for multirelay, dual-hop relaying. Selection AF relaying is shown to be globally strictly outage suboptimal. A necessary condition for the selection AF outage optimality, and an upper bound on the probability of this optimality are obtained. A near-optimal power allocation scheme is derived for superimposed AF relaying. The maximum instantaneous rates, outage probabilities, and average capacities of multirelay, dual-hop relaying schemes are obtained for superimposed, selection, and orthogonal DF relaying, each with parallel channel cooperation (PCC) or repetition-based cooperation (RC). It is observed that the PCC over RC gain can be as much as 4 dB for the outage probabilities and 8.5 dB for the average capacities. Increasing the number of relays deteriorates the capacity performance of orthogonal relaying, but improves the performances of the other schemes. The application of rateless codes to DF relaying networks is studied by investigating three single-relay protocols, one of which is new, and three novel, low complexity multirelay protocols for dual-hop networks. The maximum rate and minimum energy per bit and per symbol are derived for the single-relay protocols under a peak power and an average power constraint. The long-term average rate and energy per bit, and relay-to-source usage ratio (RSUR), a new performance measure, are evaluated for the single-relay and multirelay protocols. The new single-relay protocol is the most energy efficient single-relay scheme in most cases. All the multirelay protocols exhibit near-optimal rate performances, but are vastly different in the RSUR. Several future research directions for fixed-rate and rateless coded cooperative systems, and frameworks for comparing these systems, are suggested. / Communications