Dissertation
Dissertation > Mathematical sciences and chemical > Mathematics > Computational Mathematics > Mathematical modeling, approximate calculation > Approximate calculation > Newton - La Fusen ( Newton -Raphson ) method

Filled Function Methods and an Interval Algorithm for Global Optimization Problems

Author WuQing
Tutor LiuSanYang
School Xi'an University of Electronic Science and Technology
Course Applied Mathematics
Keywords Lipschitz planning Multi-objective planning minimax problem Filled Function Method Interval algorithm
CLC O242.23
Type Master's thesis
Year 2005
Downloads 255
Quotes 2
Download Dissertation

Made more in-depth study of the two types of global optimization algorithm ( filled function method and interval algorithm ) , made ??a further promotion and application , and achieved satisfactory results based on these algorithms , the main content is as follows : in has improved two-parameter filled function method on the basis of the filled function method for a class of non - smooth problems , this concise form filled function , low computational complexity , a large number of numerical experiments that compare this method with the existing literature the accuracy and efficiency are improved. For Lipschitz planning , the limitations of the two-parameter filled function parameter selection , we construct a class of a wider application of the single- parameter filled function to improve the efficiency of the implementation of the algorithm , theoretical analysis and numerical experiments show that the algorithm has some excellent correlation algorithm . Linear weighted multi-objective planning into a single objective planning , according to their characteristics , construct a new filled function method , and use this algorithm to obtain the global optimal solution of the single-objective planning , that is, the original planning of the minimum weakly efficient solutions , numerical experiments show that the algorithm is feasible and effective , and can guarantee the global optimal solution . Discrete minimax problem , by introducing the concept of the proposed partial derivatives , establish inspection interval extension of the objective function and no solution region deleted principle , the principle of two points based on Moore's interval interval algorithm for solving discrete minimax problem . The theoretical analysis and numerical results show that the algorithm is effective and can solve for the optimal solution within a given accuracy .

Related Dissertations
More Dissertations