The filled function method is an approach for finding a global minimum of multi-dimensional functions. With more and more relevant research, it becomes a promising way used in unconstrained global optimization. Some f...The filled function method is an approach for finding a global minimum of multi-dimensional functions. With more and more relevant research, it becomes a promising way used in unconstrained global optimization. Some filled functions with one or two parameters have already been suggested. However, there is no certain criterion to choose a parameter appropriately. In this paper, a parameter-free filled function was proposed. The definition of the original filled function and assumptions of the objective function given by Ge were improved according to the presented parameter-free filled function. The algorithm and numerical results of test functions were reported. Conclusions were drawn in the end. Key words global optimization - filled function method - local minimizer MSC 2000 90C30展开更多
In this paper, a new filled function with only one parameter is proposed. The main advantages of the new filled function are that it not only can be analyzed easily, but also can be approximated uniformly by a continu...In this paper, a new filled function with only one parameter is proposed. The main advantages of the new filled function are that it not only can be analyzed easily, but also can be approximated uniformly by a continuously differentiable function. Thus, a minimizer of the proposed filled function can be obtained easily by using a local optimization algorithm. The obtained minimizer is taken as the initial point to minimize the objective function and a better minimizer will be found. By repeating the above processes, we will find a global minimizer at last. The results of numerical experiments show that the new proposed filled function method is effective.展开更多
To solve the global optimization problems which have several local minimizers,a new F-C function is proposes by combining a lled function and a cross function.The properties of the F-C function are discussed and the c...To solve the global optimization problems which have several local minimizers,a new F-C function is proposes by combining a lled function and a cross function.The properties of the F-C function are discussed and the corresponding algorithm is given in this paper.F-C function has the same local minimizers with the objective function.Therefore,the F-C function method only needs to minimize the objective function once in the rst iteration.Numerical experiments are performed and the results show that the proposed method is very effective.展开更多
In this paper, auxiliary function method for global optimization with box constraints is considered. First, a new non-parameter filled function which has the same local minimizers of the objective function is proposed...In this paper, auxiliary function method for global optimization with box constraints is considered. First, a new non-parameter filled function which has the same local minimizers of the objective function is proposed. By the character that having same local minimizers, and these minimizers are all better than the current minimizer of the objective function, it does not need to minimize the objective function except for thefirst iteration in the filled function method. It changes the frame of conventional filled function methods that objective function and filled function are minimized alternately,and can effectively reduce the iterations of the algorithm and accelerate the speed of global optimization. And then the theoretical properties of the filled function are discussed and the corresponding algorithm is established. Finally, numerical experiments are made and comparisons on several test problems are shown which exhibit the feasibility and effectiveness of the algorithm.展开更多
A filled function with adjustable parameters is suggested in this paper for finding a global minimum point of a general class of nonlinear programming problems with a bounded and closed domain. This function has two a...A filled function with adjustable parameters is suggested in this paper for finding a global minimum point of a general class of nonlinear programming problems with a bounded and closed domain. This function has two adjustable parameters. We will discuss the properties of the proposed filled function. Conditions on this function and on the values of parameters are given so that the constructed function has the desired properties of traditional filled function.展开更多
In the paper,to solve the global optimization problems,we propose a novel parameter-free filled function.Based on the non-parameter filled function,a new filled function algorithm is designed.In the algorithm,the sele...In the paper,to solve the global optimization problems,we propose a novel parameter-free filled function.Based on the non-parameter filled function,a new filled function algorithm is designed.In the algorithm,the selection and adjustment of parameters can be ignored by the characteristic that the filled function is parameter-free.In addition,in the region lower than the current local minimizer of the objective function,the filled function is continuously differentiable which enables any gradient descent method to be used as a local search method in the algorithm.Through numerical experiments by solving two test problems,the effectiveness of the algorithm is verified.展开更多
The reconstruction problem for elliptic voids located in the regular (equilateral) triangle is studied. A known point source is applied to the boundary of the domain, and it is assumed that the input data is obtained ...The reconstruction problem for elliptic voids located in the regular (equilateral) triangle is studied. A known point source is applied to the boundary of the domain, and it is assumed that the input data is obtained from the free-surface input data over a certain finite-length interval of the outer boundary. In the case when the boundary contour of the internal object is unknown, we propose a new algorithm to reconstruct its position and size on the basis of the input data. The key specific character of the proposed method is the construction of a special explicit-form Green's function satisfying the boundary condition over the outer boundary of the triangular domain. Some numerical examples demonstrate good stability of the proposed algorithm.展开更多
The paper is concerned with the filled functions for global optimization of a continuous function of several variables.More general forms of filled functions are presented for smooth and nonsmooth optimizations.These ...The paper is concerned with the filled functions for global optimization of a continuous function of several variables.More general forms of filled functions are presented for smooth and nonsmooth optimizations.These functions have either two adjustable parameters or one adjustable parameter.Conditions on functions and on the values of parameters are given so that the constructed functions are desired filled functions.展开更多
As a promising technique, surrogate-based design and optimization（SBDO） has been widely used in modern engineering design optimizations. Currently, static surrogate-based optimization methods have been successfully ...As a promising technique, surrogate-based design and optimization（SBDO） has been widely used in modern engineering design optimizations. Currently, static surrogate-based optimization methods have been successfully applied to expensive optimization problems. However, due to the low efficiency and poor flexibility, static surrogate-based optimization methods are difficult to efficiently solve practical engineering cases. At the aim of enhancing efficiency, a novel surrogate-based efficient optimization method is developed by using sequential radial basis function（SEO-SRBF）. Moreover, augmented Lagrangian multiplier method is adopted to solve the problems involving expensive constraints. In order to study the performance of SEO-SRBF, several numerical benchmark functions and engineering problems are solved by SEO-SRBF and other well-known surrogate-based optimization methods including EGO, MPS, and IARSM. The optimal solutions, number of function evaluations, and algorithm execution time are recorded for comparison. The comparison results demonstrate that SEO-SRBF shows satisfactory performance in both optimization efficiency and global convergence capability. The CPU time required for running SEO-SRBF is dramatically less than that of other algorithms. In the torque arm optimization case using FEA simulation, SEO-SRBF further reduces 21% of thematerial volume compared with the solution from static-RBF subject to the stress constraint. This study provides the efficient strategy to solve expensive constrained optimization problems.展开更多
High fidelity analysis models,which are beneficial to improving the design quality,have been more and more widely utilized in the modern engineering design optimization problems.However,the high fidelity analysis mode...High fidelity analysis models,which are beneficial to improving the design quality,have been more and more widely utilized in the modern engineering design optimization problems.However,the high fidelity analysis models are so computationally expensive that the time required in design optimization is usually unacceptable.In order to improve the efficiency of optimization involving high fidelity analysis models,the optimization efficiency can be upgraded through applying surrogates to approximate the computationally expensive models,which can greately reduce the computation time.An efficient heuristic global optimization method using adaptive radial basis function（RBF） based on fuzzy clustering（ARFC） is proposed.In this method,a novel algorithm of maximin Latin hypercube design using successive local enumeration（SLE） is employed to obtain sample points with good performance in both space-filling and projective uniformity properties,which does a great deal of good to metamodels accuracy.RBF method is adopted for constructing the metamodels,and with the increasing the number of sample points the approximation accuracy of RBF is gradually enhanced.The fuzzy c-means clustering method is applied to identify the reduced attractive regions in the original design space.The numerical benchmark examples are used for validating the performance of ARFC.The results demonstrates that for most application examples the global optima are effectively obtained and comparison with adaptive response surface method（ARSM） proves that the proposed method can intuitively capture promising design regions and can efficiently identify the global or near-global design optimum.This method improves the efficiency and global convergence of the optimization problems,and gives a new optimization strategy for engineering design optimization problems involving computationally expensive models.展开更多
This paper presents a two-phase genetic algorithm (TPGA) based on the multi- parent genetic algorithm (MPGA). Through analysis we find MPGA will lead the population' s evol vement to diversity or convergence accor...This paper presents a two-phase genetic algorithm (TPGA) based on the multi- parent genetic algorithm (MPGA). Through analysis we find MPGA will lead the population' s evol vement to diversity or convergence according to the population size and the crossover size, so we make it run in different forms during the global and local optimization phases and then forms TPGA. The experiment results show that TPGA is very efficient for the optimization of low-dimension multi-modal functions, usually we can obtain all the global optimal solutions.展开更多
A simplified group search optimizer algorithm denoted as"SGSO"for large scale global optimization is presented in this paper to obtain a simple algorithm with superior performance on high-dimensional problem...A simplified group search optimizer algorithm denoted as"SGSO"for large scale global optimization is presented in this paper to obtain a simple algorithm with superior performance on high-dimensional problems.The SGSO adopts an improved sharing strategy which shares information of not only the best member but also the other good members,and uses a simpler search method instead of searching by the head angle.Furthermore,the SGSO increases the percentage of scroungers to accelerate convergence speed.Compared with genetic algorithm(GA),particle swarm optimizer(PSO)and group search optimizer(GSO),SGSO is tested on seven benchmark functions with dimensions 30,100,500 and 1 000.It can be concluded that the SGSO has a remarkably superior performance to GA,PSO and GSO for large scale global optimization.展开更多
This paper presents a Butterfly Optimization Algorithm(BOA)with a wind-driven mechanism for avoiding natural enemies known as WDBOA.To further balance the basic BOA algorithm's exploration and exploitation capabil...This paper presents a Butterfly Optimization Algorithm(BOA)with a wind-driven mechanism for avoiding natural enemies known as WDBOA.To further balance the basic BOA algorithm's exploration and exploitation capabilities,the butterfly actions were divided into downwind and upwind states.The algorithm of exploration ability was improved with the wind,while the algorithm of exploitation ability was improved against the wind.Also,a mechanism of avoiding natural enemies based on Lévy flight was introduced for the purpose of enhancing its global searching ability.Aiming at improving the explorative performance at the initial stages and later stages,the fragrance generation method was modified.To evaluate the effectiveness of the suggested algorithm,a comparative study was done with six classical metaheuristic algorithms and three BOA variant optimization techniques on 18 benchmark functions.Further,the performance of the suggested technique in addressing some complicated problems in various dimensions was evaluated using CEC 2017 and CEC 2020.Finally,the WDBOA algorithm is used proportional-integral-derivative(PID)controller parameter optimization.Experimental results demonstrate that the WDBOA based PID controller has better control performance in comparison with other PID controllers tuned by the Genetic Algorithm(GA),Flower Pollination Algorithm(FPA),Cuckoo Search(CS)and BOA.展开更多
This paper proposes an optimization algorithm based on a multi-loop control system with a neural network controller,in which the objective function that is used is the control plant of each sub-control system.To obtai...This paper proposes an optimization algorithm based on a multi-loop control system with a neural network controller,in which the objective function that is used is the control plant of each sub-control system.To obtain the global optimization solution from a control plant that has many local minimum points,a transformation function is presented.On the one hand,this approach changes a complex objective function into a simple function under the condition of an unchanged globally optimal solution,to find the global optimization solution more easily by using a multi-loop control system.On the other hand,a special neural network(in which the node function can be simply positioned locally)that is composed of multiple transformation functions is used as the controller,which reduces the possibility of falling into local minimum points.At the same time,a filled function is presented as a control law;it can jump out of a local minimum point and move to another local minimum point that has a smaller value of the objective function.Finally,18 simulation examples are provided to show the effectiveness of the proposed method.展开更多
A conventional global contrast enhancement is difficult to apply in various images because image quality and contrast enhancement are dependent on image characteristics largely. And a local contrast enhancement not on...A conventional global contrast enhancement is difficult to apply in various images because image quality and contrast enhancement are dependent on image characteristics largely. And a local contrast enhancement not only causes a washed-out effect, but also blocks. To solve these drawbacks, this paper derives an optimal global equalization function with variable size block based local contrast enhancement. The optimal equalization function makes it possible to get a good quality image through the global contrast enhancement. The variable size block segmentation is firstly exeoated using intensity differences as a measure of similarity. In the second step, the optimal global equalization function is obtained from the enhanced contrast image having variable size blocks. Conformed experiments have showed that the proposed algorithm produces a visually comfortable result image.展开更多
The Newton-Like algorithm with price estimation error in optimization flow control in network is analyzed. The estimation error is treated as inexactness of the gradient and the inexact descent direction is analyzed. ...The Newton-Like algorithm with price estimation error in optimization flow control in network is analyzed. The estimation error is treated as inexactness of the gradient and the inexact descent direction is analyzed. Based on the optimization theory, a sufficient condition for convergence of this algorithm with bounded price estimation error is obtained. Furthermore, even when this sufficient condition doesn＇t hold, this algorithm can also converge, provided a modified step size, and an attraction region is obtained. Based on Lasalle＇s invariance principle applied to a suitable Lyapunov function, the dynamic system described by this algorithm is proved to be global stability if the error is zero. And the Newton-Like algorithm with bounded price estimation error is also globally stable if the error satisfies the sufficient condition for convergence. All trajectories ultimately converge to the equilibrium point.展开更多
The stability of the Newton-like algorithm in optimization flow control is considered in this paper. This algorithm is proved to be globally stable under a general network topology by means of Lyapunov stability theor...The stability of the Newton-like algorithm in optimization flow control is considered in this paper. This algorithm is proved to be globally stable under a general network topology by means of Lyapunov stability theory,without considering the round trip time of each source. While the stability of this algorithm with considering the round trip time is analyzed as well. The analysis shows that the algorithm with only one bottleneck link accessed by several sources is also globally stable,and all trajectories described by this algorithm ultimately converge to the equilibrium point.展开更多
A new class of filled functions for escaping the current local minimizer of unconstrained global optimization is proposed.This kind of filled functions is continuously differentiable.And it has no exponential terms an...A new class of filled functions for escaping the current local minimizer of unconstrained global optimization is proposed.This kind of filled functions is continuously differentiable.And it has no exponential terms and logarithmic terms,which reduce the possibility of computation overflows.Theoretical properties of the proposed filled functions are studied,including discussing the specific conditions that the proposed functions must meet to qualify as a filled function.Then,a new solution algorithm is developed according to the theoretical analysis.Six benchmark problems are tested,and the performance of the new algorithm is compared with two filled function methods.The numerical results prove that the new algorithm is effective and reliable.展开更多
文摘The filled function method is an approach for finding a global minimum of multi-dimensional functions. With more and more relevant research, it becomes a promising way used in unconstrained global optimization. Some filled functions with one or two parameters have already been suggested. However, there is no certain criterion to choose a parameter appropriately. In this paper, a parameter-free filled function was proposed. The definition of the original filled function and assumptions of the objective function given by Ge were improved according to the presented parameter-free filled function. The algorithm and numerical results of test functions were reported. Conclusions were drawn in the end. Key words global optimization - filled function method - local minimizer MSC 2000 90C30
文摘In this paper, a new filled function with only one parameter is proposed. The main advantages of the new filled function are that it not only can be analyzed easily, but also can be approximated uniformly by a continuously differentiable function. Thus, a minimizer of the proposed filled function can be obtained easily by using a local optimization algorithm. The obtained minimizer is taken as the initial point to minimize the objective function and a better minimizer will be found. By repeating the above processes, we will find a global minimizer at last. The results of numerical experiments show that the new proposed filled function method is effective.
基金Supported by National Natural Science Foundation of China(No.11471102)Basic research projects for key scientific research projects in Henan Province(No.20ZX001)。
文摘To solve the global optimization problems which have several local minimizers,a new F-C function is proposes by combining a lled function and a cross function.The properties of the F-C function are discussed and the corresponding algorithm is given in this paper.F-C function has the same local minimizers with the objective function.Therefore,the F-C function method only needs to minimize the objective function once in the rst iteration.Numerical experiments are performed and the results show that the proposed method is very effective.
基金Supported by National Natural Science Foundation of China (Grant No. 11471102, 11701150,12071112)Basic research projects for key scientific research projects in Henan Province (Grant No. 20ZX001)。
文摘In this paper, auxiliary function method for global optimization with box constraints is considered. First, a new non-parameter filled function which has the same local minimizers of the objective function is proposed. By the character that having same local minimizers, and these minimizers are all better than the current minimizer of the objective function, it does not need to minimize the objective function except for thefirst iteration in the filled function method. It changes the frame of conventional filled function methods that objective function and filled function are minimized alternately,and can effectively reduce the iterations of the algorithm and accelerate the speed of global optimization. And then the theoretical properties of the filled function are discussed and the corresponding algorithm is established. Finally, numerical experiments are made and comparisons on several test problems are shown which exhibit the feasibility and effectiveness of the algorithm.
基金Supported by the National Science Foundation of China(10171118)Supported by the Science Foundation of University of Science and Technology of Henan(2003ZY06)
文摘A filled function with adjustable parameters is suggested in this paper for finding a global minimum point of a general class of nonlinear programming problems with a bounded and closed domain. This function has two adjustable parameters. We will discuss the properties of the proposed filled function. Conditions on this function and on the values of parameters are given so that the constructed function has the desired properties of traditional filled function.
文摘In the paper,to solve the global optimization problems,we propose a novel parameter-free filled function.Based on the non-parameter filled function,a new filled function algorithm is designed.In the algorithm,the selection and adjustment of parameters can be ignored by the characteristic that the filled function is parameter-free.In addition,in the region lower than the current local minimizer of the objective function,the filled function is continuously differentiable which enables any gradient descent method to be used as a local search method in the algorithm.Through numerical experiments by solving two test problems,the effectiveness of the algorithm is verified.
文摘The reconstruction problem for elliptic voids located in the regular (equilateral) triangle is studied. A known point source is applied to the boundary of the domain, and it is assumed that the input data is obtained from the free-surface input data over a certain finite-length interval of the outer boundary. In the case when the boundary contour of the internal object is unknown, we propose a new algorithm to reconstruct its position and size on the basis of the input data. The key specific character of the proposed method is the construction of a special explicit-form Green's function satisfying the boundary condition over the outer boundary of the triangular domain. Some numerical examples demonstrate good stability of the proposed algorithm.
文摘The paper is concerned with the filled functions for global optimization of a continuous function of several variables.More general forms of filled functions are presented for smooth and nonsmooth optimizations.These functions have either two adjustable parameters or one adjustable parameter.Conditions on functions and on the values of parameters are given so that the constructed functions are desired filled functions.
基金Supported by National Natural Science Foundation of China (Grant Nos.51105040,11372036)Aeronautical Science Foundation of China (Grant Nos.2011ZA72003,2009ZA72002)+1 种基金Excellent Young Scholars Research Fund of Beijing Institute of Technology (Grant No.2010Y0102)Foundation Research Fund of Beijing Institute of Technology (Grant No.20130142008)
文摘As a promising technique, surrogate-based design and optimization（SBDO） has been widely used in modern engineering design optimizations. Currently, static surrogate-based optimization methods have been successfully applied to expensive optimization problems. However, due to the low efficiency and poor flexibility, static surrogate-based optimization methods are difficult to efficiently solve practical engineering cases. At the aim of enhancing efficiency, a novel surrogate-based efficient optimization method is developed by using sequential radial basis function（SEO-SRBF）. Moreover, augmented Lagrangian multiplier method is adopted to solve the problems involving expensive constraints. In order to study the performance of SEO-SRBF, several numerical benchmark functions and engineering problems are solved by SEO-SRBF and other well-known surrogate-based optimization methods including EGO, MPS, and IARSM. The optimal solutions, number of function evaluations, and algorithm execution time are recorded for comparison. The comparison results demonstrate that SEO-SRBF shows satisfactory performance in both optimization efficiency and global convergence capability. The CPU time required for running SEO-SRBF is dramatically less than that of other algorithms. In the torque arm optimization case using FEA simulation, SEO-SRBF further reduces 21% of thematerial volume compared with the solution from static-RBF subject to the stress constraint. This study provides the efficient strategy to solve expensive constrained optimization problems.
基金supported by National Natural Science Foundation of China (Grant Nos. 50875024,51105040)Excellent Young Scholars Research Fund of Beijing Institute of Technology,China (Grant No.2010Y0102)Defense Creative Research Group Foundation of China(Grant No. GFTD0803)
文摘High fidelity analysis models,which are beneficial to improving the design quality,have been more and more widely utilized in the modern engineering design optimization problems.However,the high fidelity analysis models are so computationally expensive that the time required in design optimization is usually unacceptable.In order to improve the efficiency of optimization involving high fidelity analysis models,the optimization efficiency can be upgraded through applying surrogates to approximate the computationally expensive models,which can greately reduce the computation time.An efficient heuristic global optimization method using adaptive radial basis function（RBF） based on fuzzy clustering（ARFC） is proposed.In this method,a novel algorithm of maximin Latin hypercube design using successive local enumeration（SLE） is employed to obtain sample points with good performance in both space-filling and projective uniformity properties,which does a great deal of good to metamodels accuracy.RBF method is adopted for constructing the metamodels,and with the increasing the number of sample points the approximation accuracy of RBF is gradually enhanced.The fuzzy c-means clustering method is applied to identify the reduced attractive regions in the original design space.The numerical benchmark examples are used for validating the performance of ARFC.The results demonstrates that for most application examples the global optima are effectively obtained and comparison with adaptive response surface method（ARSM） proves that the proposed method can intuitively capture promising design regions and can efficiently identify the global or near-global design optimum.This method improves the efficiency and global convergence of the optimization problems,and gives a new optimization strategy for engineering design optimization problems involving computationally expensive models.
基金Supported by the National Natural Science Foundation of China (70071042,60073043,60133010)
文摘This paper presents a two-phase genetic algorithm (TPGA) based on the multi- parent genetic algorithm (MPGA). Through analysis we find MPGA will lead the population' s evol vement to diversity or convergence according to the population size and the crossover size, so we make it run in different forms during the global and local optimization phases and then forms TPGA. The experiment results show that TPGA is very efficient for the optimization of low-dimension multi-modal functions, usually we can obtain all the global optimal solutions.
基金the Science and Technology Planning Project of Hunan Province(No.2011TP4016-3)the Construct Program of the Key Discipline(Technology of Computer Application)in Xiangnan University
文摘A simplified group search optimizer algorithm denoted as"SGSO"for large scale global optimization is presented in this paper to obtain a simple algorithm with superior performance on high-dimensional problems.The SGSO adopts an improved sharing strategy which shares information of not only the best member but also the other good members,and uses a simpler search method instead of searching by the head angle.Furthermore,the SGSO increases the percentage of scroungers to accelerate convergence speed.Compared with genetic algorithm(GA),particle swarm optimizer(PSO)and group search optimizer(GSO),SGSO is tested on seven benchmark functions with dimensions 30,100,500 and 1 000.It can be concluded that the SGSO has a remarkably superior performance to GA,PSO and GSO for large scale global optimization.
基金This work was supported by National Natural Science Foundation of China under Grant U21A20464,62066005Project of the Guangxi Science and Technology under Grant No.ZL23014016.
文摘This paper presents a Butterfly Optimization Algorithm(BOA)with a wind-driven mechanism for avoiding natural enemies known as WDBOA.To further balance the basic BOA algorithm's exploration and exploitation capabilities,the butterfly actions were divided into downwind and upwind states.The algorithm of exploration ability was improved with the wind,while the algorithm of exploitation ability was improved against the wind.Also,a mechanism of avoiding natural enemies based on Lévy flight was introduced for the purpose of enhancing its global searching ability.Aiming at improving the explorative performance at the initial stages and later stages,the fragrance generation method was modified.To evaluate the effectiveness of the suggested algorithm,a comparative study was done with six classical metaheuristic algorithms and three BOA variant optimization techniques on 18 benchmark functions.Further,the performance of the suggested technique in addressing some complicated problems in various dimensions was evaluated using CEC 2017 and CEC 2020.Finally,the WDBOA algorithm is used proportional-integral-derivative(PID)controller parameter optimization.Experimental results demonstrate that the WDBOA based PID controller has better control performance in comparison with other PID controllers tuned by the Genetic Algorithm(GA),Flower Pollination Algorithm(FPA),Cuckoo Search(CS)and BOA.
基金supported by the National Natural Science Foundation of China(61273190)
文摘This paper proposes an optimization algorithm based on a multi-loop control system with a neural network controller,in which the objective function that is used is the control plant of each sub-control system.To obtain the global optimization solution from a control plant that has many local minimum points,a transformation function is presented.On the one hand,this approach changes a complex objective function into a simple function under the condition of an unchanged globally optimal solution,to find the global optimization solution more easily by using a multi-loop control system.On the other hand,a special neural network(in which the node function can be simply positioned locally)that is composed of multiple transformation functions is used as the controller,which reduces the possibility of falling into local minimum points.At the same time,a filled function is presented as a control law;it can jump out of a local minimum point and move to another local minimum point that has a smaller value of the objective function.Finally,18 simulation examples are provided to show the effectiveness of the proposed method.
文摘A conventional global contrast enhancement is difficult to apply in various images because image quality and contrast enhancement are dependent on image characteristics largely. And a local contrast enhancement not only causes a washed-out effect, but also blocks. To solve these drawbacks, this paper derives an optimal global equalization function with variable size block based local contrast enhancement. The optimal equalization function makes it possible to get a good quality image through the global contrast enhancement. The variable size block segmentation is firstly exeoated using intensity differences as a measure of similarity. In the second step, the optimal global equalization function is obtained from the enhanced contrast image having variable size blocks. Conformed experiments have showed that the proposed algorithm produces a visually comfortable result image.
基金supported in part by the National Outstanding Youth Foundation of P.R.China (60525303)the National Natural Science Foundation of P.R.China(60404022,60604004)+2 种基金the Natural Science Foundation of Hebei Province (102160)the special projects in mathematics funded by the Natural Science Foundation of Hebei Province(07M005)the NS of Education Office in Hebei Province (2004123).
文摘The Newton-Like algorithm with price estimation error in optimization flow control in network is analyzed. The estimation error is treated as inexactness of the gradient and the inexact descent direction is analyzed. Based on the optimization theory, a sufficient condition for convergence of this algorithm with bounded price estimation error is obtained. Furthermore, even when this sufficient condition doesn＇t hold, this algorithm can also converge, provided a modified step size, and an attraction region is obtained. Based on Lasalle＇s invariance principle applied to a suitable Lyapunov function, the dynamic system described by this algorithm is proved to be global stability if the error is zero. And the Newton-Like algorithm with bounded price estimation error is also globally stable if the error satisfies the sufficient condition for convergence. All trajectories ultimately converge to the equilibrium point.
基金the National Outstanding Youth Foundation of China (Grant No.60525303)the NNSF of China( Grant No.60404022 and 60604004)+2 种基金the NSF of Hebei Province (Grant No.102160)the Special Projects in Mathematics Funded by Natural Science Foundation of Hebei Prov-ince(Grant No.07M005)the NS of Education Office in Hebei Province (Grant No.2004123).
文摘The stability of the Newton-like algorithm in optimization flow control is considered in this paper. This algorithm is proved to be globally stable under a general network topology by means of Lyapunov stability theory,without considering the round trip time of each source. While the stability of this algorithm with considering the round trip time is analyzed as well. The analysis shows that the algorithm with only one bottleneck link accessed by several sources is also globally stable,and all trajectories described by this algorithm ultimately converge to the equilibrium point.
基金supported by the Major Program of the National Natural Science Foundation of China(Nos.11991020,11991024)by the National Natural Science Foundation of China(No.12271071).
文摘A new class of filled functions for escaping the current local minimizer of unconstrained global optimization is proposed.This kind of filled functions is continuously differentiable.And it has no exponential terms and logarithmic terms,which reduce the possibility of computation overflows.Theoretical properties of the proposed filled functions are studied,including discussing the specific conditions that the proposed functions must meet to qualify as a filled function.Then,a new solution algorithm is developed according to the theoretical analysis.Six benchmark problems are tested,and the performance of the new algorithm is compared with two filled function methods.The numerical results prove that the new algorithm is effective and reliable.
