Dissertation > Excellent graduate degree dissertation topics show
Save Global Optimization with Method of Center
Author: LiuZhenJun
Tutor: MiHongHai
School: Hebei University of Technology
Course: Applied Mathematics
Keywords: Global optimization Method of center Distance func-tion Aggregate function
CLC: O224
Type: Master's thesis
Year: 2011
Downloads: 6
Quote: 0
Read: Download Dissertation
Abstract
|
In real life, many important problems are involved in selecting the bestgoal, or choose some parameters or determine some values to achieve thisgoal. These problems can come down to optimization problems. Globaloptimization problem is an important ranch of optimization problem andit is a kind of widely-apply problem. In particular, it applies engineering,economics, finance, national defense and management science, and manyother important areas. It is an important and challenging task in modernoptimization theory and methods.An eficient algorithm, named as method of center, for solving globaloptimization problems is discussed in the pater. The main contents areorganized as follows:In chapter 1, some deFInitions and optimization models about the op-timization problem are introduced, so that we can fully understand theoptimization of knowledge. Global optimization problems and some of itsmain methods are brieffy introduced.In chapter 2, to understand method of center, Huard algorithm andmethod of center of the general nonlinear programming algorithm are in-troduced.In chapter 3, the method of center of single objective problem of globaloptimization is proposed. We use aggregate function to approximate andsmooth the distance function in algorithm, and discussed the origin andsome of its simple properties on aggregate function.In chapter 4, six examples are calculated, using the method of centerof global optimization problem. We compare the results with their exactsolutions or the optimal solutions. These examples are proved to demon-strate the effectiveness and feasibility of proposed method.
|
Related Dissertations
- A Branch and Bound Algorithm for Two Classes of Non-Convex Global Optimization Problems,O224
- Quadratic programming and multi- objective planning of global optimality conditions,O221
- Global Optimization for Sum-of-Ratios Problems,O224
- Two Classes of Methods for Nonlinear Programming,O221.2
- Global Optimization Algorithms of Clusters,O561
- High-efficient Heuristic Algorithms on Prediction Ground State Structures of Clusters,O561
- Research on Carbon Dioxide Abatement Cost of Industrial Sector in China,F205;F224
- The Improvement and Research of Several Algorithms about the Global Optimization,O224
- The Research and Application on Composition Papers System Base on Genetic Algorithm,O224
- The Auxiliary Function Method for Nonlinear Global Optimization,O224
- Globally Convex Filled Function Method for Nonlinear Global Optimization Problem,O221.2
- Transmission Network Expansion Planning Based on Ecology Evolutionary Algorithm of Food Chain,TM715
- Multi-stream heat exchanger channel arranged to optimize the design of,TK172
- Based upon digestion items identified global optimization method coreference resolution,TP391.1
- Genetic Algorithms for Two Special Classes of Bilevel Programming Problems,TP18
- Novel Hybrid Algorithms for Unconstrained Global Optimization Problems with Continuous Variables,TP18
- Two Classes of Filled Function for Constrained Global Optimization Problem,O224
- The Study of the Optimization Technique Application on the BBD Mill,TM621
- Filled Function Methods for Constrained Global Optimization Problems,O221.4
- The Type of Entropy-like Interior Proximal Point Algorithms with the Applications,O221
- The Upper and Lower Bound Estimations of Nonlinear Optimization Problems,O224
CLC: > Mathematical sciences and chemical > Mathematics > Operations Research > Optimization of the mathematical theory
© 2012 www.DissertationTopic.Net Mobile
|