The goal of this thesis is two-fold. On the one hand, it pursues to provide a contribution to the conjugate duality by proposing a new duality concept, which can be understood as an umbrella for different meaningful perturbation methods. On the other hand, this thesis aims to investigate minimax location problems by means of the duality concept introduced in the first part of this work, followed by a numerical approach using epigraphical splitting methods. After summarizing some elements of the convex analysis as well as introducing important results needed later, we consider an optimization problem with geometric and cone constraints, whose objective function is a composition of n+1 functions. For this problem we propose a conjugate dual problem, where the functions involved in the objective function of the primal problem are decomposed. Furthermore, we formulate generalized interior point regularity conditions for strong duality and give necessary and sufficient optimality conditions. As applications of this approach we determine the formulae of the conjugate as well as the biconjugate of the objective function of the primal problem and analyze an optimization problem having as objective function the sum of reciprocals of concave functions. In the second part of this thesis we discuss in the sense of the introduced duality concept three classes of minimax location problems. The first one consists of nonlinear and linear single minimax location problems with geometric constraints, where the maximum of nonlinear or linear functions composed with gauges between pairs of a new and existing points will be minimized. The version of the nonlinear location problem is additionally considered with set-up costs. The second class of minimax location problems deals with multifacility location problems as suggested by Drezner (1991), where for each given point the sum of weighted distances to all facilities plus set-up costs is determined and the maximal value of these sums is to be minimized. As the last and third class the classical multifacility location problem with geometrical constraints is considered in a generalized form where the maximum of gauges between pairs of new facilities and the maximum of gauges between pairs of new and existing facilities will be minimized. To each of these location problems associated dual problems will be formulated as well as corresponding duality statements and necessary and sufficient optimality conditions. To illustrate the results of the duality approach and to give a more detailed characterization of the relations between the location problems and their corresponding duals, we consider examples in the Euclidean space. This thesis ends with a numerical approach for solving minimax location problems by epigraphical splitting methods. In this framework, we give formulae for the projections onto the epigraphs of several sums of powers of weighted norms as well as formulae for the projection onto the epigraphs of gauges. Numerical experiments document the usefulness of our approach for the discussed location problems.

Submitted by Erika Demachki (erikademachki@gmail.com) on 2018-03-23T22:13:05Z No. of bitstreams: 2 Tese - Thiago Rodrigues Cavalcante - 2018.pdf: 2200622 bytes, checksum: 39118adda6b7ceff14825da442b5be57 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Approved for entry into archive by Luciana Ferreira (lucgeral@gmail.com) on 2018-03-26T12:16:44Z (GMT) No. of bitstreams: 2 Tese - Thiago Rodrigues Cavalcante - 2018.pdf: 2200622 bytes, checksum: 39118adda6b7ceff14825da442b5be57 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) / Made available in DSpace on 2018-03-26T12:16:44Z (GMT). No. of bitstreams: 2 Tese - Thiago Rodrigues Cavalcante - 2018.pdf: 2200622 bytes, checksum: 39118adda6b7ceff14825da442b5be57 (MD5) license_rdf: 0 bytes, checksum: d41d8cd98f00b204e9800998ecf8427e (MD5) Previous issue date: 2018-02-27 / Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - CAPES / In the first two chapters, we consider the following problem \begin{equation*} \left \{ \begin{array}{rcll} \alpha \Delta^{2} u + \beta \Delta u & = & f(x,u)\, & \mbox{in}\,\, \Omega \\ u = \Delta u & = & 0 \, &\mbox{on } \,\,\, \partial \Omega, \end{array} \right. \end{equation*} where $\displaystyle{\Delta^{2} u = \Delta(\Delta u)-\,\mbox{biharmonic (fourth-order operator)}}$, $\alpha > 0$ and $ \beta \in \R.$ The subset $\displaystyle{ \Omega \subset \mathbb{R}^{N}\, (N \geq 4)}$ is as somooth bounded domain and $\displaystyle{ f \in C(\overline{\Omega} \times \mathbb{R},\mathbb{R}) }.$ In each of the results obtained, we will consider different technical hypotheses and characteristics for the nonlinear function $f$ e for the value of the constant $ \beta. $ In the third chapter, we study an equation of the concave type super linear, of the form: \begin{equation} \left \{ \begin{array}{rcll} \alpha \Delta^{2} u + \beta \Delta u & = & a(x)|u|^{s-2}u + f(x,u)\, & \mbox{in}\,\, \Omega \\ u = \Delta u & = & 0 \, &\mbox{on} \,\,\, \partial \Omega, \end{array} \right. \end{equation} where $\beta \in (-\infty, \alpha \lambda_{1}).$ We consider that the function $a \in L^{\infty} (\Omega)$ and $s \in (1,2).$ Finally, in the last chapter we will consider a fourth order problem in which nonlinearity is also of the convex concave type. More precisely, we study the following class of equations: \begin{equation} \left\{ \begin{aligned} \alpha \Delta^{2} u + \beta \Delta u & = \mu a(x)|u|^{q-2}u + b(x)|u|^{p-2}u&\,\,\,\,\ &\mbox{in}\,\, \Omega \\ u = \Delta u & = 0 & \,\,\,\,&\mbox{on} \,\, \partial \Omega, \end{aligned} \right. \end{equation} where the parameter $ \mu > 0 $, the powers $ 1 <q <2 <p <2 N / (N - 4) $. In addition we assume that the functions $ \displaystyle {a, b: \Omega \rightarrow \mathbb {R}}$ are continuous that can change signal and, $ a ^{+}, b ^{+} \neq 0. $ / Nos dois primeiros Capítulos, consideramos a seguinte classe de problemas: \begin{equation*} \left \{ \begin{array}{rcll} \alpha \Delta^{2} u + \beta \Delta u & = & f(x,u)\, & \mbox{em}\,\, \Omega \\ u = \Delta u & = & 0 \, &\mbox{sobre } \,\,\, \partial \Omega, \end{array} \right. \end{equation*} onde $\displaystyle{\Delta^{2} u = \Delta(\Delta u)-\,\mbox{biharmônico},}$ $\alpha > 0$ e $ \beta \in \R.$ O subconjunto $\displaystyle{ \Omega \subset \mathbb{R}^{N}\,(N \geq 4)}$ será um domínio limitado e a não linearidade $\displaystyle{ f \in C(\overline{\Omega} \times \mathbb{R},\mathbb{R}) }.$ Em cada um dos resultados obtidos, consideraremos hipóteses técnicas e características diferentes para a função não linear $f$ e para o valor da constante $\beta.$ No terceiro Capítulo, estudamos uma equação do tipo côncavo super linear, da forma: \begin{equation*} \left \{ \begin{array}{rcll} \alpha \Delta^{2} u + \beta \Delta u & = & a(x)|u|^{s-2}u + f(x,u)\, & \mbox{em}\,\, \Omega \\ u = \Delta u & = & 0 \, &\mbox{sobre } \,\,\, \partial \Omega, \end{array} \right. \end{equation*} onde $\alpha > 0$ e $\beta \in (-\infty, \alpha \lambda_{1})$. Consideramos que a função $a \in L^{\infty}(\Omega)$ e que $s \in (1,2).$ Por fim, no último Capítulo vamos considerar um problema de quarta ordem no qual a não linearidade é do tipo côncavo-convexa. Mais precisamente, estudamos a seguinte classe de equações: \begin{equation*} \left\{ \begin{aligned} \alpha \Delta^{2} u + \beta \Delta u & = \mu a(x)|u|^{q-2}u + b(x)|u|^{p-2}u&\,\,\,\,\ &\mbox{em}\,\, \Omega \\ u = \Delta u & = 0 & \,\,\,\,&\mbox{sobre} \,\, \partial \Omega, \end{aligned} \right. \end{equation*} onde o parâmetro $\mu > 0$ e as potências $ 1 < q < 2 < p < 2 N /(N - 4)$. Adicionalmente supomos que as funções $\displaystyle{a, b : \Omega \rightarrow \mathbb{R} }$ sejam contínuas podendo trocar de sinal em $\Omega$ e que $a^{+},b^{+} \neq 0.$

The goal of this thesis is two-fold. On the one hand, it pursues to provide a contribution to the conjugate duality by proposing a new duality concept, which can be understood as an umbrella for different meaningful perturbation methods. On the other hand, this thesis aims to investigate minimax location problems by means of the duality concept introduced in the first part of this work, followed by a numerical approach using epigraphical splitting methods. After summarizing some elements of the convex analysis as well as introducing important results needed later, we consider an optimization problem with geometric and cone constraints, whose objective function is a composition of n+1 functions. For this problem we propose a conjugate dual problem, where the functions involved in the objective function of the primal problem are decomposed. Furthermore, we formulate generalized interior point regularity conditions for strong duality and give necessary and sufficient optimality conditions. As applications of this approach we determine the formulae of the conjugate as well as the biconjugate of the objective function of the primal problem and analyze an optimization problem having as objective function the sum of reciprocals of concave functions. In the second part of this thesis we discuss in the sense of the introduced duality concept three classes of minimax location problems. The first one consists of nonlinear and linear single minimax location problems with geometric constraints, where the maximum of nonlinear or linear functions composed with gauges between pairs of a new and existing points will be minimized. The version of the nonlinear location problem is additionally considered with set-up costs. The second class of minimax location problems deals with multifacility location problems as suggested by Drezner (1991), where for each given point the sum of weighted distances to all facilities plus set-up costs is determined and the maximal value of these sums is to be minimized. As the last and third class the classical multifacility location problem with geometrical constraints is considered in a generalized form where the maximum of gauges between pairs of new facilities and the maximum of gauges between pairs of new and existing facilities will be minimized. To each of these location problems associated dual problems will be formulated as well as corresponding duality statements and necessary and sufficient optimality conditions. To illustrate the results of the duality approach and to give a more detailed characterization of the relations between the location problems and their corresponding duals, we consider examples in the Euclidean space. This thesis ends with a numerical approach for solving minimax location problems by epigraphical splitting methods. In this framework, we give formulae for the projections onto the epigraphs of several sums of powers of weighted norms as well as formulae for the projection onto the epigraphs of gauges. Numerical experiments document the usefulness of our approach for the discussed location problems.

Thesis (Ph.D. (Mathematics))--North-West University, Potchefstroom Campus, 2006.

Abstract does not display correctly / Thesis (Ph.D. (Mathematics))--North-West University, Potchefstroom Campus, 2006

Abstract does not display correctly / Thesis (Ph.D. (Mathematics))--North-West University, Potchefstroom Campus, 2006

Le réseau mobile d’Orange France comprend plus de 100 000 antennes 2G, 3G et 4G sur plusieurs bandes de fréquences sans compter les nombreuses femto-cells fournies aux clients pour résoudre les problèmes de couverture. Ces chiffres ne feront que s’accroître pour répondre à la demande sans cesse croissante des clients pour les données mobiles. Cela illustre le défi énorme que rencontrent les opérateurs de téléphonie mobile en général à savoir gérer un réseau aussi complexe tout en limitant les coûts d’opération pour rester compétitifs. Cette thèse s’attache à utiliser le concept SON (réseaux auto-organisants) pour réduire cette complexité en automatisant les tâches répétitives ou complexes. Plus spécifiquement, nous proposons des algorithmes d’optimisation automatique pour des scénarios liés à la densification par les small cells ou les antennes actives. Nous abordons les problèmes classiques d’équilibrage de charge mais avec un lien backhaul à capacité limitée et de coordination d’interférence que ce soit dans le domaine temporel (notamment avec le eICIC) ou le domaine fréquentiel. Nous proposons aussi des algorithmes d’activation optimale de certaines fonctionnalités lorsque cette activation n’est pas toujours bénéfique. Pour la formulation mathématique et la résolution de tous ces algorithmes, nous nous appuyons sur les résultats de l’approximation stochastique et de l’optimisation convexe. Nous proposons aussi une méthodologie systématique pour la coordination de multiples fonctionnalités SON qui seraient exécutées en parallèle. Cette méthodologie est basée sur les jeux concaves et l’optimisation convexe avec comme contraintes des inégalités matricielles linéaires. / The mobile network of Orange in France comprises more than 100 000 2G, 3G and 4G antennas with severalfrequency bands, not to mention many femto-cells for deep-indoor coverage. These numbers will continue toincrease in order to address the customers’ exponentially increasing need for mobile data. This is an illustrationof the challenge faced by the mobile operators for operating such a complex network with low OperationalExpenditures (OPEX) in order to stay competitive. This thesis is about leveraging the Self-Organizing Network(SON) concept to reduce this complexity by automating repetitive or complex tasks. We specifically proposeautomatic optimization algorithms for scenarios related to network densification using either small cells orActive Antenna Systems (AASs) used for Vertical Sectorization (VeSn), Virtual Sectorization (ViSn) and multilevelbeamforming. Problems such as load balancing with limited-capacity backhaul and interference coordination eitherin time-domain (eICIC) or in frequency-domain are tackled. We also propose optimal activation algorithms forVeSn and ViSn when their activation is not always beneficial. We make use of results from stochastic approximationand convex optimization for the mathematical formulation of the problems and their solutions. We also proposea generic methodology for the coordination of multiple SON algorithms running in parallel using results fromconcave game theory and Linear Matrix Inequality (LMI)-constrained optimization.