Log in

Relevant bibliographies by topics / Global function optimization / Dissertations / Theses

To see the other types of publications on this topic, follow the link: Global function optimization.

Dissertations / Theses on the topic 'Global function optimization'

Author: Grafiati

Published: 16 July 2024

Last updated: 31 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the top 33 dissertations / theses for your research on the topic 'Global function optimization.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.

1

Gutmann, H. M. "Radial basis function methods for global optimization." Thesis, University of Cambridge, 2002. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.599804.

Full text

Abstract:

In many real world optimization problems it is essential or desirable to determine the global minimum of the objective function. The subject of this dissertation is a new class of methods that tackle such problems. In particular, we have in mind problems where function evaluations are expensive and no additional information is available. The methods employ radial basis functions that have been proved to be useful for interpolation problems. Examples include thin plate splines and multiquadrics. Specifically, in each iteration, radial basis function interpolation is used to define a utility fun

APA, Harvard, Vancouver, ISO, and other styles

2

Bastani, Spencer, and Olov Andersson. "Stochastic Optimization in Dynamic Environments : with applications in e-commerce." Thesis, Linköping University, Department of Mathematics, 2007. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-8509.

Full text

Abstract:

<p>In this thesis we address the problem of how to construct an optimal algorithm for displaying banners (i.e advertisements shown on web sites). The optimization is based on the revenue each banner generates, with the aim of selecting those banners which maximize future total revenue. Banner optimality is of major importance in the e-commerce industry, in particular on web sites with heavy traffic. The 'micropayments' from showing banners add up to substantial profits due to the large volumes involved. We provide a broad, up-to-date and primarily theoretical treatment of this global optimizat

APA, Harvard, Vancouver, ISO, and other styles

3

Hatton, Marc. "Requirements specification for the optimisation function of an electric utility's energy flow simulator." Thesis, Stellenbosch : Stellenbosch University, 2015. http://hdl.handle.net/10019.1/96956.

Full text

Abstract:

Thesis (MEng)--Stellenbosch University, 2015.<br>ENGLISH ABSTRACT: Efficient and reliable energy generation capability is vital to any country's economic growth. Many strategic, tactical and operational decisions take place along the energy supply chain. Shortcomings in South Africa's electricity production industry have led to the development of an energy ow simulator. The energy ow simulator is claimed to incorporate all significant factors involved in the energy ow process from primary energy to end-use consumption. The energy ow simulator thus provides a decision support sys

APA, Harvard, Vancouver, ISO, and other styles

4

Al-Mharmah, Hisham. "Global optimization of stochastic functions." Diss., Georgia Institute of Technology, 1993. http://hdl.handle.net/1853/25665.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Sharikov, Evgenii. "Conditions for global minimum through abstract convexity." Thesis, University of Ballarat, 2008. http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/45930.

Full text

Abstract:

The theory of abstract convexity generalizes ideas of convex analysis by using the notion of global supports and the global definition of subdifferential. In order to apply this theory to optimization, we need to extend subdifferential calculus and separation properties into the area of abstract convexity.<br>Doctor of Philosophy

APA, Harvard, Vancouver, ISO, and other styles

6

Andramonov, Mikhail. "Global minimization of some classes of generalized convex functions." Thesis, Federation University Australia, 2001. http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/164850.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Fowkes, Jaroslav Mrazek. "Bayesian numerical analysis : global optimization and other applications." Thesis, University of Oxford, 2011. http://ora.ox.ac.uk/objects/uuid:ab268fe7-f757-459e-b1fe-a4a9083c1cba.

Full text

Abstract:

We present a unifying framework for the global optimization of functions which are expensive to evaluate. The framework is based on a Bayesian interpretation of radial basis function interpolation which incorporates existing methods such as Kriging, Gaussian process regression and neural networks. This viewpoint enables the application of Bayesian decision theory to derive a sequential global optimization algorithm which can be extended to include existing algorithms of this type in the literature. By posing the optimization problem as a sequence of sampling decisions, we optimize a general co

APA, Harvard, Vancouver, ISO, and other styles

8

Selassie, Abebe Geletu W. "A coarse solution of generalized semi-infinite optimization problems via robust analysis of marginal functions and global optimization." [S.l. : s.n.], 2004. http://deposit.ddb.de/cgi-bin/dokserv?idn=974862304.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Sultanova, Nargiz. "A class of Increasing Positively Homogeneous functions for which global optimization problem is NP-hard." Thesis, University of Ballarat, 2009. http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/44036.

Full text

Abstract:

It is well known that global optimization problems are, generally speaking, computationally infeasible, that is solving them would require an unreasonably large amount of time and/or space. In certain cases, for example, when objective functions and constraints are convex, it is possible to construct a feasible algorithm for solving global optimization problem successfully. Convexity, however, is not a phenomenon to be often expected in the applications. Nonconvex problems frequently arise in many industrial and scienti¯c areas. Therefore, it is only natural to try to replace convexity with so

APA, Harvard, Vancouver, ISO, and other styles

10

Sultanova, Nargiz. "A class of Increasing Positively Homogeneous functions for which global optimization problem is NP-hard." University of Ballarat, 2009. http://archimedes.ballarat.edu.au:8080/vital/access/HandleResolver/1959.17/16160.

Full text

Abstract:

It is well known that global optimization problems are, generally speaking, computationally infeasible, that is solving them would require an unreasonably large amount of time and/or space. In certain cases, for example, when objective functions and constraints are convex, it is possible to construct a feasible algorithm for solving global optimization problem successfully. Convexity, however, is not a phenomenon to be often expected in the applications. Nonconvex problems frequently arise in many industrial and scienti¯c areas. Therefore, it is only natural to try to replace convexity with so

APA, Harvard, Vancouver, ISO, and other styles

11

Cheon, Myun-Seok. "Global Optimization of Monotonic Programs: Applications in Polynomial and Stochastic Programming." Diss., Available online, Georgia Institute of Technology, 2005, 2005. http://etd.gatech.edu/theses/available/etd-04152005-130317/unrestricted/Cheon%5FMyunSeok%5F200505%5Fphd.pdf.

Full text

Abstract:

Thesis (Ph. D.)--Industrial & Systems Engineering, Georgia Institute of Technology, 2005.<br>Barnes, Earl, Committee Member ; Shapiro, Alex, Committee Member ; Realff, Matthew, Committee Member ; Al-Khayyal, Faiz, Committee Chair ; Ahmed, Shabbir, Committee Co-Chair. Includes bibliographical references.

APA, Harvard, Vancouver, ISO, and other styles

12

Olofsson, Karl-Johan. "Black-box optimization of simulated light extraction efficiency from quantum dots in pyramidal gallium nitride structures." Thesis, Linköpings universitet, Matematiska institutionen, 2019. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-162235.

Full text

Abstract:

Microsized hexagonal gallium nitride pyramids show promise as next generation Light Emitting Diodes (LEDs) due to certain quantum properties within the pyramids. One metric for evaluating the efficiency of a LED device is by studying its Light Extraction Efficiency (LEE). To calculate the LEE for different pyramid designs, simulations can be performed using the FDTD method. Maximizing the LEE is treated as a black-box optimization problem with an interpolation method that utilizes radial basis functions. A simple heuristic is implemented and tested for various pyramid parameters. The LEE is sh

APA, Harvard, Vancouver, ISO, and other styles

13

Niu, Yi Shuai. "Programmation DC et DCA en optimisation combinatoire et optimisation polynomiale via les techniques de SDP : codes et simulations numériques." Phd thesis, INSA de Rouen, 2010. http://tel.archives-ouvertes.fr/tel-00557911.

Full text

Abstract:

L'objectif de cette thèse porte sur des recherches théoriques et algorithmiques d'optimisation locale et globale via les techniques de programmation DC & DCA, Séparation et Evaluation (SE) ainsi que les techniques de relaxation DC/SDP, pour résoudre plusieurs types de problèmes d'optimisation non convexe (notamment en Optimisation Combinatoire et Optimisation Polynomiale). La thèse comporte quatre parties :La première partie présente les outils fondamentaux et les techniques essentielles en programmation DC & l'Algorithme DC (DCA), ainsi que les techniques de relaxation SDP, et les méthodes de

APA, Harvard, Vancouver, ISO, and other styles

14

Stöcker, Martin. "Globale Optimierungsverfahren, garantiert globale Lösungen und energieeffiziente Fahrzeuggetriebe." Doctoral thesis, Universitätsbibliothek Chemnitz, 2015. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-166805.

Full text

Abstract:

Der Schwerpunkt der vorliegenden Arbeit liegt auf Methoden zur Lösung nichtlinearer Optimierungsprobleme mit der Anforderung, jedes globale Optimum garantiert zu finden und mit einer im Voraus festgesetzten Genauigkeit zu approximieren. Eng verbunden mit dieser deterministischen Optimierung ist die Berechnung von Schranken für den Wertebereich einer Funktion über einem gegebenen Hyperquader. Verschiedene Ansätze, z. B. auf Basis der Intervallarithmetik, werden vorgestellt und analysiert. Im Besonderen werden Methoden zur Schrankengenerierung für multivariate ganz- und gebrochenrationale Polyno

APA, Harvard, Vancouver, ISO, and other styles

15

Rondina, Gustavo Garcia. "Novas ideias para o Método de Basin-Hopping Monte Carlo aplicado à otimização global de Clusters e Nanopartículas." Universidade de São Paulo, 2013. http://www.teses.usp.br/teses/disponiveis/76/76132/tde-17012014-161604/.

Full text

Abstract:

Neste trabalho é introduzido e avaliado um conjunto de novas ideias para aumentar a eficiência do método Basin-Hopping Monte Carlo (BHMC) aplicado à otimização global de clusters e nanopartículas, que resultou no método BHMC revisado. Dentro deste método, tomou-se o cuidado de manter as características fundamentais do método BHMC padrão, que consistem na transformação da superfície de energia potencial em um conjunto de basins de atração, e no emprego de amostragem de Monte Carlo utilizando o critério de Metropolis. As ideias por trás do método BHMC revisado incluem um grande conjunto de opera

APA, Harvard, Vancouver, ISO, and other styles

16

Clausner, André. "Anwendung von Line-Search-Strategien zur Formoptimierung und Parameteridentifikation." Master's thesis, Universitätsbibliothek Chemnitz, 2013. http://nbn-resolving.de/urn:nbn:de:bsz:ch1-qucosa-114858.

Full text

Abstract:

Die kontinuierliche Weiterentwicklung und Verbesserung technischer Prozesse erfolgt heute auf der Basis stochastischer und deterministischer Optimierungsstrategien in Kombination mit der numerischen Simulation dieser Abläufe. Da die FE-Simulation von Umformvorgängen in der Regel sehr zeitintensiv ist, bietet sich für die Optimierung solcher Prozesse der Einsatz deterministischer Methoden an, da hier weniger Optimierungsschritte und somit auch weniger FE-Simulationen notwendig sind. Eine wichtige Anforderung an solche Optimierungsverfahren ist globale Konvergenz zu lokalen Minima, da die optima

APA, Harvard, Vancouver, ISO, and other styles

17

Mokukcu, Mert. "Optimisation énergétique d'un véhicule hybride." Thesis, Université Paris-Saclay (ComUE), 2018. http://www.theses.fr/2018SACLC066/document.

Full text

Abstract:

Les progrès technologiques augmentent la complexité des systèmes énergétiques, ce qui permet d'avoir variés sources et architectures possibles. Si le contexte économique et écologique est également pris en compte, l'industrie automobile est menée à aligner sa production sur des véhicules hybrides ou électriques qui disposent d'une gestion de l'énergie sophistiquée. Ainsi, les études pour la conception sont orientées à l'optimisation et à la gestion de l'énergie en tenant compte les tendances des constructeurs : i) augmenter les performances des véhicules, ii) avoir des véhicules moins polluant

APA, Harvard, Vancouver, ISO, and other styles

18

Ben, Gharbia Ibtihel. "Résolution de problèmes de complémentarité. : Application à un écoulement diphasique dans un milieu poreux." Phd thesis, Université Paris Dauphine - Paris IX, 2012. http://tel.archives-ouvertes.fr/tel-00776617.

Full text

Abstract:

Les problèmes de complémentarité interviennent dans de nombreux domaines scientifiques : économie, mécanique des solides, mécanique des fluides. Ce n'est que récemment qu'ils ont commencé d'intéresser les chercheurs étudiant les écoulements et le transport en milieu poreux. Les problèmes de complémentarité sont un cas particulier des inéquations variationnelles. Dans cette thèse, on offre plusieurs contributions aux méthodes numériques pour résoudre les problèmes de complémentarité. Dans la première partie de cette thèse, on étudie les problèmes de complémentarité linéaires 0 6 x ⊥ (Mx+q) > 0

APA, Harvard, Vancouver, ISO, and other styles

19

Cuko, Andi. "Modelling nano-oxide materials with technological and environmental relevance : silica, titania and titanosilicates Predicting size-dependent emergence of crystallinity in nanomaterials: titania nanoclusters versus nanocrystals Global optimisation of hydroxylated silica clusters: A cascade Monte Carlo Basin Hopping approach." Thesis, Sorbonne université, 2018. http://www.theses.fr/2018SORUS368.

Full text

Abstract:

Dans cette thèse, nous nous concentrons sur la modélisation des nano matériaux à base de titane, de silice et de titanosilicate en raison de leur importance technologique. Pour de tels systèmes, d'abord, nous avons identifiez les structures plus stables au moyen des méthodes d'optimisation global. Dans un deuxième temps, nous avons étudié les propriétés structurelles, énergétiques et électroniques de ces nanoparticules en fonction de leur taille, en extrapolant parfois jusqu'à l'échelle macroscopique. Pour une telle caractérisation, nous avons utilisé des méthodes quantiques basées sur la Théo

APA, Harvard, Vancouver, ISO, and other styles

20

Kajee-Bagdadi, Zaakirah. "Differential evolution algorithms for constrained global optimization." Thesis, 2008. http://hdl.handle.net/10539/4733.

Full text

Abstract:

In this thesis we propose four new methods for solving constrained global optimization problems. The first proposed algorithm is a differential evolution (DE) algorithm using penalty functions for constraint handling. The second algorithm is based on the first DE algorithm but also incorporates a filter set as a diversification mechanism. The third algorithm is also based on DE but includes an additional local refinement process in the form of the pattern search (PS) technique. The last algorithm incorporates both the filter set and PS into the DE algorithm for constrained global optimiz

APA, Harvard, Vancouver, ISO, and other styles

21

(20390), Baolin Wu. "Evolutionary strategies for function optimization, fuzzy modeling and control." Thesis, 2001. https://figshare.com/articles/thesis/Evolutionary_strategies_for_function_optimization_fuzzy_modeling_and_control/26309032.

Full text

Abstract:

<p dir="ltr">Solving complex problems with evolutionary approaches has attracted increasing attention in recent years. The main advantage of such problem solving strategy is its robustness and ability to adapt to an unknown environment without explicit assumptions. </p><p dir="ltr">The aim of this thesis is to investigate evolutionary computation techniques and their applications in addressing three different problems - global function optimization, fuzzy modeling and control. We start by introducing the pertinent necessary background of evolutionary algorithms, and this is followed by a discu

APA, Harvard, Vancouver, ISO, and other styles

22

Hošala, Michal. "Riešenie problému globálnej optimalizácie využitím GPU." Master's thesis, 2014. http://www.nusl.cz/ntk/nusl-336205.

Full text

Abstract:

The global optimization problem -- i.e., the problem of finding global extreme points of given function on restricted domain of values -- often appears in many real-world applications. Improving efficiency of this task can reduce the latency of the application or provide more precise result since the task is usually solved by an approximative algorithm. This thesis focuses on the practical aspects of global optimization algorithms, especially in the domain of algorithmic trading data analysis. Successful implementations of the global optimization solver already exist for CPUs, but they are qui

APA, Harvard, Vancouver, ISO, and other styles

23

Schomburg, Helen. "New Algorithms for Local and Global Fiber Tractography in Diffusion-Weighted Magnetic Resonance Imaging." Doctoral thesis, 2017. http://hdl.handle.net/11858/00-1735-0000-0023-3F8B-F.

Full text

APA, Harvard, Vancouver, ISO, and other styles

24

Yi-Yin, Chiu. "Modified Particle Swarm Optimization for Solving the Global Optimization of Continuous Multimodal Functions." 2004. http://www.cetd.com.tw/ec/thesisdetail.aspx?etdun=U0009-0112200611323569.

Full text

APA, Harvard, Vancouver, ISO, and other styles

25

Yi-Yin, Chiu, and 邱怡瑛. "Modified Particle Swarm Optimization for Solving the Global Optimization of Continuous Multimodal Functions." Thesis, 2004. http://ndltd.ncl.edu.tw/handle/42490178787854981603.

Full text

Abstract:

碩士<br>元智大學<br>工業工程與管理學系<br>92<br>The development of the Particle Swarm Optimization (PSO) has been almost ten years since 1995. From that time on, a variety of modifications of the original PSO has been proposed by many PSO researchers. The evolutionary concept of PSO, simple in concept, easy to implement and computational efficient, is partly the motivation of this thesis. The performance of the original PSO on the solution quality and convergence speed becomes much aggravated while optimizing multimodal functions with higher dimension. This is the main objective of this research such that we

APA, Harvard, Vancouver, ISO, and other styles

26

Tian, Jing. "Global optimality conditions and optimization methods for polynomial programming problems and their applications." Thesis, 2014. http://researchonline.federation.edu.au/vital/access/HandleResolver/1959.17/94787.

Full text

Abstract:

The polynomial programming problem which has a polynomial objective function, either with no constraints or with polynomial constraints occurs frequently in engineering design, investment science, control theory, network distribution, signal processing and locationallocation contexts. Moreover, the polynomial programming problem is known to be Nondeterministic Polynomial-time hard (NP-hard). The polynomial programming problem has attracted a lot of attention, including quadratic, cubic, homogenous or normal quartic programming problems as special cases. Existing methods for solving polynomial

APA, Harvard, Vancouver, ISO, and other styles

27

Odat, Enas M. "Sequential Optimization of Global Sequence Alignments Relative to Different Cost Functions." Thesis, 2011. http://hdl.handle.net/10754/271672.

Full text

Abstract:

The purpose of this dissertation is to present a methodology to model global sequence alignment problem as directed acyclic graph which helps to extract all possible optimal alignments. Moreover, a mechanism to sequentially optimize sequence alignment problem relative to different cost functions is suggested. Sequence alignment is mostly important in computational biology. It is used to find evolutionary relationships between biological sequences. There are many algo- rithms that have been developed to solve this problem. The most famous algorithms are Needleman-Wunsch and Smith-Waterman that

APA, Harvard, Vancouver, ISO, and other styles

28

Geletu, W. Selassie Abebe Weber Gerhard-Wilhelm. "A coarse solution of generalized semi-infinite optimization problems via robust analysis of marginal functions and global optimization /." 2004. http://www.gbv.de/dms/ilmenau/toc/476348986.PDF.

Full text

APA, Harvard, Vancouver, ISO, and other styles

29

Neilson, Daniel. "A Study of Match Cost Functions and Colour Use In Global Stereopsis." Phd thesis, 2009. http://hdl.handle.net/10048/449.

Full text

Abstract:

Stereopsis is the process of inferring the distance to objects from two or more images. It has applications in areas such as: novel-view rendering, motion capture, autonomous navigation, and topographical mapping from remote sensing data. Although it sounds simple, in light of the effortlessness with which we are able to perform the task with our own eyes, a number of factors that make it quite challenging become apparent once one begins delving into computational methods of solving it. For example, occlusions that block part of the scene from being seen in one of the images, and changes in th

APA, Harvard, Vancouver, ISO, and other styles

30

Geletu, Abebe [Verfasser]. "A coarse solution of generalized semi-infinite optimization problems via robust analysis of marginal functions and global optimization / vorgelegt von Abebe Geletu W. Selassie." 2004. http://d-nb.info/974862304/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

31

Stöcker, Martin. "Globale Optimierungsverfahren, garantiert globale Lösungen und energieeffiziente Fahrzeuggetriebe." Doctoral thesis, 2014. https://monarch.qucosa.de/id/qucosa%3A20243.

Full text

Abstract:

Der Schwerpunkt der vorliegenden Arbeit liegt auf Methoden zur Lösung nichtlinearer Optimierungsprobleme mit der Anforderung, jedes globale Optimum garantiert zu finden und mit einer im Voraus festgesetzten Genauigkeit zu approximieren. Eng verbunden mit dieser deterministischen Optimierung ist die Berechnung von Schranken für den Wertebereich einer Funktion über einem gegebenen Hyperquader. Verschiedene Ansätze, z. B. auf Basis der Intervallarithmetik, werden vorgestellt und analysiert. Im Besonderen werden Methoden zur Schrankengenerierung für multivariate ganz- und gebrochenrationale Polyno

APA, Harvard, Vancouver, ISO, and other styles

32

Clausner, André. "Anwendung von Line-Search-Strategien zur Formoptimierung und Parameteridentifikation." Master's thesis, 2007. https://monarch.qucosa.de/id/qucosa%3A19910.

Full text

Abstract:

Die kontinuierliche Weiterentwicklung und Verbesserung technischer Prozesse erfolgt heute auf der Basis stochastischer und deterministischer Optimierungsstrategien in Kombination mit der numerischen Simulation dieser Abläufe. Da die FE-Simulation von Umformvorgängen in der Regel sehr zeitintensiv ist, bietet sich für die Optimierung solcher Prozesse der Einsatz deterministischer Methoden an, da hier weniger Optimierungsschritte und somit auch weniger FE-Simulationen notwendig sind. Eine wichtige Anforderung an solche Optimierungsverfahren ist globale Konvergenz zu lokalen Minima, da die optima

APA, Harvard, Vancouver, ISO, and other styles

33

Nkwanyana, Thamsanqa Bongani. "Multi-input multi-output proportional integral derivative controller tuning based on improved particle swarm optimization." Diss., 2021. http://hdl.handle.net/10500/27692.

Full text

Abstract:

The PID controller is regarded as a dependable and reliable controller for process industry systems. Many researchers have devoted time and attention to PID controller tuning and they all agree that PID controllers are very important for control systems. A PID equation is very sensitive; its parameters must always be varied following the specific application to increase performance, such as by increasing the system’s responsiveness. PID controllers still have many problems despite their importance for control systems in industries. The problem of big overshoot on the conventional gain tuning i

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!