Method of constrained global optimization
Altschuler, E.L.; Williams, T.J.; Ratner, E.R.; Dowla, F.; Wooten, F. (Lawrence Livermore National Laboratory, P.O. Box 808, Livermore, California 94551 (United States) Department of Applied Physics, Stanford University, Stanford, California 94305 (United States) Department of Applied Science, University of California, Davis/Livermore, P.O. Box 808, Livermore, California 94551 (United States))
1994-04-25
We present a new method for optimization: constrained global optimization (CGO). CGO iteratively uses a Glauber spin flip probability and the Metropolis algorithm. The spin flip probability allows changing only the values of variables contributing excessively to the function to be minimized. We illustrate CGO with two problems---Thomson's problem of finding the minimum-energy configuration of unit charges on a spherical surface, and a problem of assigning offices---for which CGO finds better minima than other methods. We think CGO will apply to a wide class of optimization problems.
Homotopy optimization methods for global optimization.
Dunlavy, Daniel M.; O' Leary, Dianne P. (University of Maryland, College Park, MD)
2005-12-01
We define a new method for global optimization, the Homotopy Optimization Method (HOM). This method differs from previous homotopy and continuation methods in that its aim is to find a minimizer for each of a set of values of the homotopy parameter, rather than to follow a path of minimizers. We define a second method, called HOPE, by allowing HOM to follow an ensemble of points obtained by perturbation of previous ones. We relate this new method to standard methods such as simulated annealing and show under what circumstances it is superior. We present results of extensive numerical experiments demonstrating performance of HOM and HOPE.
A LEVEL-VALUE ESTIMATION METHOD FOR SOLVING GLOBAL OPTIMIZATION
WU Dong-hua; YU Wu-yang; TIAN Wei-wen; ZHANG Lian-sheng
2006-01-01
A level-value estimation method was illustrated for solving the constrained global optimization problem. The equivalence between the root of a modified variance equation and the optimal value of the original optimization problem is shown. An alternate algorithm based on the Newton's method is presented and the convergence of its implementable approach is proved. Preliminary numerical results indicate that the method is effective.
Global Optimization methods for Gravitational Lens Systems with Regularized Sources
Rogers, Adam
2012-01-01
Several approaches exist to model gravitational lens systems. In this study, we apply global optimization methods to find the optimal set of lens parameters using a genetic algorithm. We treat the full optimization procedure as a two-step process: an analytical description of the source plane intensity distribution is used to find an initial approximation to the optimal lens parameters. The second stage of the optimization uses a pixelated source plane with the semilinear method to determine an optimal source. Regularization is handled by means of an iterative method and the generalized cross validation (GCV) and unbiased predictive risk estimator (UPRE) functions that are commonly used in standard image deconvolution problems. This approach simultaneously estimates the optimal regularization parameter and the number of degrees of freedom in the source. Using the GCV and UPRE functions we are able to justify an estimation of the number of source degrees of freedom found in previous work. We test our approach ...
Tabu search method with random moves for globally optimal design
Hu, Nanfang
1992-09-01
Optimum engineering design problems are usually formulated as non-convex optimization problems of continuous variables. Because of the absence of convexity structure, they can have multiple minima, and global optimization becomes difficult. Traditional methods of optimization, such as penalty methods, can often be trapped at a local optimum. The tabu search method with random moves to solve approximately these problems is introduced. Its reliability and efficiency are examined with the help of standard test functions. By the analysis of the implementations, it is seen that this method is easy to use, and no derivative information is necessary. It outperforms the random search method and composite genetic algorithm. In particular, it is applied to minimum weight design examples of a three-bar truss, coil springs, a Z-section and a channel section. For the channel section, the optimal design using the tabu search method with random moves saved 26.14 percent over the weight of the SUMT method.
Variable Neighborhood Simplex Search Methods for Global Optimization Models
Pongchanun Luangpaiboon
2012-01-01
Full Text Available Problem statement: Many optimization problems of practical interest are encountered in various fields of chemical, engineering and management sciences. They are computationally intractable. Therefore, a practical algorithm for solving such problems is to employ approximation algorithms that can find nearly optimums within a reasonable amount of computational time. Approach: In this study the hybrid methods combining the Variable Neighborhood Search (VNS and simplexs family methods are proposed to deal with the global optimization problems of noisy continuous functions including constrained models. Basically, the simplex methods offer a search scheme without the gradient information whereas the VNS has the better searching ability with a systematic change of neighborhood of the current solution within a local search. Results: The VNS modified simplex method has a better searching ability for optimization problems with noise. The VNS modified simplex method also outperforms in average on the characteristics of intensity and diversity during the evolution of design point moving stage for the constrained optimization. Conclusion: The adaptive hybrid versions have proved to obtain significantly better results than the conventional methods. The amount of computation effort required for successful optimization is very sensitive to the rate of noise decrease of the process yields. Under circumstances of constrained optimization and gradually increasing the noise during an optimization the most preferred approach is the VNS modified simplex method.
An Optimal Method for Developing Global Supply Chain Management System
Hao-Chun Lu
2013-01-01
Full Text Available Owing to the transparency in supply chains, enhancing competitiveness of industries becomes a vital factor. Therefore, many developing countries look for a possible method to save costs. In this point of view, this study deals with the complicated liberalization policies in the global supply chain management system and proposes a mathematical model via the flow-control constraints, which are utilized to cope with the bonded warehouses for obtaining maximal profits. Numerical experiments illustrate that the proposed model can be effectively solved to obtain the optimal profits in the global supply chain environment.
Geophysical Inversion With Multi-Objective Global Optimization Methods
Lelièvre, Peter; Bijani, Rodrigo; Farquharson, Colin
2016-04-01
We are investigating the use of Pareto multi-objective global optimization (PMOGO) methods to solve numerically complicated geophysical inverse problems. PMOGO methods can be applied to highly nonlinear inverse problems, to those where derivatives are discontinuous or simply not obtainable, and to those were multiple minima exist in the problem space. PMOGO methods generate a suite of solutions that minimize multiple objectives (e.g. data misfits and regularization terms) in a Pareto-optimal sense. This allows a more complete assessment of the possibilities and provides opportunities to calculate statistics regarding the likelihood of particular model features. We are applying PMOGO methods to four classes of inverse problems. The first are discrete-body problems where the inversion determines values of several parameters that define the location, orientation, size and physical properties of an anomalous body represented by a simple shape, for example a sphere, ellipsoid, cylinder or cuboid. A PMOGO approach can determine not only the optimal shape parameters for the anomalous body but also the optimal shape itself. Furthermore, when one expects several anomalous bodies in the subsurface, a PMOGO inversion approach can determine an optimal number of parameterized bodies. The second class of inverse problems are standard mesh-based problems where the physical property values in each cell are treated as continuous variables. The third class of problems are lithological inversions, which are also mesh-based but cells can only take discrete physical property values corresponding to known or assumed rock units. In the fourth class, surface geometry inversions, we consider a fundamentally different type of problem in which a model comprises wireframe surfaces representing contacts between rock units. The physical properties of each rock unit remain fixed while the inversion controls the position of the contact surfaces via control nodes. Surface geometry inversion can be
Joint Geophysical Inversion With Multi-Objective Global Optimization Methods
Lelievre, P. G.; Bijani, R.; Farquharson, C. G.
2015-12-01
Pareto multi-objective global optimization (PMOGO) methods generate a suite of solutions that minimize multiple objectives (e.g. data misfits and regularization terms) in a Pareto-optimal sense. Providing a suite of models, as opposed to a single model that minimizes a weighted sum of objectives, allows a more complete assessment of the possibilities and avoids the often difficult choice of how to weight each objective. We are applying PMOGO methods to three classes of inverse problems. The first class are standard mesh-based problems where the physical property values in each cell are treated as continuous variables. The second class of problems are also mesh-based but cells can only take discrete physical property values corresponding to known or assumed rock units. In the third class we consider a fundamentally different type of inversion in which a model comprises wireframe surfaces representing contacts between rock units; the physical properties of each rock unit remain fixed while the inversion controls the position of the contact surfaces via control nodes. This third class of problem is essentially a geometry inversion, which can be used to recover the unknown geometry of a target body or to investigate the viability of a proposed Earth model. Joint inversion is greatly simplified for the latter two problem classes because no additional mathematical coupling measure is required in the objective function. PMOGO methods can solve numerically complicated problems that could not be solved with standard descent-based local minimization methods. This includes the latter two classes of problems mentioned above. There are significant increases in the computational requirements when PMOGO methods are used but these can be ameliorated using parallelization and problem dimension reduction strategies.
2008-01-01
In this paper, to overcome the drawbacks of POT which minimize the reminder, not only the optimal functional with minimal residual is put forward, but also the method of global optimization is used. Under the condition of large reminder, the optimal bases can also be obtained through the method of POTres without the approaching of initial conditions. In addition, compared with local optimization, the advantage of global optimization is remarkable. On the one hand, we can expect that the dynamical system based on the global optimal bases will include more information than the ones based on the local optimal bases, since the global optimal bases are much more precise than the local optimal bases. On the other hand, from the point of view of error, the global optimal bases are independent of the choice of the object functional and the initial bases.
CONVEXIFICATION AND CONCAVIFICATION METHODS FOR SOME GLOBAL OPTIMIZATION PROBLEMS
WU Zhiyou; ZHANG Liansheng; BAI Fusheng; YANG Xinmin
2004-01-01
In this paper, firstly, we propose several convexification and concavification transformations to convert a strictly monotone function into a convex or concave function,then we propose several convexification and concavification transformations to convert a non-convex and non-concave objective function into a convex or concave function in the programming problems with convex or concave constraint functions, and propose several convexification and concavification transformations to convert a non-monotone objective function into a convex or concave function in some programming problems with strictly monotone constraint functions. Finally, we prove that the original programming problem can be converted into an equivalent concave minimization problem, or reverse convex programming problem or canonical D.C. Programming problem. Then the global optimal solution of the original problem can be obtained by solving the converted concave minimization problem, or reverse convex programming problem or canonical D.C. Programming problem using the existing algorithms about them.
Global Synthesis Method for the Optimization of Multifeed EBG Antennas
Julien Drouet
2008-01-01
Full Text Available This paper presents a novel technique for synthesizing a given radiation pattern from an EBG antenna with an array feed. The method determines the optimum sets of input waves and input impedances for the feed ports in order to perform simultaneously the radiation pattern and the impedance matching of all the radiating probes that form the array feed. The method is validated through a numerical design of an EBG antenna excited with four patch antennas. The structure is designed to radiate with a single lobe scanned at =30∘ in the E-plane. The interactions between each patch inside the EBG resonator are characterized with the CST MWS software. The optimum weights and the input impedances which simultaneously perform the objective radiation and the matching of all feeding ports are calculated by the developed global synthesis method. The feed network is designed with the Agilent ADS software in order to perform the specified weights and the impedances matching.
A. P. Karpenko
2014-01-01
Full Text Available We consider a class of stochastic search algorithms of global optimization which in various publications are called behavioural, intellectual, metaheuristic, inspired by the nature, swarm, multi-agent, population, etc. We use the last term.Experience in using the population algorithms to solve challenges of global optimization shows that application of one such algorithm may not always effective. Therefore now great attention is paid to hybridization of population algorithms of global optimization. Hybrid algorithms unite various algorithms or identical algorithms, but with various values of free parameters. Thus efficiency of one algorithm can compensate weakness of another.The purposes of the work are development of hybrid algorithm of global optimization based on known algorithms of harmony search (HS and swarm of particles (PSO, software implementation of algorithm, study of its efficiency using a number of known benchmark problems, and a problem of dimensional optimization of truss structure.We set a problem of global optimization, consider basic algorithms of HS and PSO, give a flow chart of the offered hybrid algorithm called PSO HS , present results of computing experiments with developed algorithm and software, formulate main results of work and prospects of its development.
A Global Optimal Coherence Method for Multi-baseline InSAR Elevation Inversion
HUA Fenfen
2015-11-01
Full Text Available A global optimal coherence method for elevation inversion from multi-baseline polarimetric InSAR data is proposed. The multi-baseline polarimetric InSAR data used in experiments were obtained by Chinese X-SAR system and Germany's E-SAR system. Through combining several full polarimetric InSAR images, the proposed method constructs the multi-baseline polarimetric InSAR coherency matrix, and solves the optimal interferograms under global optimal coherence criterion. The optimal interferograms generated by global optimal coherence method were used to calculate the elevation of target with multi-baseline InSAR elevation inversion method. The proposed method reduces the influence of different scattering centers effectively using multi-baseline InSAR, which improves the accuracy and reliability of the interferometric phase and eventually improves the accuracy of DEM. The results verify the validity of the proposed method.
Deterministic Global Optimization
Scholz, Daniel
2012-01-01
This monograph deals with a general class of solution approaches in deterministic global optimization, namely the geometric branch-and-bound methods which are popular algorithms, for instance, in Lipschitzian optimization, d.c. programming, and interval analysis.It also introduces a new concept for the rate of convergence and analyzes several bounding operations reported in the literature, from the theoretical as well as from the empirical point of view. Furthermore, extensions of the prototype algorithm for multicriteria global optimization problems as well as mixed combinatorial optimization
Hooke–Jeeves Method-used Local Search in a Hybrid Global Optimization Algorithm
V. D. Sulimov
2014-01-01
Full Text Available Modern methods for optimization investigation of complex systems are based on development and updating the mathematical models of systems because of solving the appropriate inverse problems. Input data desirable for solution are obtained from the analysis of experimentally defined consecutive characteristics for a system or a process. Causal characteristics are the sought ones to which equation coefficients of mathematical models of object, limit conditions, etc. belong. The optimization approach is one of the main ones to solve the inverse problems. In the main case it is necessary to find a global extremum of not everywhere differentiable criterion function. Global optimization methods are widely used in problems of identification and computation diagnosis system as well as in optimal control, computing to-mography, image restoration, teaching the neuron networks, other intelligence technologies. Increasingly complicated systems of optimization observed during last decades lead to more complicated mathematical models, thereby making solution of appropriate extreme problems significantly more difficult. A great deal of practical applications may have the problem con-ditions, which can restrict modeling. As a consequence, in inverse problems the criterion functions can be not everywhere differentiable and noisy. Available noise means that calculat-ing the derivatives is difficult and unreliable. It results in using the optimization methods without calculating the derivatives.An efficiency of deterministic algorithms of global optimization is significantly restrict-ed by their dependence on the extreme problem dimension. When the number of variables is large they use the stochastic global optimization algorithms. As stochastic algorithms yield too expensive solutions, so this drawback restricts their applications. Developing hybrid algo-rithms that combine a stochastic algorithm for scanning the variable space with deterministic local search
Decomposition method of complex optimization model based on global sensitivity analysis
Qiu, Qingying; Li, Bing; Feng, Peien; Gao, Yu
2014-07-01
The current research of the decomposition methods of complex optimization model is mostly based on the principle of disciplines, problems or components. However, numerous coupling variables will appear among the sub-models decomposed, thereby make the efficiency of decomposed optimization low and the effect poor. Though some collaborative optimization methods are proposed to process the coupling variables, there lacks the original strategy planning to reduce the coupling degree among the decomposed sub-models when we start decomposing a complex optimization model. Therefore, this paper proposes a decomposition method based on the global sensitivity information. In this method, the complex optimization model is decomposed based on the principle of minimizing the sensitivity sum between the design functions and design variables among different sub-models. The design functions and design variables, which are sensitive to each other, will be assigned to the same sub-models as much as possible to reduce the impacts to other sub-models caused by the changing of coupling variables in one sub-model. Two different collaborative optimization models of a gear reducer are built up separately in the multidisciplinary design optimization software iSIGHT, the optimized results turned out that the decomposition method proposed in this paper has less analysis times and increases the computational efficiency by 29.6%. This new decomposition method is also successfully applied in the complex optimization problem of hydraulic excavator working devices, which shows the proposed research can reduce the mutual coupling degree between sub-models. This research proposes a decomposition method based on the global sensitivity information, which makes the linkages least among sub-models after decomposition, and provides reference for decomposing complex optimization models and has practical engineering significance.
A Novel Global Path Planning Method for Mobile Robots Based on Teaching-Learning-Based Optimization
Zongsheng Wu
2016-07-01
Full Text Available The Teaching-Learning-Based Optimization (TLBO algorithm has been proposed in recent years. It is a new swarm intelligence optimization algorithm simulating the teaching-learning phenomenon of a classroom. In this paper, a novel global path planning method for mobile robots is presented, which is based on an improved TLBO algorithm called Nonlinear Inertia Weighted Teaching-Learning-Based Optimization (NIWTLBO algorithm in our previous work. Firstly, the NIWTLBO algorithm is introduced. Then, a new map model of the path between start-point and goal-point is built by coordinate system transformation. Lastly, utilizing the NIWTLBO algorithm, the objective function of the path is optimized; thus, a global optimal path is obtained. The simulation experiment results show that the proposed method has a faster convergence rate and higher accuracy in searching for the path than the basic TLBO and some other algorithms as well, and it can effectively solve the optimization problem for mobile robot global path planning.
Autonomous Modelling of X-ray Spectra Using Robust Global Optimization Methods
Rogers, Adam; Safi-Harb, Samar; Fiege, Jason
2015-08-01
The standard approach to model fitting in X-ray astronomy is by means of local optimization methods. However, these local optimizers suffer from a number of problems, such as a tendency for the fit parameters to become trapped in local minima, and can require an involved process of detailed user intervention to guide them through the optimization process. In this work we introduce a general GUI-driven global optimization method for fitting models to X-ray data, written in MATLAB, which searches for optimal models with minimal user interaction. We directly interface with the commonly used XSPEC libraries to access the full complement of pre-existing spectral models that describe a wide range of physics appropriate for modelling astrophysical sources, including supernova remnants and compact objects. Our algorithm is powered by the Ferret genetic algorithm and Locust particle swarm optimizer from the Qubist Global Optimization Toolbox, which are robust at finding families of solutions and identifying degeneracies. This technique will be particularly instrumental for multi-parameter models and high-fidelity data. In this presentation, we provide details of the code and use our techniques to analyze X-ray data obtained from a variety of astrophysical sources.
Paschalidis, Ioannis Ch; Shen, Yang; Vakili, Pirooz; Vajda, Sandor
2007-04-01
This paper introduces a new stochastic global optimization method targeting protein-protein docking problems, an important class of problems in computational structural biology. The method is based on finding general convex quadratic underestimators to the binding energy function that is funnel-like. Finding the optimum underestimator requires solving a semidefinite programming problem, hence the name semidefinite programming-based underestimation (SDU). The underestimator is used to bias sampling in the search region. It is established that under appropriate conditions SDU locates the global energy minimum with probability approaching one as the sample size grows. A detailed comparison of SDU with a related method of convex global underestimator (CGU), and computational results for protein-protein docking problems are provided.
A Quadratic precision generalized nonlinear global optimization migration velocity inversion method
Zhao Taiyin; Hu Guangmin; He Zhenhua; Huang Deji
2009-01-01
An important research topic for prospecting seismology is to provide a fast accurate velocity model from pre-stack depth migration. Aiming at such a problem, we propose a quadratic precision generalized nonlinear global optimization migration velocity inversion. First we discard the assumption that there is a linear relationship between residual depth and residual velocity and propose a velocity model correction equation with quadratic precision which enables the velocity model from each iteration to approach the real model as quickly as possible. Second, we use a generalized nonlinear inversion to get the global optimal velocity perturbation model to all traces. This method can expedite the convergence speed and also can decrease the probability of falling into a local minimum during inversion. The synthetic data and Marmousi data examples show that our method has a higher precision and needs only a few iterations and consequently enhances the practicability and accuracy of migration velocity analysis (MVA) in complex areas.
Randomized Search Methods for Solving Markov Decision Processes and Global Optimization
2006-01-01
over relaxation (SOR) method ([81]). Puterman and Shin [62] proposed a modified policy iteration algorithm, which takes the basic form of PI, with the...99018) (1999). [61] Pintér, J. D., Global Optimization in Action, Kluwer Academic Publisher, The Netherlands, 1996. [62] Puterman , M. L. and Shin, M. C...Modified policy iteration algorithms for dis- counted Markov decision processes,” Management Science, 24, 1127–1137 (1978). [63] Puterman , M. L
Global Convergence of a New restarting Conjugate Gradient Method for Nonlinear Optimizations
SUNQing-ying
2003-01-01
Conjugate gradient optimization algorithms depend on the search directions.with different choices for the parameters in the search directions.In this note,by combining the nice numerical performance of PR and HS methods with the global convergence property of the class of conjugate gradient methods presented by HU and STOREY(1991),a class of new restarting conjugate gradient methods is presented.Global convergences of the new method with two kinds of common line searches,are proved .Firstly,it is shown that,using reverse modulus of continuity funciton and forcing function,the new method for solving unconstrained optimization can work for a continously differentiable function with Curry-Altman's step size rule and a bounded level set .Secondly,by using comparing technique,some general convergence propecties of the new method with other kind of step size rule are established,Numerical experiments show that the new method is efficient by comparing with FR conjugate gradient method.
On the use of global optimization methods for acoustic source mapping.
Malgoezar, Anwar M N; Snellen, Mirjam; Merino-Martinez, Roberto; Simons, Dick G; Sijtsma, Pieter
2017-01-01
Conventional beamforming with a microphone array is a well-established method for localizing and quantifying sound sources. It provides estimates for the source strengths on a predefined grid by determining the agreement between the pressures measured and those modeled for a source located at the grid point under consideration. As such, conventional beamforming can be seen as an exhaustive search for those locations that provide a maximum match between measured and modeled pressures. In this contribution, the authors propose to, instead of the exhaustive search, use an efficient global optimization method to search for the source locations that maximize the agreement between model and measurement. Advantages are two-fold. First, the efficient optimization allows for inclusion of more unknowns, such as the source position in three-dimensional or environmental parameters such as the speed of sound. Second, the model for the received pressure field can be readily adapted to reflect, for example, the presence of more sound sources or environmental parameters that affect the received signals. For the work considered, the global optimization method, Differential Evolution, is selected. Results with simulated and experimental data show that sources can be accurately identified, including the distance from the source to the array.
A global carbon assimilation system based on a dual optimization method
H. Zheng
2014-10-01
Full Text Available Ecological models are effective tools to simulate the distribution of global carbon sources and sinks. However, these models often suffer from substantial biases due to inaccurate simulations of complex ecological processes. We introduce a set of scaling factors (parameters to an ecological model on the basis of plant functional type (PFT and latitudes. A global carbon assimilation system (GCAS-DOM is developed by employing a Dual Optimization Method (DOM to invert the time-dependent ecological model parameter state and the net carbon flux state simultaneously. We use GCAS-DOM to estimate the global distribution of the CO2 flux on 1° ×1° grid cells for the period from 2000 to 2007. Results show that land and ocean absorb −3.69 ± 0.49 Pg C year−1 and −1.91 ± 0.16 Pg C year−1, respectively. North America, Europe and China contribut −0.96 ± 0.15 Pg C year−1, −0.42 ± 0.08 Pg C year−1 and −0.21 ± 0.28 Pg C year−1, respectively. The uncertainties in the flux after optimization by GCAS-DOM have been remarkably reduced by more than 60%. Through parameter optimization, GCAS-DOM can provide improved estimates of the carbon flux for each PFT. Coniferous forest (−0.97 ± 0.27 Pg C year−1 is the largest contributor to the global carbon sink. Fluxes of once-dominant deciduous forest generated by BEPS is reduced to −0.79 ± 0.22 Pg C year−1, being the third largest carbon sink.
A global carbon assimilation system based on a dual optimization method
Zheng, H.; Li, Y.; Chen, J. M.; Wang, T.; Huang, Q.; Huang, W. X.; Wang, L. H.; Li, S. M.; Yuan, W. P.; Zheng, X.; Zhang, S. P.; Chen, Z. Q.; Jiang, F.
2015-02-01
Ecological models are effective tools for simulating the distribution of global carbon sources and sinks. However, these models often suffer from substantial biases due to inaccurate simulations of complex ecological processes. We introduce a set of scaling factors (parameters) to an ecological model on the basis of plant functional type (PFT) and latitudes. A global carbon assimilation system (GCAS-DOM) is developed by employing a dual optimization method (DOM) to invert the time-dependent ecological model parameter state and the net carbon flux state simultaneously. We use GCAS-DOM to estimate the global distribution of the CO2 flux on 1° × 1° grid cells for the period from 2001 to 2007. Results show that land and ocean absorb -3.63 ± 0.50 and -1.82 ± 0.16 Pg C yr-1, respectively. North America, Europe and China contribute -0.98 ± 0.15, -0.42 ± 0.08 and -0.20 ± 0.29 Pg C yr-1, respectively. The uncertainties in the flux after optimization by GCAS-DOM have been remarkably reduced by more than 60%. Through parameter optimization, GCAS-DOM can provide improved estimates of the carbon flux for each PFT. Coniferous forest (-0.97 ± 0.27 Pg C yr-1) is the largest contributor to the global carbon sink. Fluxes of once-dominant deciduous forest generated by the Boreal Ecosystems Productivity Simulator (BEPS) are reduced to -0.78 ± 0.23 Pg C yr-1, the third largest carbon sink.
Global design optimization for an axial-flow tandem pump based on surrogate method
Li, D. H.; Zhao, Y.; Y Wang, G.
2013-12-01
Tandem pump, compared with multistage pump, goes without guide vanes between impellers. Better cavitation performance and significant reduction of the axial geometry scale is important for high-speed propulsion. This study presents a global design optimization method based on surrogated method for an axial-flow tandem pump to enhance trade-off performances: energy and cavitation performances. At the same time, interactions between impellers and impacts on the performances are analyzed. Fixed angle of blades in impellers and phase angle are performed as design variables. Efficiency and minimum average pressure coefficient (MAPC) on axial sectional surface in front impeller are the objective function, which can represent energy and cavitation performances well. Different surrogate models are constructed, and Global Sensitivity Analysis and Pareto Front method are used. The results show that, 1) Influence from phase angle on performances can be neglected compared with other two design variables, 2) Impact ratio of fixed angle of blades in two impellers on efficiency are the same as their designed loading distributions, which is 4:6, 3) The optimization results can enhance the trade-off performances well: efficiency is improved by 0.6%, and the MAPC is improved by 4.5%.
Parameter identification theory of a complex model based on global optimization method
2008-01-01
With the development of computer technology and numerical simulation technol- ogy, computer aided engineering (CAE) technology has been widely applied to many fields. One of the main obstacles, which hinder the further application of CAE technology, is how to successfully identify the parameters of the selected model. An elementary framework for parameter identification of a complex model is pro-vided in this paper. The framework includes the construction of objective function, the design of the optimization method and the evaluation of the identified results, etc. The parameter identification process is described in this framework, taking the parameter identification of the superplastic constitutive model considering grain growth for Ti-6Al-4V at 927℃ as an example. The objective function is the weighted quadratic sums of the difference between the experimental and computational data for the stress-strain relationship and the grain growth relationship; the designed optimization method is a hybrid global optimization method, which is based on the feature of the objective function and incorporates the strengths of genetic algo-rithm (GA), the Levenberg-Marquardt algorithm and the augmented Gauss-Newton algorithm. The reliability evaluation of parameter identification result is made through the comparison between the calculated and experimental results and be-tween the theoretical values of the parameters and the identified ones.
A GLOBALLY AND SUPERLINEARLY CONVERGENT TRUST REGION METHOD FOR LC1 OPTIMIZATION PROBLEMS
ZhangLiping; LaiYanlian
2001-01-01
Abstract. A new trust region algorithm for solving convex LC1 optimization problem is present-ed. It is proved that the algorithm is globally convergent and the rate of convergence is superlin-ear under some reasonable assumptions.
A FILTER-TRUST-REGION METHOD FOR LC1 UNCONSTRAINED OPTIMIZATION AND ITS GLOBAL CONVERGENCE
Zhenghao Yang; Wenyu Sun; Chuangyin Dang
2008-01-01
In this paper we present a filter-trust-region algorithm for solving LC1 unconstrained optimization problems which uses the second Dini upper directional derivative.We establish the global convergence of the algorithm under reasonable assumptions.
Stolpe, Mathias; Bendsøe, Martin P.
2007-01-01
This paper present some initial results pertaining to a search for globally optimal solutions to a challenging benchmark example proposed by Zhou and Rozvany. This means that we are dealing with global optimization of the classical single load minimum compliance topology design problem with a fixed...... finite element discretization and with discrete design variables. Global optimality is achieved by the implementation of some specially constructed convergent nonlinear branch and cut methods, based on the use of natural relaxations and by applying strengthening constraints (linear valid inequalities...
A hybrid cuckoo search algorithm with Nelder Mead method for solving global optimization problems.
Ali, Ahmed F; Tawhid, Mohamed A
2016-01-01
Cuckoo search algorithm is a promising metaheuristic population based method. It has been applied to solve many real life problems. In this paper, we propose a new cuckoo search algorithm by combining the cuckoo search algorithm with the Nelder-Mead method in order to solve the integer and minimax optimization problems. We call the proposed algorithm by hybrid cuckoo search and Nelder-Mead method (HCSNM). HCSNM starts the search by applying the standard cuckoo search for number of iterations then the best obtained solution is passing to the Nelder-Mead algorithm as an intensification process in order to accelerate the search and overcome the slow convergence of the standard cuckoo search algorithm. The proposed algorithm is balancing between the global exploration of the Cuckoo search algorithm and the deep exploitation of the Nelder-Mead method. We test HCSNM algorithm on seven integer programming problems and ten minimax problems and compare against eight algorithms for solving integer programming problems and seven algorithms for solving minimax problems. The experiments results show the efficiency of the proposed algorithm and its ability to solve integer and minimax optimization problems in reasonable time.
Park, Y. C.; Chang, M. H.; Lee, T.-Y.
2007-06-01
A deterministic global optimization method that is applicable to general nonlinear programming problems composed of twice-differentiable objective and constraint functions is proposed. The method hybridizes the branch-and-bound algorithm and a convex cut function (CCF). For a given subregion, the difference of a convex underestimator that does not need an iterative local optimizer to determine the lower bound of the objective function is generated. If the obtained lower bound is located in an infeasible region, then the CCF is generated for constraints to cut this region. The cutting region generated by the CCF forms a hyperellipsoid and serves as the basis of a discarding rule for the selected subregion. However, the convergence rate decreases as the number of cutting regions increases. To accelerate the convergence rate, an inclusion relation between two hyperellipsoids should be applied in order to reduce the number of cutting regions. It is shown that the two-hyperellipsoid inclusion relation is determined by maximizing a quadratic function over a sphere, which is a special case of a trust region subproblem. The proposed method is applied to twelve nonlinear programming test problems and five engineering design problems. Numerical results show that the proposed method converges in a finite calculation time and produces accurate solutions.
Pivot method for global optimization: A study of structures and phase changes in water clusters
Nigra, Pablo Fernando
In this thesis, we have carried out a study of water clusters. The research work has been developed in two stages. In the first stage, we have investigated the properties of water clusters at zero temperature by means of global optimization. The clusters were modeled by using two well known pairwise potentials having distinct characteristics. One is the Matsuoka-Clementi-Yoshimine potential (MCY) that is an ab initio fitted function based on a rigid-molecule model, the other is the Sillinger-Rahman potential (SR) which is an empirical function based on a flexible-molecule model. The algorithm used for the global optimization of the clusters was the pivot method, which was developed in our group. The results have shown that, under certain conditions, the pivot method may yield optimized structures which are related to one another in such a way that they seem to form structural families. The structures in a family can be thought of as formed from the aggregation of single units. The particular types of structures we have found are quasi-one dimensional tubes built from stacking cyclic units such as tetramers, pentamers, and hexamers. The binding energies of these tubes form sequences that span smooth curves with clear asymptotic behavior; therefore, we have also studied the sequences applying the Bulirsch-Stoer (BST) algorithm to accelerate convergence. In the second stage of the research work, we have studied the thermodynamic properties of a typical water cluster at finite temperatures. The selected cluster was the water octamer which exhibits a definite solid-liquid phase change. The water octamer also has several low lying energy cubic structures with large energetic barriers that cause ergodicity breaking in regular Monte Carlo simulations. For that reason we have simulated the octamer using paralell tempering Monte Carlo combined with the multihistogram method. This has permited us to calculate the heat capacity from very low temperatures up to T = 230 K. We
A GPS-Based Pitot-Static Calibration Method Using Global Output-Error Optimization
Foster, John V.; Cunningham, Kevin
2010-01-01
Pressure-based airspeed and altitude measurements for aircraft typically require calibration of the installed system to account for pressure sensing errors such as those due to local flow field effects. In some cases, calibration is used to meet requirements such as those specified in Federal Aviation Regulation Part 25. Several methods are used for in-flight pitot-static calibration including tower fly-by, pacer aircraft, and trailing cone methods. In the 1990 s, the introduction of satellite-based positioning systems to the civilian market enabled new inflight calibration methods based on accurate ground speed measurements provided by Global Positioning Systems (GPS). Use of GPS for airspeed calibration has many advantages such as accuracy, ease of portability (e.g. hand-held) and the flexibility of operating in airspace without the limitations of test range boundaries or ground telemetry support. The current research was motivated by the need for a rapid and statistically accurate method for in-flight calibration of pitot-static systems for remotely piloted, dynamically-scaled research aircraft. Current calibration methods were deemed not practical for this application because of confined test range size and limited flight time available for each sortie. A method was developed that uses high data rate measurements of static and total pressure, and GPSbased ground speed measurements to compute the pressure errors over a range of airspeed. The novel application of this approach is the use of system identification methods that rapidly compute optimal pressure error models with defined confidence intervals in nearreal time. This method has been demonstrated in flight tests and has shown 2- bounds of approximately 0.2 kts with an order of magnitude reduction in test time over other methods. As part of this experiment, a unique database of wind measurements was acquired concurrently with the flight experiments, for the purpose of experimental validation of the
Jian-Guo Zheng
2015-01-01
Full Text Available Artificial bee colony (ABC algorithm is a popular swarm intelligence technique inspired by the intelligent foraging behavior of honey bees. However, ABC is good at exploration but poor at exploitation and its convergence speed is also an issue in some cases. To improve the performance of ABC, a novel ABC combined with grenade explosion method (GEM and Cauchy operator, namely, ABCGC, is proposed. GEM is embedded in the onlooker bees’ phase to enhance the exploitation ability and accelerate convergence of ABCGC; meanwhile, Cauchy operator is introduced into the scout bees’ phase to help ABCGC escape from local optimum and further enhance its exploration ability. Two sets of well-known benchmark functions are used to validate the better performance of ABCGC. The experiments confirm that ABCGC is significantly superior to ABC and other competitors; particularly it converges to the global optimum faster in most cases. These results suggest that ABCGC usually achieves a good balance between exploitation and exploration and can effectively serve as an alternative for global optimization.
Conference on "State of the Art in Global Optimization : Computational Methods and Applications"
Pardalos, P
1996-01-01
Optimization problems abound in most fields of science, engineering, and technology. In many of these problems it is necessary to compute the global optimum (or a good approximation) of a multivariable function. The variables that define the function to be optimized can be continuous and/or discrete and, in addition, many times satisfy certain constraints. Global optimization problems belong to the complexity class of NP-hard prob lems. Such problems are very difficult to solve. Traditional descent optimization algorithms based on local information are not adequate for solving these problems. In most cases of practical interest the number of local optima increases, on the aver age, exponentially with the size of the problem (number of variables). Furthermore, most of the traditional approaches fail to escape from a local optimum in order to continue the search for the global solution. Global optimization has received a lot of attention in the past ten years, due to the success of new algorithms for solvin...
Efficiency of Pareto joint inversion of 2D geophysical data using global optimization methods
Miernik, Katarzyna; Bogacz, Adrian; Kozubal, Adam; Danek, Tomasz; Wojdyła, Marek
2016-04-01
Pareto joint inversion of two or more sets of data is a promising new tool of modern geophysical exploration. In the first stage of our investigation we created software enabling execution of forward solvers of two geophysical methods (2D magnetotelluric and gravity) as well as inversion with possibility of constraining solution with seismic data. In the algorithm solving MT forward solver Helmholtz's equations, finite element method and Dirichlet's boundary conditions were applied. Gravity forward solver was based on Talwani's algorithm. To limit dimensionality of solution space we decided to describe model as sets of polygons, using Sharp Boundary Interface (SBI) approach. The main inversion engine was created using Particle Swarm Optimization (PSO) algorithm adapted to handle two or more target functions and to prevent acceptance of solutions which are non - realistic or incompatible with Pareto scheme. Each inversion run generates single Pareto solution, which can be added to Pareto Front. The PSO inversion engine was parallelized using OpenMP standard, what enabled execution code for practically unlimited amount of threads at once. Thereby computing time of inversion process was significantly decreased. Furthermore, computing efficiency increases with number of PSO iterations. In this contribution we analyze the efficiency of created software solution taking under consideration details of chosen global optimization engine used as a main joint minimization engine. Additionally we study the scale of possible decrease of computational time caused by different methods of parallelization applied for both forward solvers and inversion algorithm. All tests were done for 2D magnetotelluric and gravity data based on real geological media. Obtained results show that even for relatively simple mid end computational infrastructure proposed solution of inversion problem can be applied in practice and used for real life problems of geophysical inversion and interpretation.
Convex analysis and global optimization
Tuy, Hoang
2016-01-01
This book presents state-of-the-art results and methodologies in modern global optimization, and has been a staple reference for researchers, engineers, advanced students (also in applied mathematics), and practitioners in various fields of engineering. The second edition has been brought up to date and continues to develop a coherent and rigorous theory of deterministic global optimization, highlighting the essential role of convex analysis. The text has been revised and expanded to meet the needs of research, education, and applications for many years to come. Updates for this new edition include: · Discussion of modern approaches to minimax, fixed point, and equilibrium theorems, and to nonconvex optimization; · Increased focus on dealing more efficiently with ill-posed problems of global optimization, particularly those with hard constraints;
methods for specially structured problems; · A complete revision of the chapter on nonconvex quadratic programming...
Guo, Chengan; Yang, Qingshan
2015-07-01
Finding the optimal solution to the constrained l0 -norm minimization problems in the recovery of compressive sensed signals is an NP-hard problem and it usually requires intractable combinatorial searching operations for getting the global optimal solution, unless using other objective functions (e.g., the l1 norm or lp norm) for approximate solutions or using greedy search methods for locally optimal solutions (e.g., the orthogonal matching pursuit type algorithms). In this paper, a neurodynamic optimization method is proposed to solve the l0 -norm minimization problems for obtaining the global optimum using a recurrent neural network (RNN) model. For the RNN model, a group of modified Gaussian functions are constructed and their sum is taken as the objective function for approximating the l0 norm and for optimization. The constructed objective function sets up a convexity condition under which the neurodynamic system is guaranteed to obtain the globally convergent optimal solution. An adaptive adjustment scheme is developed for improving the performance of the optimization algorithm further. Extensive experiments are conducted to test the proposed approach in this paper and the output results validate the effectiveness of the new method.
On unified modeling, theory, and method for solving multi-scale global optimization problems
Gao, David Yang
2016-10-01
A unified model is proposed for general optimization problems in multi-scale complex systems. Based on this model and necessary assumptions in physics, the canonical duality theory is presented in a precise way to include traditional duality theories and popular methods as special applications. Two conjectures on NP-hardness are proposed, which should play important roles for correctly understanding and efficiently solving challenging real-world problems. Applications are illustrated for both nonconvex continuous optimization and mixed integer nonlinear programming.
Lee, JongHyup; Pak, Dohyun
2016-08-29
For practical deployment of wireless sensor networks (WSN), WSNs construct clusters, where a sensor node communicates with other nodes in its cluster, and a cluster head support connectivity between the sensor nodes and a sink node. In hybrid WSNs, cluster heads have cellular network interfaces for global connectivity. However, when WSNs are active and the load of cellular networks is high, the optimal assignment of cluster heads to base stations becomes critical. Therefore, in this paper, we propose a game theoretic model to find the optimal assignment of base stations for hybrid WSNs. Since the communication and energy cost is different according to cellular systems, we devise two game models for TDMA/FDMA and CDMA systems employing power prices to adapt to the varying efficiency of recent wireless technologies. The proposed model is defined on the assumptions of the ideal sensing field, but our evaluation shows that the proposed model is more adaptive and energy efficient than local selections.
JongHyup Lee
2016-08-01
Full Text Available For practical deployment of wireless sensor networks (WSN, WSNs construct clusters, where a sensor node communicates with other nodes in its cluster, and a cluster head support connectivity between the sensor nodes and a sink node. In hybrid WSNs, cluster heads have cellular network interfaces for global connectivity. However, when WSNs are active and the load of cellular networks is high, the optimal assignment of cluster heads to base stations becomes critical. Therefore, in this paper, we propose a game theoretic model to find the optimal assignment of base stations for hybrid WSNs. Since the communication and energy cost is different according to cellular systems, we devise two game models for TDMA/FDMA and CDMA systems employing power prices to adapt to the varying efficiency of recent wireless technologies. The proposed model is defined on the assumptions of the ideal sensing field, but our evaluation shows that the proposed model is more adaptive and energy efficient than local selections.
Lithological and Surface Geometry Joint Inversions Using Multi-Objective Global Optimization Methods
Lelièvre, Peter; Bijani, Rodrigo; Farquharson, Colin
2016-04-01
surfaces are set to a priori values. The inversion is tasked with calculating the geometry of the contact surfaces instead of some piecewise distribution of properties in a mesh. Again, no coupling measure is required and joint inversion is simplified. Both of these inverse problems involve high nonlinearity and discontinuous or non-obtainable derivatives. They can also involve the existence of multiple minima. Hence, one can not apply the standard descent-based local minimization methods used to solve typical minimum-structure inversions. Instead, we are applying Pareto multi-objective global optimization (PMOGO) methods, which generate a suite of solutions that minimize multiple objectives (e.g. data misfits and regularization terms) in a Pareto-optimal sense. Providing a suite of models, as opposed to a single model that minimizes a weighted sum of objectives, allows a more complete assessment of the possibilities and avoids the often difficult choice of how to weight each objective. While there are definite advantages to PMOGO joint inversion approaches, the methods come with significantly increased computational requirements. We are researching various strategies to ameliorate these computational issues including parallelization and problem dimension reduction.
MONOTONIZATION IN GLOBAL OPTIMIZATION
WU ZHIYOU; BAI FUSHENG; ZHANG LIANSHENG
2005-01-01
A general monotonization method is proposed for converting a constrained programming problem with non-monotone objective function and monotone constraint functions into a monotone programming problem. An equivalent monotone programming problem with only inequality constraints is obtained via this monotonization method. Then the existingconvexification and concavefication methods can be used to convert the monotone programming problem into an equivalent better-structured optimization problem.
Rasmussen, Marie-Louise Højlund; Stolpe, Mathias
2008-01-01
the physics, and the cuts (Combinatorial Benders’ and projected Chvátal–Gomory) come from an understanding of the particular mathematical structure of the reformulation. The impact of a stronger representation is investigated on several truss topology optimization problems in two and three dimensions....... to a mixed-integer linear program, which is solved with a parallel implementation of branch-and-bound. Additional valid inequalities and cuts are introduced to give a stronger representation of the problem, which improves convergence and speed up of the parallel method. The valid inequalities represent...
A Global Optimization Approach to Quantum Mechanics
Huang, Xiaofei
2006-01-01
This paper presents a global optimization approach to quantum mechanics, which describes the most fundamental dynamics of the universe. It suggests that the wave-like behavior of (sub)atomic particles could be the critical characteristic of a global optimization method deployed by nature so that (sub)atomic systems can find their ground states corresponding to the global minimum of some energy function associated with the system. The classic time-independent Schrodinger equation is shown to b...
de Pascale, P.; Vasile, M.; Casotto, S.
The design of interplanetary trajectories requires the solution of an optimization problem, which has been traditionally solved by resorting to various local optimization techniques. All such approaches, apart from the specific method employed (direct or indirect), require an initial guess, which deeply influences the convergence to the optimal solution. The recent developments in low-thrust propulsion have widened the perspectives of exploration of the Solar System, while they have at the same time increased the difficulty related to the trajectory design process. Continuous thrust transfers, typically characterized by multiple spiraling arcs, have a broad number of design parameters and thanks to the flexibility offered by such engines, they typically turn out to be characterized by a multi-modal domain, with a consequent larger number of optimal solutions. Thus the definition of the first guesses is even more challenging, particularly for a broad search over the design parameters, and it requires an extensive investigation of the domain in order to locate the largest number of optimal candidate solutions and possibly the global optimal one. In this paper a tool for the preliminary definition of interplanetary transfers with coast-thrust arcs and multiple swing-bys is presented. Such goal is achieved combining a novel methodology for the description of low-thrust arcs, with a global optimization algorithm based on a hybridization of an evolutionary step and a deterministic step. Low thrust arcs are described in a 3D model in order to account the beneficial effects of low-thrust propulsion for a change of inclination, resorting to a new methodology based on an inverse method. The two-point boundary values problem (TPBVP) associated with a thrust arc is solved by imposing a proper parameterized evolution of the orbital parameters, by which, the acceleration required to follow the given trajectory with respect to the constraints set is obtained simply through
Miyazaki, Takahiko; Akisawa, Atsushi; Kashiwagi, Takao; Akahira, Akira
The study used the particle swarm optimization to maximize the specific cooling capacity (SCC) of a single-stage adsorption chiller, as well as to maximize the coefficient of performance (COP) at part load conditions of the chiller. The cycle time, which consists of adsorption/desorption time and pre-heating/ pre-cooling time, was chosen as a design parameter. The simulation results of a mathematical model showed a good agreement with experimental results on SCC and COP. It was shown that the SCC could be improved by the optimum cycle time as much as by 30% compared with that by the fixed cycle time. It was also presented that the part load COP would be significantly increased by the cycle time optimization at part load conditions.
Accelerating the SCE-UA Global Optimization Method Based on Multi-Core CPU and Many-Core GPU
Guangyuan Kan
2016-01-01
Full Text Available The famous global optimization SCE-UA method, which has been widely used in the field of environmental model parameter calibration, is an effective and robust method. However, the SCE-UA method has a high computational load which prohibits the application of SCE-UA to high dimensional and complex problems. In recent years, the hardware of computer, such as multi-core CPUs and many-core GPUs, improves significantly. These much more powerful new hardware and their software ecosystems provide an opportunity to accelerate the SCE-UA method. In this paper, we proposed two parallel SCE-UA methods and implemented them on Intel multi-core CPU and NVIDIA many-core GPU by OpenMP and CUDA Fortran, respectively. The Griewank benchmark function was adopted in this paper to test and compare the performances of the serial and parallel SCE-UA methods. According to the results of the comparison, some useful advises were given to direct how to properly use the parallel SCE-UA methods.
Global Optimization by Energy Landscape Paving
Wille, L T; Wille, Luc T.
2002-01-01
We introduce a novel heuristic global optimization method, energy landscape paving (ELP), which combines core ideas from energy surface deformation and tabu search. In appropriate limits, ELP reduces to existing techniques. The approach is very general and flexible and is illustrated here on two protein folding problems. For these examples, the technique gives faster convergence to the global minimum than previous approaches.
Extended Global Convergence Framework for Unconstrained Optimization
(A)rpád B(U)RMEN; Franc BRATKOVI(C); Janez PUHAN; Iztok FAJFAR; Tadej TUMA
2004-01-01
An extension of the global convergence framework for unconstrained derivative-free optimization methods is presented. The extension makes it possible for the framework to include optimization methods with varying cardinality of the ordered direction set. Grid-based search methods are shown to be a special case of the more general extended global convergence framework. Furthermore,the required properties of the sequence of ordered direction sets listed in the definition of grid-based methods are re]axed and simplified by removing the requirement of structural equivalence.
Hendrix, E.M.T.
1998-01-01
In many research situations where mathematical models are used, researchers try to find parameter values such that a given performance criterion is at an optimum. If the parameters can be varied in a continuous way, this in general defines a so-called Nonlinear Programming Problem. Methods for Nonli
Hendrix, E.M.T.
1998-01-01
In many research situations where mathematical models are used, researchers try to find parameter values such that a given performance criterion is at an optimum. If the parameters can be varied in a continuous way, this in general defines a so-called Nonlinear Programming Problem. Methods
Ma, Hongliang; Xu, Shijie
2016-11-01
By defining two open-time impulse points, the optimization of a two-impulse, open-time terminal rendezvous and docking with target spacecraft on large-eccentricity elliptical orbit is proposed in this paper. The purpose of optimization is to minimize the velocity increment for a terminal elliptic-reference-orbit rendezvous and docking. Current methods for solving this type of optimization problem include for example genetic algorithms and gradient based optimization. Unlike these methods, interval methods can guarantee that the globally best solution is found for a given parameterization of the input. The non-linear Tschauner- Hempel(TH) equations of the state transitions for a terminal elliptic target orbit are transformed form time domain to target orbital true anomaly domain. Their homogenous solutions and approximate state transition matrix for the control with a short true anomaly interval can be used to avoid interval integration. The interval branch and bound optimization algorithm is introduced for solving the presented rendezvous and docking optimization problem and optimizing two open-time impulse points and thruster pulse amplitudes, which systematically eliminates parts of the control and open-time input spaces that do not satisfy the path and final time state constraints. Several numerical examples are undertaken to validate the interval optimization algorithm. The results indicate that the sufficiently narrow spaces containing the global optimization solution for the open-time two-impulse terminal rendezvous and docking with target spacecraft on large-eccentricity elliptical orbit can be obtained by the interval algorithm (IA). Combining the gradient-based method, the global optimization solution for the discontinuous nonconvex optimization problem in the specifically remained search space can be found. Interval analysis is shown to be a useful tool and preponderant in the discontinuous nonconvex optimization problem of the terminal rendezvous and
FPSO Global Strength and Hull Optimization
Junyuan Ma; Jianhua Xiao; Rui Ma; Kai Cao
2014-01-01
Global strength is a significant item for floating production storage and offloading (FPSO) design, and steel weight plays an important role in the building costs of FPSO. It is the main task to consider and combine these two aspects by optimizing hull dimensions. There are many optional methods for the global strength analysis. A common method is to use the ABS FPSO Eagle software to analyze the global strength including the rule check and direct strength analysis. And the same method can be adopted for the FPSO hull optimization by changing the depth. After calculation and optimization, the results are compared and analyzed. The results can be used as a reference for the future design or quotation purpose.
FOGSAA: Fast Optimal Global Sequence Alignment Algorithm
Chakraborty, Angana; Bandyopadhyay, Sanghamitra
2013-04-01
In this article we propose a Fast Optimal Global Sequence Alignment Algorithm, FOGSAA, which aligns a pair of nucleotide/protein sequences faster than any optimal global alignment method including the widely used Needleman-Wunsch (NW) algorithm. FOGSAA is applicable for all types of sequences, with any scoring scheme, and with or without affine gap penalty. Compared to NW, FOGSAA achieves a time gain of (70-90)% for highly similar nucleotide sequences (> 80% similarity), and (54-70)% for sequences having (30-80)% similarity. For other sequences, it terminates with an approximate score. For protein sequences, the average time gain is between (25-40)%. Compared to three heuristic global alignment methods, the quality of alignment is improved by about 23%-53%. FOGSAA is, in general, suitable for aligning any two sequences defined over a finite alphabet set, where the quality of the global alignment is of supreme importance.
Intervals in evolutionary algorithms for global optimization
Patil, R.B.
1995-05-01
Optimization is of central concern to a number of disciplines. Interval Arithmetic methods for global optimization provide us with (guaranteed) verified results. These methods are mainly restricted to the classes of objective functions that are twice differentiable and use a simple strategy of eliminating a splitting larger regions of search space in the global optimization process. An efficient approach that combines the efficient strategy from Interval Global Optimization Methods and robustness of the Evolutionary Algorithms is proposed. In the proposed approach, search begins with randomly created interval vectors with interval widths equal to the whole domain. Before the beginning of the evolutionary process, fitness of these interval parameter vectors is defined by evaluating the objective function at the center of the initial interval vectors. In the subsequent evolutionary process the local optimization process returns an estimate of the bounds of the objective function over the interval vectors. Though these bounds may not be correct at the beginning due to large interval widths and complicated function properties, the process of reducing interval widths over time and a selection approach similar to simulated annealing helps in estimating reasonably correct bounds as the population evolves. The interval parameter vectors at these estimated bounds (local optima) are then subjected to crossover and mutation operators. This evolutionary process continues for predetermined number of generations in the search of the global optimum.
Wei, Zeng Xin; Li, Guo Yin; Qi, Li Qun
2008-12-01
We propose two algorithms for nonconvex unconstrained optimization problems that employ Polak-Ribiere-Polyak conjugate gradient formula and new inexact line search techniques. We show that the new algorithms converge globally if the function to be minimized has Lipschitz continuous gradients. Preliminary numerical results show that the proposed methods for particularly chosen line search conditions are very promising.
Global Optimality of the Successive Maxbet Algorithm.
Hanafi, Mohamed; ten Berge, Jos M. F.
2003-01-01
It is known that the Maxbet algorithm, which is an alternative to the method of generalized canonical correlation analysis and Procrustes analysis, may converge to local maxima. Discusses an eigenvalue criterion that is sufficient, but not necessary, for global optimality of the successive Maxbet algorithm. (SLD)
Evolutionary global optimization, manifolds and applications
Aguiar e Oliveira Junior, Hime
2016-01-01
This book presents powerful techniques for solving global optimization problems on manifolds by means of evolutionary algorithms, and shows in practice how these techniques can be applied to solve real-world problems. It describes recent findings and well-known key facts in general and differential topology, revisiting them all in the context of application to current optimization problems. Special emphasis is put on game theory problems. Here, these problems are reformulated as constrained global optimization tasks and solved with the help of Fuzzy ASA. In addition, more abstract examples, including minimizations of well-known functions, are also included. Although the Fuzzy ASA approach has been chosen as the main optimizing paradigm, the book suggests that other metaheuristic methods could be used as well. Some of them are introduced, together with their advantages and disadvantages. Readers should possess some knowledge of linear algebra, and of basic concepts of numerical analysis and probability theory....
A Survey on Meta-Heuristic Global Optimization Algorithms
Mohammad Khajehzadeh
2011-06-01
Full Text Available Optimization has been an active area of research for several decades. As many real-world optimization problems become increasingly complex, better optimization algorithms are always needed. Recently, metaheuristic global optimization algorithms have become a popular choice for solving complex and intricate problems, which are otherwise difficult to solve by traditional methods. In the present study, an attempt is made to review the most popular and well known metaheuristic global optimization algorithms introduced during the past decades.
Electromagnetics and antenna optimization using Taguchi's method
Weng, Wei-Chung
2007-01-01
This book presents a new global optimization technique using Taguchi's method and its applications in electromagnetics and antenna engineering. Compared with traditional optimization techniques, Taguchi's optimization method is easy to implement and very efficient in reaching optimum solutions.Taguchi's optimization method is developed based on the orthogonal array (OA) concept, which offers a systematic and efficient way to select design parameters. The book illustrates the basic implementation procedure of Taguchi's optimization method and discusses various advanced techniques for performanc
Fu, Rong-Huan; Zhang, Xing
2016-09-01
Supercritical carbon dioxide operated in a Brayton cycle offers a numerous of potential advantages for a power generation system, and a lot of thermodynamics analyses have been conducted to increase its efficiency. Because there are a lot of heat-absorbing and heat-lossing subprocesses in a practical thermodynamic cycle and they are implemented by heat exchangers, it will increase the gross efficiency of the whole power generation system to optimize the system combining thermodynamics and heat transfer theory. This paper analyzes the influence of the performance of heat exchangers on the actual efficiency of an ideal Brayton cycle with a simple configuration, and proposes a new method to optimize the power generation system, which aims at the minimum energy consumption. Although the method is operated only for the ideal working fluid in this paper, its merits compared to that only with thermodynamic analysis are fully shown.
A Novel Particle Swarm Optimization Algorithm for Global Optimization.
Wang, Chun-Feng; Liu, Kui
2016-01-01
Particle Swarm Optimization (PSO) is a recently developed optimization method, which has attracted interest of researchers in various areas due to its simplicity and effectiveness, and many variants have been proposed. In this paper, a novel Particle Swarm Optimization algorithm is presented, in which the information of the best neighbor of each particle and the best particle of the entire population in the current iteration is considered. Meanwhile, to avoid premature, an abandoned mechanism is used. Furthermore, for improving the global convergence speed of our algorithm, a chaotic search is adopted in the best solution of the current iteration. To verify the performance of our algorithm, standard test functions have been employed. The experimental results show that the algorithm is much more robust and efficient than some existing Particle Swarm Optimization algorithms.
Competing intelligent search agents in global optimization
Streltsov, S.; Vakili, P. [Boston Univ., MA (United States); Muchnik, I. [Rutgers Univ., Piscataway, NJ (United States)
1996-12-31
In this paper we present a new search methodology that we view as a development of intelligent agent approach to the analysis of complex system. The main idea is to consider search process as a competition mechanism between concurrent adaptive intelligent agents. Agents cooperate in achieving a common search goal and at the same time compete with each other for computational resources. We propose a statistical selection approach to resource allocation between agents that leads to simple and efficient on average index allocation policies. We use global optimization as the most general setting that encompasses many types of search problems, and show how proposed selection policies can be used to improve and combine various global optimization methods.
Biswas, A.; Sharma, S. P.
2012-12-01
Self-Potential anomaly is an important geophysical technique that measures the electrical potential due natural source of current in the Earth's subsurface. An inclined sheet type model is a very familiar structure associated with mineralization, fault plane, groundwater flow and many other geological features which exhibits self potential anomaly. A number of linearized and global inversion approaches have been developed for the interpretation of SP anomaly over different structures for various purposes. Mathematical expression to compute the forward response over a two-dimensional dipping sheet type structures can be described in three different ways using five variables in each case. Complexities in the inversion using three different forward approaches are different. Interpretation of self-potential anomaly using very fast simulated annealing global optimization has been developed in the present study which yielded a new insight about the uncertainty and equivalence in model parameters. Interpretation of the measured data yields the location of the causative body, depth to the top, extension, dip and quality of the causative body. In the present study, a comparative performance of three different forward approaches in the interpretation of self-potential anomaly is performed to assess the efficacy of the each approach in resolving the possible ambiguity. Even though each forward formulation yields the same forward response but optimization of different sets of variable using different forward problems poses different kinds of ambiguity in the interpretation. Performance of the three approaches in optimization has been compared and it is observed that out of three methods, one approach is best and suitable for this kind of study. Our VFSA approach has been tested on synthetic, noisy and field data for three different methods to show the efficacy and suitability of the best method. It is important to use the forward problem in the optimization that yields the
Dharmadi, Yandi; Gonzalez, Ramon
2005-04-08
HPLC optimization strategy consists of four elements; experimental design, retention modeling, quality criteria function, and optimum search method. In this paper we present a simple, superior alternative to general classes of classical resolution functions (S function) and a novel optimum search algorithm (iterative stochastic search, ISS) for HPLC optimization. Comparison of S with general classes of resolution-based quality criteria functions (Rs, Rp, and Rmin) shows superior features such as correct assessment of favorable separation conditions, preservation of peak pair contributions, elimination of arbitrary cut-off values, and a unique capability to interpret absolute significance of function values through a simple inequality. The proposed ISS algorithm is more robust than standard methods and it is easily applicable to hyperdimensional optimization. ISS also shows clear advantages in its ability to correctly identify the global optimum (instead of local optimum), with higher precision, with more efficient use of computation cycles, and with easier implementation. Successful application of S and ISS to HPLC optimization was demonstrated in the separation of representative functionalities (sugars, alcohols, and organic acids) present in microbial fermentations. Both the optimal and pathological (worst) conditions were successfully predicted and experimentally verified.
Stochastic optimization methods
Marti, Kurt
2005-01-01
Optimization problems arising in practice involve random parameters. For the computation of robust optimal solutions, i.e., optimal solutions being insensitive with respect to random parameter variations, deterministic substitute problems are needed. Based on the distribution of the random data, and using decision theoretical concepts, optimization problems under stochastic uncertainty are converted into deterministic substitute problems. Due to the occurring probabilities and expectations, approximative solution techniques must be applied. Deterministic and stochastic approximation methods and their analytical properties are provided: Taylor expansion, regression and response surface methods, probability inequalities, First Order Reliability Methods, convex approximation/deterministic descent directions/efficient points, stochastic approximation methods, differentiation of probability and mean value functions. Convergence results of the resulting iterative solution procedures are given.
Essays and surveys in global optimization
Audet, Charles; Savard, Giles
2005-01-01
Global optimization aims at solving the most general problems of deterministic mathematical programming. In addition, once the solutions are found, this methodology is also expected to prove their optimality. With these difficulties in mind, global optimization is becoming an increasingly powerful and important methodology. This book is the most recent examination of its mathematical capability, power, and wide ranging solutions to many fields in the applied sciences.
Microwave tomography global optimization, parallelization and performance evaluation
Noghanian, Sima; Desell, Travis; Ashtari, Ali
2014-01-01
This book provides a detailed overview on the use of global optimization and parallel computing in microwave tomography techniques. The book focuses on techniques that are based on global optimization and electromagnetic numerical methods. The authors provide parallelization techniques on homogeneous and heterogeneous computing architectures on high performance and general purpose futuristic computers. The book also discusses the multi-level optimization technique, hybrid genetic algorithm and its application in breast cancer imaging.
Introduction to Nonlinear and Global Optimization
Hendrix, E.M.T.; Tóth, B.
2010-01-01
This self-contained text provides a solid introduction to global and nonlinear optimization, providing students of mathematics and interdisciplinary sciences with a strong foundation in applied optimization techniques. The book offers a unique hands-on and critical approach to applied optimization
Fusion Global-Local-Topology Particle Swarm Optimization for Global Optimization Problems
Zahra Beheshti
2014-01-01
Full Text Available In recent years, particle swarm optimization (PSO has been extensively applied in various optimization problems because of its structural and implementation simplicity. However, the PSO can sometimes find local optima or exhibit slow convergence speed when solving complex multimodal problems. To address these issues, an improved PSO scheme called fusion global-local-topology particle swarm optimization (FGLT-PSO is proposed in this study. The algorithm employs both global and local topologies in PSO to jump out of the local optima. FGLT-PSO is evaluated using twenty (20 unimodal and multimodal nonlinear benchmark functions and its performance is compared with several well-known PSO algorithms. The experimental results showed that the proposed method improves the performance of PSO algorithm in terms of solution accuracy and convergence speed.
Hybrid and adaptive meta-model-based global optimization
Gu, J.; Li, G. Y.; Dong, Z.
2012-01-01
As an efficient and robust technique for global optimization, meta-model-based search methods have been increasingly used in solving complex and computation intensive design optimization problems. In this work, a hybrid and adaptive meta-model-based global optimization method that can automatically select appropriate meta-modelling techniques during the search process to improve search efficiency is introduced. The search initially applies three representative meta-models concurrently. Progress towards a better performing model is then introduced by selecting sample data points adaptively according to the calculated values of the three meta-models to improve modelling accuracy and search efficiency. To demonstrate the superior performance of the new algorithm over existing search methods, the new method is tested using various benchmark global optimization problems and applied to a real industrial design optimization example involving vehicle crash simulation. The method is particularly suitable for design problems involving computation intensive, black-box analyses and simulations.
Advances in stochastic and deterministic global optimization
Zhigljavsky, Anatoly; Žilinskas, Julius
2016-01-01
Current research results in stochastic and deterministic global optimization including single and multiple objectives are explored and presented in this book by leading specialists from various fields. Contributions include applications to multidimensional data visualization, regression, survey calibration, inventory management, timetabling, chemical engineering, energy systems, and competitive facility location. Graduate students, researchers, and scientists in computer science, numerical analysis, optimization, and applied mathematics will be fascinated by the theoretical, computational, and application-oriented aspects of stochastic and deterministic global optimization explored in this book. This volume is dedicated to the 70th birthday of Antanas Žilinskas who is a leading world expert in global optimization. Professor Žilinskas's research has concentrated on studying models for the objective function, the development and implementation of efficient algorithms for global optimization with single and mu...
Global optimality of extremals: An example
Kreindler, E.; Newman, F.
1980-01-01
The question of the existence and location of Darboux points is crucial for minimally sufficient conditions for global optimality and for computation of optimal trajectories. A numerical investigation is presented of the Darboux points and their relationship with conjugate points for a problem of minimum fuel, constant velocity, and horizontal aircraft turns to capture a line. This simple second order optimal control problem shows that ignoring the possible existence of Darboux points may play havoc with the computation of optimal trajectories.
Practical methods of optimization
Fletcher, R
2013-01-01
Fully describes optimization methods that are currently most valuable in solving real-life problems. Since optimization has applications in almost every branch of science and technology, the text emphasizes their practical aspects in conjunction with the heuristics useful in making them perform more reliably and efficiently. To this end, it presents comparative numerical studies to give readers a feel for possibile applications and to illustrate the problems in assessing evidence. Also provides theoretical background which provides insights into how methods are derived. This edition offers rev
Gómez Susana
2014-07-01
Full Text Available The aim of this work is to study the automatic characterization of Naturally Fractured Vuggy Reservoirs via well test analysis, using a triple porosity-dual permeability model. The inter-porosity flow parameters, the storativity ratios, as well as the permeability ratio, the wellbore storage effect, the skin and the total permeability will be identified as parameters of the model. In this work, we will perform the well test interpretation in Laplace space, using numerical algorithms to transfer the discrete real data given in fully dimensional time to Laplace space. The well test interpretation problem in Laplace space has been posed as a nonlinear least squares optimization problem with box constraints and a linear inequality constraint, which is usually solved using local Newton type methods with a trust region. However, local methods as the one used in our work called TRON or the well-known Levenberg-Marquardt method, are often not able to find an optimal solution with a good fit of the data. Also well test analysis with the triple porosity-double permeability model, like most inverse problems, can yield multiple solutions with good match to the data. To deal with these specific characteristics, we will use a global optimization algorithm called the Tunneling Method (TM. In the design of the algorithm, we take into account issues of the problem like the fact that the parameter estimation has to be done with high precision, the presence of noise in the measurements and the need to solve the problem computationally fast. We demonstrate that the use of the TM in this study, showed to be an efficient and robust alternative to solve the well test characterization, as several optimal solutions, with very good match to the data were obtained.
Gradient-Based Cuckoo Search for Global Optimization
Seif-Eddeen K. Fateen
2014-01-01
Full Text Available One of the major advantages of stochastic global optimization methods is the lack of the need of the gradient of the objective function. However, in some cases, this gradient is readily available and can be used to improve the numerical performance of stochastic optimization methods specially the quality and precision of global optimal solution. In this study, we proposed a gradient-based modification to the cuckoo search algorithm, which is a nature-inspired swarm-based stochastic global optimization method. We introduced the gradient-based cuckoo search (GBCS and evaluated its performance vis-à-vis the original algorithm in solving twenty-four benchmark functions. The use of GBCS improved reliability and effectiveness of the algorithm in all but four of the tested benchmark problems. GBCS proved to be a strong candidate for solving difficult optimization problems, for which the gradient of the objective function is readily available.
A Controlled Particle Filter for Global Optimization
Zhang, Chi; Taghvaei, Amirhossein; Mehta, Prashant G.
2017-01-01
A particle filter is introduced to numerically approximate a solution of the global optimization problem. The theoretical significance of this work comes from its variational aspects: (i) the proposed particle filter is a controlled interacting particle system where the control input represents the solution of a mean-field type optimal control problem; and (ii) the associated density transport is shown to be a gradient flow (steepest descent) for the optimal value function, with respect to th...
Modified evolutionary algorithm for global optimization
郭崇慧; 陆玉昌; 唐焕文
2004-01-01
A modification of evolutionary programming or evolution strategies for n-dimensional global optimization is proposed. Based on the ergodicity and inherent-randomness of chaos, the main characteristic of the new algorithm which includes two phases is that chaotic behavior is exploited to conduct a rough search of the problem space in order to find the promising individuals in Phase Ⅰ. Adjustment strategy of step-length and intensive searches in Phase Ⅱ are employed.The population sequences generated by the algorithm asymptotically converge to global optimal solutions with probability one. The proposed algorithm is applied to several typical test problems. Numerical results illustrate that this algorithm can more efficiently solve complex global optimization problems than evolutionary programming and evolution strategies in most cases.
Global 4-D trajectory optimization for spacecraft
无
2010-01-01
Global 4-D trajectory(x,y,z,t)is optimized for a spacecraft,which is launched from the Earth to fly around the Sun,just as star-drift of 1437 asteroids in the solar system.The spacecraft trajectory is controlled by low thrust.The performance index of optimal trajectory is to maximize the rendezvous times with the intermediate asteroids,and also maximize the final mass.This paper provides a combined algorithm of global 4-D trajectory optimization.The algorithm is composed of dynamic programming and two-point-boundary algorithm based on optimal control theory.The best 4-D trajectory is obtained:the spacecraft flies passing 55 asteroids,and rendezvous with(following or passing again)asteroids for 454 days,and finally rendezvous with the asteroid 2005SN25 on the day 60521(MJD),the final mass of the spacecraft is 836.53 kg.
Deterministic global optimization an introduction to the diagonal approach
Sergeyev, Yaroslav D
2017-01-01
This book begins with a concentrated introduction into deterministic global optimization and moves forward to present new original results from the authors who are well known experts in the field. Multiextremal continuous problems that have an unknown structure with Lipschitz objective functions and functions having the first Lipschitz derivatives defined over hyperintervals are examined. A class of algorithms using several Lipschitz constants is introduced which has its origins in the DIRECT (DIviding RECTangles) method. This new class is based on an efficient strategy that is applied for the search domain partitioning. In addition a survey on derivative free methods and methods using the first derivatives is given for both one-dimensional and multi-dimensional cases. Non-smooth and smooth minorants and acceleration techniques that can speed up several classes of global optimization methods with examples of applications and problems arising in numerical testing of global optimization algorithms are discussed...
Conference on Convex Analysis and Global Optimization
Pardalos, Panos
2001-01-01
There has been much recent progress in global optimization algo rithms for nonconvex continuous and discrete problems from both a theoretical and a practical perspective. Convex analysis plays a fun damental role in the analysis and development of global optimization algorithms. This is due essentially to the fact that virtually all noncon vex optimization problems can be described using differences of convex functions and differences of convex sets. A conference on Convex Analysis and Global Optimization was held during June 5 -9, 2000 at Pythagorion, Samos, Greece. The conference was honoring the memory of C. Caratheodory (1873-1950) and was en dorsed by the Mathematical Programming Society (MPS) and by the Society for Industrial and Applied Mathematics (SIAM) Activity Group in Optimization. The conference was sponsored by the European Union (through the EPEAEK program), the Department of Mathematics of the Aegean University and the Center for Applied Optimization of the University of Florida, by th...
Modified constrained differential evolution for solving nonlinear global optimization problems
2013-01-01
Nonlinear optimization problems introduce the possibility of multiple local optima. The task of global optimization is to find a point where the objective function obtains its most extreme value while satisfying the constraints. Some methods try to make the solution feasible by using penalty function methods, but the performance is not always satisfactory since the selection of the penalty parameters for the problem at hand is not a straightforward issue. Differential evolut...
Horton, Pascal; Weingartner, Rolf; Obled, Charles; Jaboyedoff, Michel
2016-04-01
The Analogue Method (AM) aims at forecasting a local meteorological variable of interest (the predictand), often the daily precipitation total, on the basis of a statistical relationship with synoptic predictor variables. A certain number of similar situations are sampled in order to establish the empirical conditional distribution which is considered as the prediction for a given date. The method is used in operational medium-range forecasting in several hydropower companies or flood forecasting services, as well as in climate impact studies. The statistical relationship is usually established by means of a semi-automatic sequential procedure that has strong limitations: it is made of successive steps and thus cannot handle parameters dependencies, and it cannot automatically optimize certain parameters, such as the selection of the pressure levels and the temporal windows on which the predictors are compared. A global optimization technique based on Genetic Algorithms was introduced in order to surpass these limitations and to provide a fully automatic and objective determination of the AM parameters. The parameters that were previously assessed manually, such as the selection of the pressure levels and the temporal windows, on which the predictors are compared, are now automatically determined. The next question is: Are Genetic Algorithms able to select the meteorological variable, in a reanalysis dataset, that is the best predictor for the considered predictand, along with the analogy criteria itself? Even though we may not find better predictors for precipitation prediction that the ones often used in Europe, due to numerous other studies which consisted in systematic assessments, the ability of an automatic selection offers new perspectives in order to adapt the AM for new predictands or new regions under different meteorological influences.
Simulating Protein Conformations through Global Optimization
Mucherino, A; Pardalos, P M
2008-01-01
Many researches have been working on the protein folding problem from more than half century. Protein folding is indeed one of the major unsolved problems in science. In this work, we discuss a model for the simulation of protein conformations. This simple model is based on the idea of imposing few geometric requirements on chains of atoms representing the backbone of a protein conformation. The model leads to the formulation of a global optimization problem, whose solutions correspond to conformations satisfying the desired requirements. The global optimization problem is solved by the recently proposed Monkey Search algorithm. The simplicity of the optimization problem and the effectiveness of the used meta-heuristic search allowed the simulation of a large set of high-quality conformations. We show that, even though only few geometric requirements are imposed, some of the simulated conformation results to be similar (in terms of RMSD) to conformations real proteins actually have in nature.
Stochastic optimization methods
Marti, Kurt
2008-01-01
Optimization problems arising in practice involve random model parameters. This book features many illustrations, several examples, and applications to concrete problems from engineering and operations research.
Compact video synopsis via global spatiotemporal optimization.
Nie, Yongwei; Xiao, Chunxia; Sun, Hanqiu; Li, Ping
2013-10-01
Video synopsis aims at providing condensed representations of video data sets that can be easily captured from digital cameras nowadays, especially for daily surveillance videos. Previous work in video synopsis usually moves active objects along the time axis, which inevitably causes collisions among the moving objects if compressed much. In this paper, we propose a novel approach for compact video synopsis using a unified spatiotemporal optimization. Our approach globally shifts moving objects in both spatial and temporal domains, which shifting objects temporally to reduce the length of the video and shifting colliding objects spatially to avoid visible collision artifacts. Furthermore, using a multilevel patch relocation (MPR) method, the moving space of the original video is expanded into a compact background based on environmental content to fit with the shifted objects. The shifted objects are finally composited with the expanded moving space to obtain the high-quality video synopsis, which is more condensed while remaining free of collision artifacts. Our experimental results have shown that the compact video synopsis we produced can be browsed quickly, preserves relative spatiotemporal relationships, and avoids motion collisions.
Rodiet, Christophe; Remy, Benjamin; Degiovanni, Alain
2016-05-01
In this paper, it is shown how to select the optimal wavelengths minimizing the relative error and the standard deviation of the temperature. Furthermore, it is shown that the optimal wavelengths in mono-spectral and bi-spectral methods (for a Planck's law) can be determined by laws analogous to the displacement Wien's law. The simplicity of these laws can thus allow real-time selection of optimal wavelengths for a control/optimization of industrial processes, for example. A more general methodology to obtain the optimal wavelengths selection in a multi-spectral method (taking into account the spectral variations of the global transfer function including the emissivity variations) for temperature measurement of surfaces exhibiting non-uniform emissivity, is also presented. This latter can then find an interest in glass furnaces temperature measurement with spatiotemporal non-uniformities of emissivity, the control of biomass pyrolysis, the surface temperature measurement of buildings or heating devices, for example. The goal consists of minimizing the standard deviation of the estimated temperature (optimal design experiment). For the multi-spectral method, two cases will be treated: optimal global and optimal constrained wavelengths selection (to the spectral range of the detector, for example). The estimated temperature results obtained by different models and for different number of parameters and wavelengths are compared. These different points are treated from theoretical, numerical and experimental points of view.
Global Optimal Trajectory in Chaos and NP-Hardness
Latorre, Vittorio; Gao, David Yang
This paper presents an unconventional theory and method for solving general nonlinear dynamical systems. Instead of the direct iterative methods, the discretized nonlinear system is first formulated as a global optimization problem via the least squares method. A newly developed canonical duality theory shows that this nonconvex minimization problem can be solved deterministically in polynomial time if a global optimality condition is satisfied. The so-called pseudo-chaos produced by linear iterative methods are mainly due to the intrinsic numerical error accumulations. Otherwise, the global optimization problem could be NP-hard and the nonlinear system can be really chaotic. A conjecture is proposed, which reveals the connection between chaos in nonlinear dynamics and NP-hardness in computer science. The methodology and the conjecture are verified by applications to the well-known logistic equation, a forced memristive circuit and the Lorenz system. Computational results show that the canonical duality theory can be used to identify chaotic systems and to obtain realistic global optimal solutions in nonlinear dynamical systems. The method and results presented in this paper should bring some new insights into nonlinear dynamical systems and NP-hardness in computational complexity theory.
Solving global optimization problems on GPU cluster
Barkalov, Konstantin; Gergel, Victor; Lebedev, Ilya
2016-06-01
The paper contains the results of investigation of a parallel global optimization algorithm combined with a dimension reduction scheme. This allows solving multidimensional problems by means of reducing to data-independent subproblems with smaller dimension solved in parallel. The new element implemented in the research consists in using several graphic accelerators at different computing nodes. The paper also includes results of solving problems of well-known multiextremal test class GKLS on Lobachevsky supercomputer using tens of thousands of GPU cores.
Optimizing human activity patterns using global sensitivity analysis.
Fairchild, Geoffrey; Hickmann, Kyle S; Mniszewski, Susan M; Del Valle, Sara Y; Hyman, James M
2014-12-01
Implementing realistic activity patterns for a population is crucial for modeling, for example, disease spread, supply and demand, and disaster response. Using the dynamic activity simulation engine, DASim, we generate schedules for a population that capture regular (e.g., working, eating, and sleeping) and irregular activities (e.g., shopping or going to the doctor). We use the sample entropy (SampEn) statistic to quantify a schedule's regularity for a population. We show how to tune an activity's regularity by adjusting SampEn, thereby making it possible to realistically design activities when creating a schedule. The tuning process sets up a computationally intractable high-dimensional optimization problem. To reduce the computational demand, we use Bayesian Gaussian process regression to compute global sensitivity indices and identify the parameters that have the greatest effect on the variance of SampEn. We use the harmony search (HS) global optimization algorithm to locate global optima. Our results show that HS combined with global sensitivity analysis can efficiently tune the SampEn statistic with few search iterations. We demonstrate how global sensitivity analysis can guide statistical emulation and global optimization algorithms to efficiently tune activities and generate realistic activity patterns. Though our tuning methods are applied to dynamic activity schedule generation, they are general and represent a significant step in the direction of automated tuning and optimization of high-dimensional computer simulations.
Global metabolic optimality in the structure of the coronary arteries
Keelan, Jonathan; Hague, James P
2014-01-01
The structure of the large coronary arteries is both heritable and reasonably consistent between individuals, but the extent to which this results from evolutionary pressure towards an energy-efficient, globally-optimal, structure is unknown. We present an algorithm for the determination of an energetically globally optimal arterial tree in arbitrary tissue geometries. We demonstrate through application of the algorithm that it is possible to generate in-silico vasculatures that closely match porcine anatomical data on all length scales. We therefore conclude that evolutionary pressure has resulted in a near globally optimal structure of the larger coronary arteries. We also examine the effect of changing length scales, predicting that the structures of the coronary arteries can change from a meandering form for small animals to very straight vessels for large animals. The method presented here is not limited to hearts, and represents a major advance in modeling the arterial vasculature, that could have impor...
Analytical methods of optimization
Lawden, D F
2006-01-01
Suitable for advanced undergraduates and graduate students, this text surveys the classical theory of the calculus of variations. It takes the approach most appropriate for applications to problems of optimizing the behavior of engineering systems. Two of these problem areas have strongly influenced this presentation: the design of the control systems and the choice of rocket trajectories to be followed by terrestrial and extraterrestrial vehicles.Topics include static systems, control systems, additional constraints, the Hamilton-Jacobi equation, and the accessory optimization problem. Prereq
Application of clustering global optimization to thin film design problems.
Lemarchand, Fabien
2014-03-10
Refinement techniques usually calculate an optimized local solution, which is strongly dependent on the initial formula used for the thin film design. In the present study, a clustering global optimization method is used which can iteratively change this initial formula, thereby progressing further than in the case of local optimization techniques. A wide panel of local solutions is found using this procedure, resulting in a large range of optical thicknesses. The efficiency of this technique is illustrated by two thin film design problems, in particular an infrared antireflection coating, and a solar-selective absorber coating.
An Efficient Globally Optimal Algorithm for Asymmetric Point Matching.
Lian, Wei; Zhang, Lei; Yang, Ming-Hsuan
2016-08-29
Although the robust point matching algorithm has been demonstrated to be effective for non-rigid registration, there are several issues with the adopted deterministic annealing optimization technique. First, it is not globally optimal and regularization on the spatial transformation is needed for good matching results. Second, it tends to align the mass centers of two point sets. To address these issues, we propose a globally optimal algorithm for the robust point matching problem where each model point has a counterpart in scene set. By eliminating the transformation variables, we show that the original matching problem is reduced to a concave quadratic assignment problem where the objective function has a low rank Hessian matrix. This facilitates the use of large scale global optimization techniques. We propose a branch-and-bound algorithm based on rectangular subdivision where in each iteration, multiple rectangles are used to increase the chances of subdividing the one containing the global optimal solution. In addition, we present an efficient lower bounding scheme which has a linear assignment formulation and can be efficiently solved. Extensive experiments on synthetic and real datasets demonstrate the proposed algorithm performs favorably against the state-of-the-art methods in terms of robustness to outliers, matching accuracy, and run-time.
Achtziger, Wolfgang; Stolpe, Mathias
2007-01-01
.e., a 0/1 problem. In contrast to the heuristic methods considered in many other approaches, our goal is to compute guaranteed globally optimal structures. This is done by a branch-and-bound method for which convergence can be proven. In this branch-and-bound framework, lower bounds of the optimal......-integer problems. The main intention of this paper is to provide optimal solutions for single and multiple load benchmark examples, which can be used for testing and validating other methods or heuristics for the treatment of this discrete topology design problem....
Calibration of Conceptual Rainfall-Runoff Models Using Global Optimization
Chao Zhang
2015-01-01
Full Text Available Parameter optimization for the conceptual rainfall-runoff (CRR model has always been the difficult problem in hydrology since watershed hydrological model is high-dimensional and nonlinear with multimodal and nonconvex response surface and its parameters are obviously related and complementary. In the research presented here, the shuffled complex evolution (SCE-UA global optimization method was used to calibrate the Xinanjiang (XAJ model. We defined the ideal data and applied the method to observed data. Our results show that, in the case of ideal data, the data length did not affect the parameter optimization for the hydrological model. If the objective function was selected appropriately, the proposed method found the true parameter values. In the case of observed data, we applied the technique to different lengths of data (1, 2, and 3 years and compared the results with ideal data. We found that errors in the data and model structure lead to significant uncertainties in the parameter optimization.
Kuhn, Sebastian [Gelsenwasser AG, Gelsenkirchen (Germany)
2012-06-15
PriceForwardCurves, the commonly used abbreviation is PFCs, represent the expected future price development of commodities. Thereby, they base on current market prices as well as historical information. In addition to constructing an arbitration free curve harmonizing with current market data, seasonal effects seriously influence the resulting PFC. The article at hand introduces a quadratic optimization model in its general description. Its optimal solution then reflects the implicitly given seasonal patterns best possible. The optimization model is in a description allowing to verifiably reach the global optimal solution with standard solvers. Subsequently, the computed seasonal function is transformed in an analytic form using the discrete Fourier transformation. Numerical computations are presented for high caloric gas in the market area NCG, because the gas market is particularly subjected to strong seasonal trends. Thereby, the official trade data of the EEX are used. (orig.)
Smoothing techniques for macromolecular global optimization
More, J.J.; Wu, Zhijun
1995-09-01
We study global optimization problems that arise in macromolecular modeling, and the solution of these problems via continuation and smoothing. Our results unify and extend the theory associated with the use of the Gaussian transform for smoothing. We show that the, Gaussian transform can be viewed as a special case of a generalized transform and that these generalized transforms share many of the properties of the Gaussian transform. We also show that the smoothing behavior of the generalized transform can be studied in terms of the Fourier transform and that these results indicate that the Gaussian transform has superior smoothing properties.
On Global Optimal Sailplane Flight Strategy
Sander, G. J.; Litt, F. X.
1979-01-01
The derivation and interpretation of the necessary conditions that a sailplane cross-country flight has to satisfy to achieve the maximum global flight speed is considered. Simple rules are obtained for two specific meteorological models. The first one uses concentrated lifts of various strengths and unequal distance. The second one takes into account finite, nonuniform space amplitudes for the lifts and allows, therefore, for dolphin style flight. In both models, altitude constraints consisting of upper and lower limits are shown to be essential to model realistic problems. Numerical examples illustrate the difference with existing techniques based on local optimality conditions.
Zhang, Yong-Feng; Chiang, Hsiao-Dong
2016-06-20
A novel three-stage methodology, termed the "consensus-based particle swarm optimization (PSO)-assisted Trust-Tech methodology," to find global optimal solutions for nonlinear optimization problems is presented. It is composed of Trust-Tech methods, consensus-based PSO, and local optimization methods that are integrated to compute a set of high-quality local optimal solutions that can contain the global optimal solution. The proposed methodology compares very favorably with several recently developed PSO algorithms based on a set of small-dimension benchmark optimization problems and 20 large-dimension test functions from the CEC 2010 competition. The analytical basis for the proposed methodology is also provided. Experimental results demonstrate that the proposed methodology can rapidly obtain high-quality optimal solutions that can contain the global optimal solution. The scalability of the proposed methodology is promising.
Non-linear Global Optimization using Interval Arithmetic and Constraint Propagation
Kjøller, Steffen; Kozine, Pavel; Madsen, Kaj;
2006-01-01
In this Chapter a new branch-and-bound method for global optimization is presented. The method combines the classical interval global optimization method with constraint propagation techniques. The latter is used for including solutions of the necessary condition f'(x)=0. The constraint propagation...
Global-local optimization of flapping kinematics in hovering flight
Ghommem, Mehdi
2013-06-01
The kinematics of a hovering wing are optimized by combining the 2-d unsteady vortex lattice method with a hybrid of global and local optimization algorithms. The objective is to minimize the required aerodynamic power under a lift constraint. The hybrid optimization is used to efficiently navigate the complex design space due to wing-wake interference present in hovering aerodynamics. The flapping wing is chosen so that its chord length and flapping frequency match the morphological and flight properties of two insects with different masses. The results suggest that imposing a delay between the different oscillatory motions defining the flapping kinematics, and controlling the way through which the wing rotates at the end of each half stroke can improve aerodynamic power under a lift constraint. Furthermore, our optimization analysis identified optimal kinematics that agree fairly well with observed insect kinematics, as well as previously published numerical results.
Optimizing Methods in Simulation
1981-08-01
exploited by Kiefer and Wolfowitz -; (1959). Wald (1943) used the criterion of D-optimality - in some other context and was so named by Kiefer and...of discrepency between the observed and expected value A is obtained in terms of mean squared errors ( MSE ). i Consider the model, E(Ylx) = a + ex and...V(YIX) = 0 2 Let L < x < U, be the interval of possible x values. The MSE (x) is the mean squared error of x as obtained from y. Let w(x) be a weight
Global Sufficient Optimality Conditions for a Special Cubic Minimization Problem
Xiaomei Zhang
2012-01-01
Full Text Available We present some sufficient global optimality conditions for a special cubic minimization problem with box constraints or binary constraints by extending the global subdifferential approach proposed by V. Jeyakumar et al. (2006. The present conditions generalize the results developed in the work of V. Jeyakumar et al. where a quadratic minimization problem with box constraints or binary constraints was considered. In addition, a special diagonal matrix is constructed, which is used to provide a convenient method for justifying the proposed sufficient conditions. Then, the reformulation of the sufficient conditions follows. It is worth noting that this reformulation is also applicable to the quadratic minimization problem with box or binary constraints considered in the works of V. Jeyakumar et al. (2006 and Y. Wang et al. (2010. Finally some examples demonstrate that our optimality conditions can effectively be used for identifying global minimizers of the certain nonconvex cubic minimization problem.
Optimization methods for logical inference
Chandru, Vijay
2011-01-01
Merging logic and mathematics in deductive inference-an innovative, cutting-edge approach. Optimization methods for logical inference? Absolutely, say Vijay Chandru and John Hooker, two major contributors to this rapidly expanding field. And even though ""solving logical inference problems with optimization methods may seem a bit like eating sauerkraut with chopsticks. . . it is the mathematical structure of a problem that determines whether an optimization model can help solve it, not the context in which the problem occurs."" Presenting powerful, proven optimization techniques for logic in
Solving Packing Problems by a Distributed Global Optimization Algorithm
Nian-Ze Hu
2012-01-01
Full Text Available Packing optimization problems aim to seek the best way of placing a given set of rectangular boxes within a minimum volume rectangular box. Current packing optimization methods either find it difficult to obtain an optimal solution or require too many extra 0-1 variables in the solution process. This study develops a novel method to convert the nonlinear objective function in a packing program into an increasing function with single variable and two fixed parameters. The original packing program then becomes a linear program promising to obtain a global optimum. Such a linear program is decomposed into several subproblems by specifying various parameter values, which is solvable simultaneously by a distributed computation algorithm. A reference solution obtained by applying a genetic algorithm is used as an upper bound of the optimal solution, used to reduce the entire search region.
borealis - A generalized global update algorithm for Boolean optimization problems
Zhu, Zheng; Katzgraber, Helmut G
2016-01-01
Optimization problems with Boolean variables that fall into the nondeterministic polynomial (NP) class are of fundamental importance in computer science, mathematics, physics and industrial applications. Most notably, solving constraint-satisfaction problems, which are related to spin-glass-like Hamiltonians in physics, remains a difficult numerical task. As such, there has been great interest in designing efficient heuristics to solve these computationally difficult problems. Inspired by parallel tempering Monte Carlo in conjunction with the rejection-free isoenergetic cluster algorithm developed for Ising spin glasses, we present a generalized global update optimization heuristic that can be applied to different NP-complete problems with Boolean variables. The global cluster updates allow for a wide-spread sampling of phase space, thus considerably speeding up optimization. By carefully tuning the pseudo-temperature (needed to randomize the configurations) of the problem, we show that the method can efficie...
Blindman-Walking Optimization Method
Chunming Li
2010-12-01
Full Text Available Optimization methods are all implemented with the hypothesis of unknowing the mathematic express of objective objection. Using the human analogy innovative method, the one-dimension blind-walking optimal method is proposed in this paper. The theory and the algorithm of this method includes halving, doubling, reversing probing step and verifying the applicability condition. Double-step is available to make current point moving to the extremum point. Half-step is available to accelerate convergence. In order to improve the optimization, the applicability condition decides whether update current point or not. The operation process, algorithmic flow chart and characteristic analysis of the method were given. Two optimization problems with unimodal or multimodal objective function were solved by the proposed method respectively. The simulation result shows that the proposed method is better than the ordinary method. The proposed method has the merit of rapid convergence, little calculation capacity, wide applicable range, etc. Taking the method as innovative kernel, the random research method, feasible direction method and complex shape method were improved. Taking the innovative content of this paper as innovative kernel, a monograph was published. The other innovations of the monograph are listed, such as applied algorithm of Karush-Kuhn-Tucker (KKT qualifications on judging the restriction extremum point, the design step of computing software, the complementarity and derivation of Powell criterion, the method of keeping the complex shape not to deduce dimension and the analysis of gradual optimization characteristic, the reinforced wall of inner point punish function method, the analysis of problem with constrained monstrosity extremum point, the improvement of Newton method and the validation of optimization idea of blind walking repeatedly, the explanation of later-day optimization method, the conformity of seeking algorithm needing the
Global Optimization of Nonlinear Blend-Scheduling Problems
Pedro A. Castillo Castillo
2017-04-01
Full Text Available The scheduling of gasoline-blending operations is an important problem in the oil refining industry. This problem not only exhibits the combinatorial nature that is intrinsic to scheduling problems, but also non-convex nonlinear behavior, due to the blending of various materials with different quality properties. In this work, a global optimization algorithm is proposed to solve a previously published continuous-time mixed-integer nonlinear scheduling model for gasoline blending. The model includes blend recipe optimization, the distribution problem, and several important operational features and constraints. The algorithm employs piecewise McCormick relaxation (PMCR and normalized multiparametric disaggregation technique (NMDT to compute estimates of the global optimum. These techniques partition the domain of one of the variables in a bilinear term and generate convex relaxations for each partition. By increasing the number of partitions and reducing the domain of the variables, the algorithm is able to refine the estimates of the global solution. The algorithm is compared to two commercial global solvers and two heuristic methods by solving four examples from the literature. Results show that the proposed global optimization algorithm performs on par with commercial solvers but is not as fast as heuristic approaches.
Global Design Optimization for Aerodynamics and Rocket Propulsion Components
Shyy, Wei; Papila, Nilay; Vaidyanathan, Rajkumar; Tucker, Kevin; Turner, James E. (Technical Monitor)
2000-01-01
Modern computational and experimental tools for aerodynamics and propulsion applications have matured to a stage where they can provide substantial insight into engineering processes involving fluid flows, and can be fruitfully utilized to help improve the design of practical devices. In particular, rapid and continuous development in aerospace engineering demands that new design concepts be regularly proposed to meet goals for increased performance, robustness and safety while concurrently decreasing cost. To date, the majority of the effort in design optimization of fluid dynamics has relied on gradient-based search algorithms. Global optimization methods can utilize the information collected from various sources and by different tools. These methods offer multi-criterion optimization, handle the existence of multiple design points and trade-offs via insight into the entire design space, can easily perform tasks in parallel, and are often effective in filtering the noise intrinsic to numerical and experimental data. However, a successful application of the global optimization method needs to address issues related to data requirements with an increase in the number of design variables, and methods for predicting the model performance. In this article, we review recent progress made in establishing suitable global optimization techniques employing neural network and polynomial-based response surface methodologies. Issues addressed include techniques for construction of the response surface, design of experiment techniques for supplying information in an economical manner, optimization procedures and multi-level techniques, and assessment of relative performance between polynomials and neural networks. Examples drawn from wing aerodynamics, turbulent diffuser flows, gas-gas injectors, and supersonic turbines are employed to help demonstrate the issues involved in an engineering design context. Both the usefulness of the existing knowledge to aid current design
Global optimization for multisensor fusion in seismic imaging
Barhen, J.; Protopopescu, V.; Reister, D. [Oak Ridge National Lab., TN (United States). Center for Engineering Systems Advanced Research
1997-06-01
The accurate imaging of subsurface structures requires the fusion of data collected from large arrays of seismic sensors. The fusion process is formulated as an optimization problem and yields an extremely complex energy surface. Due to the very large number of local minima to be explored and escaped from, the seismic imaging problem has typically been tackled with stochastic optimization methods based on Monte Carlo techniques. Unfortunately, these algorithms are very cumbersome and computationally intensive. Here, the authors present TRUST--a novel deterministic algorithm for global optimization that they apply to seismic imaging. The excellent results demonstrate that TRUST may provide the necessary breakthrough to address major scientific and technological challenges in fields as diverse as seismic modeling, process optimization, and protein engineering.
Imperialist competitive algorithm combined with chaos for global optimization
Talatahari, S.; Farahmand Azar, B.; Sheikholeslami, R.; Gandomi, A. H.
2012-03-01
A novel chaotic improved imperialist competitive algorithm (CICA) is presented for global optimization. The ICA is a new meta-heuristic optimization developed based on a socio-politically motivated strategy and contains two main steps: the movement of the colonies and the imperialistic competition. Here different chaotic maps are utilized to improve the movement step of the algorithm. Seven different chaotic maps are investigated and the Logistic and Sinusoidal maps are found as the best choices. Comparing the new algorithm with the other ICA-based methods demonstrates the superiority of the CICA for the benchmark functions.
Modified Grey Wolf Optimizer for Global Engineering Optimization
Nitin Mittal
2016-01-01
Full Text Available Nature-inspired algorithms are becoming popular among researchers due to their simplicity and flexibility. The nature-inspired metaheuristic algorithms are analysed in terms of their key features like their diversity and adaptation, exploration and exploitation, and attractions and diffusion mechanisms. The success and challenges concerning these algorithms are based on their parameter tuning and parameter control. A comparatively new algorithm motivated by the social hierarchy and hunting behavior of grey wolves is Grey Wolf Optimizer (GWO, which is a very successful algorithm for solving real mechanical and optical engineering problems. In the original GWO, half of the iterations are devoted to exploration and the other half are dedicated to exploitation, overlooking the impact of right balance between these two to guarantee an accurate approximation of global optimum. To overcome this shortcoming, a modified GWO (mGWO is proposed, which focuses on proper balance between exploration and exploitation that leads to an optimal performance of the algorithm. Simulations based on benchmark problems and WSN clustering problem demonstrate the effectiveness, efficiency, and stability of mGWO compared with the basic GWO and some well-known algorithms.
Optimization methods in structural design
Rothwell, Alan
2017-01-01
This book offers an introduction to numerical optimization methods in structural design. Employing a readily accessible and compact format, the book presents an overview of optimization methods, and equips readers to properly set up optimization problems and interpret the results. A ‘how-to-do-it’ approach is followed throughout, with less emphasis at this stage on mathematical derivations. The book features spreadsheet programs provided in Microsoft Excel, which allow readers to experience optimization ‘hands-on.’ Examples covered include truss structures, columns, beams, reinforced shell structures, stiffened panels and composite laminates. For the last three, a review of relevant analysis methods is included. Exercises, with solutions where appropriate, are also included with each chapter. The book offers a valuable resource for engineering students at the upper undergraduate and postgraduate level, as well as others in the industry and elsewhere who are new to these highly practical techniques.Whi...
Global optimization framework for solar building design
Silva, N.; Alves, N.; Pascoal-Faria, P.
2017-07-01
The generative modeling paradigm is a shift from static models to flexible models. It describes a modeling process using functions, methods and operators. The result is an algorithmic description of the construction process. Each evaluation of such an algorithm creates a model instance, which depends on its input parameters (width, height, volume, roof angle, orientation, location). These values are normally chosen according to aesthetic aspects and style. In this study, the model's parameters are automatically generated according to an objective function. A generative model can be optimized according to its parameters, in this way, the best solution for a constrained problem is determined. Besides the establishment of an overall framework design, this work consists on the identification of different building shapes and their main parameters, the creation of an algorithmic description for these main shapes and the formulation of the objective function, respecting a building's energy consumption (solar energy, heating and insulation). Additionally, the conception of an optimization pipeline, combining an energy calculation tool with a geometric scripting engine is presented. The methods developed leads to an automated and optimized 3D shape generation for the projected building (based on the desired conditions and according to specific constrains). The approach proposed will help in the construction of real buildings that account for less energy consumption and for a more sustainable world.
Global optimization over linear constraint non-convex programming problem
ZHANG Gui-Jun; WU Ti-Huan; YE Rong; YANG Hai-qing
2005-01-01
A improving Steady State Genetic Algorithm for global optimization over linear constraint non-convex programmin g problem is presented. By convex analyzing, the primal optimal problem can be converted to an equivalent problem, in which only the information of convex extremes of feasible space is included, and is more easy for GAs to solve. For avoiding invalid genetic operators, a redesigned convex crossover operator is also performed in evolving. As a integrality, the quality of two problem is proven, and a method is also given to get all extremes in linear constraint space. Simulation result show that new algorithm not only converges faster, but also can maintain an diversity population, and can get the global optimum of test problem.
Efficient global optimization of a limited parameter antenna design
O'Donnell, Teresa H.; Southall, Hugh L.; Kaanta, Bryan
2008-04-01
Efficient Global Optimization (EGO) is a competent evolutionary algorithm suited for problems with limited design parameters and expensive cost functions. Many electromagnetics problems, including some antenna designs, fall into this class, as complex electromagnetics simulations can take substantial computational effort. This makes simple evolutionary algorithms such as genetic algorithms or particle swarms very time-consuming for design optimization, as many iterations of large populations are usually required. When physical experiments are necessary to perform tradeoffs or determine effects which may not be simulated, use of these algorithms is simply not practical at all due to the large numbers of measurements required. In this paper we first present a brief introduction to the EGO algorithm. We then present the parasitic superdirective two-element array design problem and results obtained by applying EGO to obtain the optimal element separation and operating frequency to maximize the array directivity. We compare these results to both the optimal solution and results obtained by performing a similar optimization using the Nelder-Mead downhill simplex method. Our results indicate that, unlike the Nelder-Mead algorithm, the EGO algorithm did not become stuck in local minima but rather found the area of the correct global minimum. However, our implementation did not always drill down into the precise minimum and the addition of a local search technique seems to be indicated.
Global Optimization using Interval Analysis: Interval Optimization for Aerospace Applications
Van Kampen, E.
2010-01-01
Optimization is an important element in aerospace related research. It is encountered for example in trajectory optimization problems, such as: satellite formation flying, spacecraft re-entry optimization and airport approach and departure optimization; in control optimization, for example in adapti
A global optimization approach to multi-polarity sentiment analysis.
Li, Xinmiao; Li, Jing; Wu, Yukeng
2015-01-01
Following the rapid development of social media, sentiment analysis has become an important social media mining technique. The performance of automatic sentiment analysis primarily depends on feature selection and sentiment classification. While information gain (IG) and support vector machines (SVM) are two important techniques, few studies have optimized both approaches in sentiment analysis. The effectiveness of applying a global optimization approach to sentiment analysis remains unclear. We propose a global optimization-based sentiment analysis (PSOGO-Senti) approach to improve sentiment analysis with IG for feature selection and SVM as the learning engine. The PSOGO-Senti approach utilizes a particle swarm optimization algorithm to obtain a global optimal combination of feature dimensions and parameters in the SVM. We evaluate the PSOGO-Senti model on two datasets from different fields. The experimental results showed that the PSOGO-Senti model can improve binary and multi-polarity Chinese sentiment analysis. We compared the optimal feature subset selected by PSOGO-Senti with the features in the sentiment dictionary. The results of this comparison indicated that PSOGO-Senti can effectively remove redundant and noisy features and can select a domain-specific feature subset with a higher-explanatory power for a particular sentiment analysis task. The experimental results showed that the PSOGO-Senti approach is effective and robust for sentiment analysis tasks in different domains. By comparing the improvements of two-polarity, three-polarity and five-polarity sentiment analysis results, we found that the five-polarity sentiment analysis delivered the largest improvement. The improvement of the two-polarity sentiment analysis was the smallest. We conclude that the PSOGO-Senti achieves higher improvement for a more complicated sentiment analysis task. We also compared the results of PSOGO-Senti with those of the genetic algorithm (GA) and grid search method. From
F. C. Sperna Weiland
2012-03-01
Full Text Available Potential evaporation (PET is one of the main inputs of hydrological models. Yet, there is limited consensus on which PET equation is most applicable in hydrological climate impact assessments. In this study six different methods to derive global scale reference PET daily time series from Climate Forecast System Reanalysis (CFSR data are compared: Penman-Monteith, Priestley-Taylor and original and re-calibrated versions of the Hargreaves and Blaney-Criddle method. The calculated PET time series are (1 evaluated against global monthly Penman-Monteith PET time series calculated from CRU data and (2 tested on their usability for modeling of global discharge cycles.
A major finding is that for part of the investigated basins the selection of a PET method may have only a minor influence on the resulting river flow. Within the hydrological model used in this study the bias related to the PET method tends to decrease while going from PET, AET and runoff to discharge calculations. However, the performance of individual PET methods appears to be spatially variable, which stresses the necessity to select the most accurate and spatially stable PET method. The lowest root mean squared differences and the least significant deviations (95% significance level between monthly CFSR derived PET time series and CRU derived PET were obtained for a cell-specific re-calibrated Blaney-Criddle equation. However, results show that this re-calibrated form is likely to be unstable under changing climate conditions and less reliable for the calculation of daily time series. Although often recommended, the Penman-Monteith equation applied to the CFSR data did not outperform the other methods in a evaluation against PET derived with the Penman-Monteith equation from CRU data. In arid regions (e.g. Sahara, central Australia, US deserts, the equation resulted in relatively low PET values and, consequently, led to relatively high discharge values for dry basins (e
Simulated Annealing-Based Krill Herd Algorithm for Global Optimization
Gai-Ge Wang
2013-01-01
Full Text Available Recently, Gandomi and Alavi proposed a novel swarm intelligent method, called krill herd (KH, for global optimization. To enhance the performance of the KH method, in this paper, a new improved meta-heuristic simulated annealing-based krill herd (SKH method is proposed for optimization tasks. A new krill selecting (KS operator is used to refine krill behavior when updating krill’s position so as to enhance its reliability and robustness dealing with optimization problems. The introduced KS operator involves greedy strategy and accepting few not-so-good solutions with a low probability originally used in simulated annealing (SA. In addition, a kind of elitism scheme is used to save the best individuals in the population in the process of the krill updating. The merits of these improvements are verified by fourteen standard benchmarking functions and experimental results show that, in most cases, the performance of this improved meta-heuristic SKH method is superior to, or at least highly competitive with, the standard KH and other optimization methods.
Global Method in English Reading Comprehension
王小花
2012-01-01
This paper aims at introducing Global method,a new way of teaching reading comprehension in English.After analyzing advantages and disadvantages of sentence method and text method carefully,the author puts forward Global method.In this paper,the concept of Global method is reviewed;the similarities and differences between traditional method and global method are briefly examined;theoretical basis as well as guiding ideology of global method are then discussed;finally,examples are given to show how this meth...
A global optimization algorithm for protein surface alignment
Guerra Concettina
2010-09-01
Full Text Available Abstract Background A relevant problem in drug design is the comparison and recognition of protein binding sites. Binding sites recognition is generally based on geometry often combined with physico-chemical properties of the site since the conformation, size and chemical composition of the protein surface are all relevant for the interaction with a specific ligand. Several matching strategies have been designed for the recognition of protein-ligand binding sites and of protein-protein interfaces but the problem cannot be considered solved. Results In this paper we propose a new method for local structural alignment of protein surfaces based on continuous global optimization techniques. Given the three-dimensional structures of two proteins, the method finds the isometric transformation (rotation plus translation that best superimposes active regions of two structures. We draw our inspiration from the well-known Iterative Closest Point (ICP method for three-dimensional (3D shapes registration. Our main contribution is in the adoption of a controlled random search as a more efficient global optimization approach along with a new dissimilarity measure. The reported computational experience and comparison show viability of the proposed approach. Conclusions Our method performs well to detect similarity in binding sites when this in fact exists. In the future we plan to do a more comprehensive evaluation of the method by considering large datasets of non-redundant proteins and applying a clustering technique to the results of all comparisons to classify binding sites.
AN OPTIMIZED GLOBAL SYNCHRONIZATION ON SDDCN
M.SHARANYA
2010-12-01
Full Text Available The complex networks have been gaining increasing research attention because of their potential applications in many real-worldsystems from a variety of fields such as biology, social systems, linguistic networks, and technological systems. In this paper, the problem of stochastic synchronization analysis is investigated for a new array of coupled discrete time stochastic complex networks with randomly occurred nonlinearities (RONs and time delays. The discrete-time complex networks under consideration are subject to: 1 stochastic nonlinearities that occur according to the Bernoulli distributed white noise sequences; 2 stochastic disturbances that enter the coupling term, the delayed coupling term as well as the overall network; and 3 time delays that include both the discrete and distributed ones. Note that the newly introduced RONsand the multiple stochastic disturbances can better reflect the dynamical behaviors of coupled complex networks whose information transmission process is affected by a noisy environment. By constructing a novel Lyapunov-like matrix functional, the idea of delay fractioning is applied to deal with the addressed synchronization analysis problem. By employing a combination of the linear matrix inequality (LMI techniques, thefree-weighting matrix method and stochastic analysis theories, several delay-dependent sufficient conditions are obtained which ensure the asymptotic synchronization in the mean square sense for the discrete-time stochastic complex networks with time delays. The criteria derived are characterized in terms of LMIs whose solution can be solved by utilizing the standard numerical software. While these solvers are significantly faster than classical convex optimization algorithms, it should be kept in mind that the complexity of LMI computations remains higher than that of solving, say, a Riccati equation. For instance, problems with a thousand design variables typically take over an hour on today
4th International Conference on Frontiers in Global Optimization
Pardalos, Panos
2004-01-01
Global Optimization has emerged as one of the most exciting new areas of mathematical programming. Global optimization has received a wide attraction from many fields in the past few years, due to the success of new algorithms for addressing previously intractable problems from diverse areas such as computational chemistry and biology, biomedicine, structural optimization, computer sciences, operations research, economics, and engineering design and control. This book contains refereed invited papers submitted at the 4th international confer ence on Frontiers in Global Optimization held at Santorini, Greece during June 8-12, 2003. Santorini is one of the few sites of Greece, with wild beauty created by the explosion of a volcano which is in the middle of the gulf of the island. The mystic landscape with its numerous mult-extrema, was an inspiring location particularly for researchers working on global optimization. The three previous conferences on "Recent Advances in Global Opti mization", "State-of-the-...
3rd World Congress on Global Optimization in Engineering & Science
Ruan, Ning; Xing, Wenxun; WCGO-III; Advances in Global Optimization
2015-01-01
This proceedings volume addresses advances in global optimization—a multidisciplinary research field that deals with the analysis, characterization, and computation of global minima and/or maxima of nonlinear, non-convex, and nonsmooth functions in continuous or discrete forms. The volume contains selected papers from the third biannual World Congress on Global Optimization in Engineering & Science (WCGO), held in the Yellow Mountains, Anhui, China on July 8-12, 2013. The papers fall into eight topical sections: mathematical programming; combinatorial optimization; duality theory; topology optimization; variational inequalities and complementarity problems; numerical optimization; stochastic models and simulation; and complex simulation and supply chain analysis.
An approximation based global optimization strategy for structural synthesis
Sepulveda, A. E.; Schmit, L. A.
1991-01-01
A global optimization strategy for structural synthesis based on approximation concepts is presented. The methodology involves the solution of a sequence of highly accurate approximate problems using a global optimization algorithm. The global optimization algorithm implemented consists of a branch and bound strategy based on the interval evaluation of the objective function and constraint functions, combined with a local feasible directions algorithm. The approximate design optimization problems are constructed using first order approximations of selected intermediate response quantities in terms of intermediate design variables. Some numerical results for example problems are presented to illustrate the efficacy of the design procedure setforth.
Optimization of Medical Teaching Methods
Wang Fei
2015-12-01
Full Text Available In order to achieve the goal of medical education, medicine and adapt to changes in the way doctors work, with the rapid medical teaching methods of modern science and technology must be reformed. Based on the current status of teaching in medical colleges method to analyze the formation and development of medical teaching methods, characteristics, about how to achieve optimal medical teaching methods for medical education teachers and management workers comprehensive and thorough change teaching ideas and teaching concepts provide a theoretical basis.
Wolf Pack Algorithm for Unconstrained Global Optimization
Hu-Sheng Wu
2014-01-01
Full Text Available The wolf pack unites and cooperates closely to hunt for the prey in the Tibetan Plateau, which shows wonderful skills and amazing strategies. Inspired by their prey hunting behaviors and distribution mode, we abstracted three intelligent behaviors, scouting, calling, and besieging, and two intelligent rules, winner-take-all generation rule of lead wolf and stronger-survive renewing rule of wolf pack. Then we proposed a new heuristic swarm intelligent method, named wolf pack algorithm (WPA. Experiments are conducted on a suit of benchmark functions with different characteristics, unimodal/multimodal, separable/nonseparable, and the impact of several distance measurements and parameters on WPA is discussed. What is more, the compared simulation experiments with other five typical intelligent algorithms, genetic algorithm, particle swarm optimization algorithm, artificial fish swarm algorithm, artificial bee colony algorithm, and firefly algorithm, show that WPA has better convergence and robustness, especially for high-dimensional functions.
Optimal control linear quadratic methods
Anderson, Brian D O
2007-01-01
This augmented edition of a respected text teaches the reader how to use linear quadratic Gaussian methods effectively for the design of control systems. It explores linear optimal control theory from an engineering viewpoint, with step-by-step explanations that show clearly how to make practical use of the material.The three-part treatment begins with the basic theory of the linear regulator/tracker for time-invariant and time-varying systems. The Hamilton-Jacobi equation is introduced using the Principle of Optimality, and the infinite-time problem is considered. The second part outlines the
Global Optimization Problems in Optimal Design of Experiments in Regression Models
Boer, E.P.J.; Hendrix, E.M.T.
2000-01-01
In this paper we show that optimal design of experiments, a specific topic in statistics, constitutes a challenging application field for global optimization. This paper shows how various structures in optimal design of experiments problems determine the structure of corresponding challenging global
无
2006-01-01
A novel method of global optimal path planning for mobile robot was proposed based on the improved Dijkstra algorithm and ant system algorithm. This method includes three steps: the first step is adopting the MAKLINK graph theory to establish the free space model of the mobile robot, the second step is adopting the improved Dijkstra algorithm to find out a sub-optimal collision-free path, and the third step is using the ant system algorithm to adjust and optimize the location of the sub-optimal path so as to generate the global optimal path for the mobile robot. The computer simulation experiment was carried out and the results show that this method is correct and effective. The comparison of the results confirms that the proposed method is better than the hybrid genetic algorithm in the global optimal path planning.
LDRD Final Report: Global Optimization for Engineering Science Problems
HART,WILLIAM E.
1999-12-01
For a wide variety of scientific and engineering problems the desired solution corresponds to an optimal set of objective function parameters, where the objective function measures a solution's quality. The main goal of the LDRD ''Global Optimization for Engineering Science Problems'' was the development of new robust and efficient optimization algorithms that can be used to find globally optimal solutions to complex optimization problems. This SAND report summarizes the technical accomplishments of this LDRD, discusses lessons learned and describes open research issues.
A concept for global optimization of topology design problems
Stolpe, Mathias; Achtziger, Wolfgang; Kawamoto, Atsushi
2006-01-01
on two applications. The first application is the design of stiff truss structures where the bar areas are chosen from a finite set of available areas. The second considered application is simultaneous topology and geometry design of planar articulated mechanisms. For each application we outline......We present a concept for solving topology design problems to proven global optimality. We propose that the problems are modeled using the approach of simultaneous analysis and design with discrete design variables and solved with convergent branch and bound type methods. This concept is illustrated...
Optimization: NURBS and the quasi-Newton method
Coburn, Todd Dale
Optimization is important in both engineering and mathematics. The Quasi-Newton Method is widely used for optimization due to its speed and efficiency. NonUniform Rational B-Splines (NURBS) are piecewise parametric approximations to curves and surfaces. NURBS have great curve-fitting properties that can be applied to improve optimization performance. This dissertation investigated the use of NURBS in optimization, focusing primarily on the coupling of NURBS with the Quasi-Newton Method. A hybrid optimization procedure dubbed the NURBS-Quasi-Newton (NQN) Method was developed and utilized that can virtually assure that the global minimum will be found. A Method was also developed to implement Pure NURBS Optimization (PNO), which can be used to optimize non-continuous and singular functions as well as functions of point cloud data. It was concluded that NURBS offer significant benefits for optimization, both individually and coupled with Quasi-Newton Methods.
STP: A Stochastic Tunneling Algorithm for Global Optimization
Oblow, E.M.
1999-05-20
A stochastic approach to solving continuous function global optimization problems is presented. It builds on the tunneling approach to deterministic optimization presented by Barhen et al, by combining a series of local descents with stochastic searches. The method uses a rejection-based stochastic procedure to locate new local minima descent regions and a fixed Lipschitz-like constant to reject unpromising regions in the search space, thereby increasing the efficiency of the tunneling process. The algorithm is easily implemented in low-dimensional problems and scales easily to large problems. It is less effective without further heuristics in these latter cases, however. Several improvements to the basic algorithm which make use of approximate estimates of the algorithms parameters for implementation in high-dimensional problems are also discussed. Benchmark results are presented, which show that the algorithm is competitive with the best previously reported global optimization techniques. A successful application of the approach to a large-scale seismology problem of substantial computational complexity using a low-dimensional approximation scheme is also reported.
Strategies for Global Optimization of Temporal Preferences
Morris, Paul; Morris, Robert; Khatib, Lina; Ramakrishnan, Sailesh
2004-01-01
A temporal reasoning problem can often be naturally characterized as a collection of constraints with associated local preferences for times that make up the admissible values for those constraints. Globally preferred solutions to such problems emerge as a result of well-defined operations that compose and order temporal assignments. The overall objective of this work is a characterization of different notions of global preference, and to identify tractable sub-classes of temporal reasoning problems incorporating these notions. This paper extends previous results by refining the class of useful notions of global temporal preference that are associated with problems that admit of tractable solution techniques. This paper also answers the hitherto open question of whether problems that seek solutions that are globally preferred from a Utilitarian criterion for global preference can be found tractably.
Global Optimization for Transport Network Expansion and Signal Setting
Haoxiang Liu
2015-01-01
Full Text Available This paper proposes a model to address an urban transport planning problem involving combined network design and signal setting in a saturated network. Conventional transport planning models usually deal with the network design problem and signal setting problem separately. However, the fact that network capacity design and capacity allocation determined by network signal setting combine to govern the transport network performance requires the optimal transport planning to consider the two problems simultaneously. In this study, a combined network capacity expansion and signal setting model with consideration of vehicle queuing on approaching legs of intersection is developed to consider their mutual interactions so that best transport network performance can be guaranteed. We formulate the model as a bilevel program and design an approximated global optimization solution method based on mixed-integer linearization approach to solve the problem, which is inherently nnonlinear and nonconvex. Numerical experiments are conducted to demonstrate the model application and the efficiency of solution algorithm.
A global optimization approach to multi-polarity sentiment analysis.
Xinmiao Li
Full Text Available Following the rapid development of social media, sentiment analysis has become an important social media mining technique. The performance of automatic sentiment analysis primarily depends on feature selection and sentiment classification. While information gain (IG and support vector machines (SVM are two important techniques, few studies have optimized both approaches in sentiment analysis. The effectiveness of applying a global optimization approach to sentiment analysis remains unclear. We propose a global optimization-based sentiment analysis (PSOGO-Senti approach to improve sentiment analysis with IG for feature selection and SVM as the learning engine. The PSOGO-Senti approach utilizes a particle swarm optimization algorithm to obtain a global optimal combination of feature dimensions and parameters in the SVM. We evaluate the PSOGO-Senti model on two datasets from different fields. The experimental results showed that the PSOGO-Senti model can improve binary and multi-polarity Chinese sentiment analysis. We compared the optimal feature subset selected by PSOGO-Senti with the features in the sentiment dictionary. The results of this comparison indicated that PSOGO-Senti can effectively remove redundant and noisy features and can select a domain-specific feature subset with a higher-explanatory power for a particular sentiment analysis task. The experimental results showed that the PSOGO-Senti approach is effective and robust for sentiment analysis tasks in different domains. By comparing the improvements of two-polarity, three-polarity and five-polarity sentiment analysis results, we found that the five-polarity sentiment analysis delivered the largest improvement. The improvement of the two-polarity sentiment analysis was the smallest. We conclude that the PSOGO-Senti achieves higher improvement for a more complicated sentiment analysis task. We also compared the results of PSOGO-Senti with those of the genetic algorithm (GA and grid
张立平; 赖炎连
2001-01-01
A new trust region algorithm for solving convex LC1 optimization problem is presented.It is proved that the algorithm is globally convergent and the rate of convergence is superlinear under some reasonable assumptions.
QUADRATIC OPTIMIZATION METHOD AND ITS APPLICATION ON OPTIMIZING MECHANISM PARAMETER
ZHAO Yun; CHEN Jianneng; YU Yaxin; YU Gaohong; ZHU Jianping
2006-01-01
In order that the mechanism designed meets the requirements of kinematics with optimal dynamics behaviors, a quadratic optimization method is proposed based on the different characteristics of kinematic and dynamic optimization. This method includes two steps of optimization, that is, kinematic and dynamic optimization. Meanwhile, it uses the results of the kinematic optimization as the constraint equations of dynamic optimization. This method is used in the parameters optimization of transplanting mechanism with elliptic planetary gears of high-speed rice seedling transplanter with remarkable significance. The parameters spectrum, which meets to the kinematic requirements, is obtained through visualized human-computer interactions in the kinematics optimization, and the optimal parameters are obtained based on improved genetic algorithm in dynamic optimization. In the dynamic optimization, the objective function is chosen as the optimal dynamic behavior and the constraint equations are from the results of the kinematic optimization. This method is suitable for multi-objective optimization when both the kinematic and dynamic performances act as objective functions.
赵峰; 张承慧; 孙波; 魏大钧
2015-01-01
冷热电联供系统能否高效、经济、环境友好的运行，取决于系统的设备选型、设备容量及运行策略的整体优化。文中设计了一种冷热电联供系统的三级协同整体优化方法，第一级优化运用离散粒子群算法，以年一次能源利用率最高为目标，求解最优设备选型问题；第二级优化采用粒子群算法，以年CO2排放量最少为目标，求解最优设备容量问题；第三级优化采用粒子群算法，以年运行成本最低为目标，求解最优运行参数问题。以应用于医院的冷热电联供系统为例，验证该三级协同整体优化设计方法的有效性。结果表明，采用该方法设计的冷热电联供系统同分别基于“以电定热”和“以热定电”运行策略设计的2种冷热电联供系统相比，该系统更节能、更环保、更经济。%ABSTRACT:Combined cooling heating and power (CCHP) system can be efficient, economical and environmentally friendly, depending on the global optimization design of equipment selection, equipment capacity and operation strategy of CCHP system. This paper proposed a three-stage collaborative global optimization design method for CCHP system. On the first stage,discrete particle swarm optimization was applied to solve the optimal equipment type problem with maximum annual primary energy utilization rate. On the second stage, particle swarm optimization was utilized to solve the optimal equipment capacity with minimum annual carbon dioxide emissions. On the third stage, particle swarm optimization was utilized to solve the optimal operation strategy with minimum annual operation costs. A case of CCHP system used in a hospital building validated the effectiveness of this optimal method. Results show that this CCHP system designed by this optimal method is more energy saving, more environmental and more profitable than two CCHP systems separately designed by following the electric load (FEL) and
Unification of Filled Function and Tunnelling Function in Global Optimization
Wei Wang; Yong-jian Yang; Lian-sheng Zhang
2007-01-01
In this paper, two auxiliary functions for global optimization are proposed. These two auxiliary functions possess all characters of tunnelling functions and filled functions under certain general assumptions.Thus, they can be considered as the unification of filled function and tunnelling function. Moreover, the process of tunneling or filling for global optimization can be unified as the minimization of such auxiliary functions.Result of numerical experiments shows that such two auxiliary functions are effective.
Gorissen, B.L.; Ben-Tal, A.; Blanc, J.P.C.; den Hertog, D.
2012-01-01
Abstract: We propose a new way to derive tractable robust counterparts of a linear conic optimization problem by using the theory of Beck and Ben-Tal [2] on the duality between the robust (“pessimistic”) primal problem and its “optimistic” dual. First, we obtain a new convex reformulation of the
A practical globalization of one-shot optimization for optimal design of tokamak divertors
Blommaert, Maarten; Dekeyser, Wouter; Baelmans, Martine; Gauger, Nicolas R.; Reiter, Detlev
2017-01-01
In past studies, nested optimization methods were successfully applied to design of the magnetic divertor configuration in nuclear fusion reactors. In this paper, so-called one-shot optimization methods are pursued. Due to convergence issues, a globalization strategy for the one-shot solver is sought. Whereas Griewank introduced a globalization strategy using a doubly augmented Lagrangian function that includes primal and adjoint residuals, its practical usability is limited by the necessity of second order derivatives and expensive line search iterations. In this paper, a practical alternative is offered that avoids these drawbacks by using a regular augmented Lagrangian merit function that penalizes only state residuals. Additionally, robust rank-two Hessian estimation is achieved by adaptation of Powell's damped BFGS update rule. The application of the novel one-shot approach to magnetic divertor design is considered in detail. For this purpose, the approach is adapted to be complementary with practical in parts adjoint sensitivities. Using the globalization strategy, stable convergence of the one-shot approach is achieved.
A practical globalization of one-shot optimization for optimal design of tokamak divertors
Blommaert, Maarten, E-mail: maarten.blommaert@kuleuven.be [Institute of Energy and Climate Research (IEK-4), FZ Jülich GmbH, D-52425 Jülich (Germany); Dekeyser, Wouter; Baelmans, Martine [KU Leuven, Department of Mechanical Engineering, 3001 Leuven (Belgium); Gauger, Nicolas R. [TU Kaiserslautern, Chair for Scientific Computing, 67663 Kaiserslautern (Germany); Reiter, Detlev [Institute of Energy and Climate Research (IEK-4), FZ Jülich GmbH, D-52425 Jülich (Germany)
2017-01-01
In past studies, nested optimization methods were successfully applied to design of the magnetic divertor configuration in nuclear fusion reactors. In this paper, so-called one-shot optimization methods are pursued. Due to convergence issues, a globalization strategy for the one-shot solver is sought. Whereas Griewank introduced a globalization strategy using a doubly augmented Lagrangian function that includes primal and adjoint residuals, its practical usability is limited by the necessity of second order derivatives and expensive line search iterations. In this paper, a practical alternative is offered that avoids these drawbacks by using a regular augmented Lagrangian merit function that penalizes only state residuals. Additionally, robust rank-two Hessian estimation is achieved by adaptation of Powell's damped BFGS update rule. The application of the novel one-shot approach to magnetic divertor design is considered in detail. For this purpose, the approach is adapted to be complementary with practical in parts adjoint sensitivities. Using the globalization strategy, stable convergence of the one-shot approach is achieved.
Global Optimization for Advertisement Selection in Sponsored Search
崔卿; 白峰杉; 高斌; 刘铁岩
2015-01-01
Advertisement (ad) selection plays an important role in sponsored search, since it is an upstream component and will heavily influence the effectiveness of the subsequent auction mechanism. However, most existing ad selection methods regard ad selection as a relatively independent module, and only consider the literal or semantic matching between queries and keywords during the ad selection process. In this paper, we argue that this approach is not globally optimal. Our proposal is to formulate ad selection as such an optimization problem that the selected ads can work together with downstream components (e.g., the auction mechanism) to achieve the maximization of user clicks, advertiser social welfare, and search engine revenue (we call the combination of these ob jective functions as the marketplace ob jective for ease of reference). To this end, we 1) extract a bunch of features to represent each pair of query and keyword, and 2) train a machine learning model that maps the features to a binary variable indicating whether the keyword is selected or not, by maximizing the aforementioned marketplace ob jective. This formalization seems quite natural; however, it is technically diﬃcult because the marketplace objective is non-convex, discontinuous, and indifferentiable regarding the model parameter due to the ranking and second-price rules in the auction mechanism. To tackle the challenge, we propose a probabilistic approximation of the marketplace objective, which is smooth and can be effectively optimized by conventional optimization techniques. We test the ad selection model learned with our proposed method using the sponsored search log from a commercial search engine. The experimental results show that our method can significantly outperform several ad selection algorithms on all the metrics under investigation.
A New Theoretical Framework for Analyzing Stochastic Global Optimization Algorithms
无
1999-01-01
In this paper, we develop a new theoretical framework by means of the absorbing Markov process theory for analyzing some stochastic global optimization algorithms. Applying the framework to the pure random search, we prove that the pure random search converges to the global minimum in probability and its time has geometry distribution. We also analyze the pure adaptive search by this framework and turn out that the pure adaptive search converges to the global minimum in probability and its time has Poisson distribution.
A global optimality result using Geraghty type contraction
Binayak S. Choudhury
2014-07-01
Full Text Available In this paper we prove two proximity point results for finding the distance between two sets. Unlike the best approximation theorems they provide with globally optimal values. Here our approach is to reduce the problem to that of finding optimal approximate solutions of some fixed point equations. We use Geraghty type contractive inequalities in our theorem. Two illustrative examples are given.
Global Stiffness Optimization of Parallel Robots Using Kinetostatic Performance Indices
Zhang, Dan
2010-01-01
This chapter focused on the stiffness optimization of a spatial 5-DOF parallel manipulator. It is shown that the mean value and the standard deviation of the trace of the generalized compliance matrix can not only be used to characterize the kinetostatic behaviour of PKMs globally, but can be used for design optimization. This methodology paves the way for providing not only the effective guidance, but also a new approach of dimensional synthesis for the optimal design of general parallel mec...
顾纪超; 周钰亮; 李光耀; 董佐民; 干年妃
2011-01-01
Plug-in hybrid vehicle model was built to improve the energy conversion efficiency and several global optimization methods were used for the design optimization of the vehicle model in-the -loop. The electrical/mechanical energy conversion efficiency was maximized in a finite number of operating states by optimization. The optimization results were converted into a look-up table and implemented using the vehicle model. The results gained by the simulation show noticeable improvements of the energy efficiency. By comparison, HAM method strikes a good balance between search accuracy and efficiency, which gains similar results using far less computation time.%为提高混合动力车的能量转换效率,开发了可充电式混合动力车的模型,应用多种全局最优化方法对回路中的汽车模型进行了优化,在有限操作状态下,使动力/机械能量转化效率达到最高.将优化结果输入控制模型中并进行仿真运算,结果表明,采用该模型可使能量效率得到显著提高.经过比较,基于混合元模型的自适应全局最优化(HAM)方法能兼顾精度和效率,用远远少于其他方法的计算时间得到了相似精度的结果.
Adaptive scalarization methods in multiobjective optimization
Eichfelder, Gabriele
2008-01-01
This book presents adaptive solution methods for multiobjective optimization problems based on parameter dependent scalarization approaches. Readers will benefit from the new adaptive methods and ideas for solving multiobjective optimization.
An optimization method for metamorphic mechanisms based on multidisciplinary design optimization
Zhang Wuxiang
2014-12-01
Full Text Available The optimization of metamorphic mechanisms is different from that of the conventional mechanisms for its characteristics of multi-configuration. There exist complex coupled design variables and constraints in its multiple different configuration optimization models. To achieve the compatible optimized results of these coupled design variables, an optimization method for metamorphic mechanisms is developed in the paper based on the principle of multidisciplinary design optimization (MDO. Firstly, the optimization characteristics of the metamorphic mechanism are summarized distinctly by proposing the classification of design variables and constraints as well as coupling interactions among its different configuration optimization models. Further, collaborative optimization technique which is used in MDO is adopted for achieving the overall optimization performance. The whole optimization process is then proposed by constructing a two-level hierarchical scheme with global optimizer and configuration optimizer loops. The method is demonstrated by optimizing a planar five-bar metamorphic mechanism which has two configurations, and results show that it can achieve coordinated optimization results for the same parameters in different configuration optimization models.
An optimization method for metamorphic mechanisms based on multidisciplinary design optimization
Zhang Wuxiang; Wu Teng; Ding Xilun
2014-01-01
The optimization of metamorphic mechanisms is different from that of the conventional mechanisms for its characteristics of multi-configuration. There exist complex coupled design vari-ables and constraints in its multiple different configuration optimization models. To achieve the compatible optimized results of these coupled design variables, an optimization method for meta-morphic mechanisms is developed in the paper based on the principle of multidisciplinary design optimization (MDO). Firstly, the optimization characteristics of the metamorphic mechanism are summarized distinctly by proposing the classification of design variables and constraints as well as coupling interactions among its different configuration optimization models. Further, collabora-tive optimization technique which is used in MDO is adopted for achieving the overall optimization performance. The whole optimization process is then proposed by constructing a two-level hierar-chical scheme with global optimizer and configuration optimizer loops. The method is demon-strated by optimizing a planar five-bar metamorphic mechanism which has two configurations, and results show that it can achieve coordinated optimization results for the same parameters in different configuration optimization models.
Finding dominant transition pathways via global optimization of action
Lee, Juyong; Joung, InSuk; Lee, Jooyoung; Brooks, Bernard R
2016-01-01
We present a new computational approach, Action-CSA, to sample multiple reaction pathways with fixed initial and final states through global optimization of the Onsager-Machlup action using the conformational space annealing method. This approach successfully samples not only the most dominant pathway but also many other possible paths without initial guesses on reaction pathways. Pathway space is efficiently sampled by crossover operations of a set of paths and preserving the diversity of sampled pathways. The sampling ability of the approach is assessed by finding pathways for the conformational changes of alanine dipeptide and hexane. The benchmarks demonstrate that the rank order and the transition time distribution of multiple pathways identified by the new approach are in good agreement with those of long molecular dynamics simulations. We also show that the lowest action folding pathway of the mini-protein FSD-1 identified by the new approach is consistent with previous molecular dynamics simulations a...
田朝薇; 宋海洲
2011-01-01
针对非凸二次约束二次规划(QCQP)问题,将问题中二次函数的凸函数部分保留,达到所得松弛规划的可行域更加紧致的目的,得到原问题更好的下界.利用正交变换的方法得到原问题的一个凸规划松弛模型,再利用分支定界算法求其全局最优解.根据问题的最优性和可行性原则,提出一种能整体删除或缩小算法迭代过程中产生的分割子区域的区域删减策略.数值算例表明,算法及区域删减策略均是有效的.%In this paper, we obtain a sharper low bound by reserving the part of the convex function of the quadratic function for a non-convex quadratic programming with non-convex quadratic constraints (QCQP). The QCQP problem is first transformed into a convex quadratic programming with linear constraints by employing the orthogonal transformation and then the latter is solved by the branch-bound method. In order to improve the convergence of the proposed algorithm, two region-prunning techniques are given to delete or contract the sub-regions in which does not contain the optimal solutions of QCQP according to the optimality and feasibility of the problem. The numerical results show that the proposed algorithm and the prunning techniques are effective.
CONIC TRUST REGION METHOD FOR LINEARLY CONSTRAINED OPTIMIZATION
Wen-yu Sun; Jin-yun Yuan; Ya-xiang Yuan
2003-01-01
In this paper we present a trust region method of conic model for linearly constrainedoptimization problems. We discuss trust region approaches with conic model subproblems.Some equivalent variation properties and optimality conditions are given. A trust regionalgorithm based on conic model is constructed. Global convergence of the method isestablished.
Meningococcal conjugate vaccines: optimizing global impact
Terranella A
2011-09-01
Full Text Available Andrew Terranella1,2, Amanda Cohn2, Thomas Clark2 1Epidemic Intelligence Service, Division of Applied Sciences, Scientific Education and Professional Development Program Office, 2Meningitis and Vaccine Preventable Diseases Branch, National Center for Immunization and Respiratory Diseases, Centers for Disease Control and Prevention, Atlanta, GA, USA Abstract: Meningococcal conjugate vaccines have several advantages over polysaccharide vaccines, including the ability to induce greater antibody persistence, avidity, immunologic memory, and herd immunity. Since 1999, meningococcal conjugate vaccine programs have been established across the globe. Many of these vaccination programs have resulted in significant decline in meningococcal disease in several countries. Recent introduction of serogroup A conjugate vaccine in Africa offers the potential to eliminate meningococcal disease as a public health problem in Africa. However, the duration of immune response and the development of widespread herd immunity in the population remain important questions for meningococcal vaccine programs. Because of the unique epidemiology of meningococcal disease around the world, the optimal vaccination strategy for long-term disease prevention will vary by country. Keywords: conjugate vaccine, meningitis, meningococcal vaccine, meningococcal disease
A Hybrid Mutation Chemical Reaction Optimization Algorithm for Global Numerical Optimization
Ransikarn Ngambusabongsopa
2015-01-01
Full Text Available This paper proposes a hybrid metaheuristic approach that improves global numerical optimization by increasing optimal quality and accelerating convergence. This algorithm involves a recently developed process for chemical reaction optimization and two adjustment operators (turning and mutation operators. Three types of mutation operators (uniform, nonuniform, and polynomial were combined with chemical reaction optimization and turning operator to find the most appropriate framework. The best solution among these three options was selected to be a hybrid mutation chemical reaction optimization algorithm for global numerical optimization. The optimal quality, convergence speed, and statistical hypothesis testing of our algorithm are superior to those previous high performance algorithms such as RCCRO, HP-CRO2, and OCRO.
Tensor methods for large, sparse unconstrained optimization
Bouaricha, A.
1996-11-01
Tensor methods for unconstrained optimization were first introduced by Schnabel and Chow [SIAM J. Optimization, 1 (1991), pp. 293-315], who describe these methods for small to moderate size problems. This paper extends these methods to large, sparse unconstrained optimization problems. This requires an entirely new way of solving the tensor model that makes the methods suitable for solving large, sparse optimization problems efficiently. We present test results for sets of problems where the Hessian at the minimizer is nonsingular and where it is singular. These results show that tensor methods are significantly more efficient and more reliable than standard methods based on Newton`s method.
Huang, Lianjie
2013-10-29
Methods for enhancing ultrasonic reflection imaging are taught utilizing a split-step Fourier propagator in which the reconstruction is based on recursive inward continuation of ultrasonic wavefields in the frequency-space and frequency-wave number domains. The inward continuation within each extrapolation interval consists of two steps. In the first step, a phase-shift term is applied to the data in the frequency-wave number domain for propagation in a reference medium. The second step consists of applying another phase-shift term to data in the frequency-space domain to approximately compensate for ultrasonic scattering effects of heterogeneities within the tissue being imaged (e.g., breast tissue). Results from various data input to the method indicate significant improvements are provided in both image quality and resolution.
Application of surrogate-based global optimization to aerodynamic design
Pérez, Esther
2016-01-01
Aerodynamic design, like many other engineering applications, is increasingly relying on computational power. The growing need for multi-disciplinarity and high fidelity in design optimization for industrial applications requires a huge number of repeated simulations in order to find an optimal design candidate. The main drawback is that each simulation can be computationally expensive – this becomes an even bigger issue when used within parametric studies, automated search or optimization loops, which typically may require thousands of analysis evaluations. The core issue of a design-optimization problem is the search process involved. However, when facing complex problems, the high-dimensionality of the design space and the high-multi-modality of the target functions cannot be tackled with standard techniques. In recent years, global optimization using meta-models has been widely applied to design exploration in order to rapidly investigate the design space and find sub-optimal solutions. Indeed, surrogat...
Numerical methods for stellarator optimization
Morris, R.N.; Hedrick, C.L.; Hirshman, S.P.; Lyon, J.F.; Rome, J.A.
1989-01-01
A numerical optimization procedure utilizing an inverse 3-D equilibrium solver, a Mercier stability assessment, a deeply-trapped-particle loss assessment, and a nonlinear optimization package has been used to produce low aspect ratio (A = 4) stellarator designs. These designs combine good stability and improved transport with a compact configuration. 7 refs., 2 figs., 1 tab.
Differential evolution algorithm for global optimizations in nuclear physics
Qi, Chong
2017-04-01
We explore the applicability of the differential evolution algorithm in finding the global minima of three typical nuclear structure physics problems: the global deformation minimum in the nuclear potential energy surface, the optimization of mass model parameters and the lowest eigenvalue of a nuclear Hamiltonian. The algorithm works very effectively and efficiently in identifying the minima in all problems we have tested. We also show that the algorithm can be parallelized in a straightforward way.
A GREEDY GENETIC ALGORITHM FOR UNCONSTRAINED GLOBAL OPTIMIZATION
ZHAO Xinchao
2005-01-01
The greedy algorithm is a strong local searching algorithm. The genetica lgorithm is generally applied to the global optimization problems. In this paper, we combine the greedy idea and the genetic algorithm to propose the greedy genetic algorithm which incorporates the global exploring ability of the genetic algorithm and the local convergent ability of the greedy algorithm. Experimental results show that greedy genetic algorithm gives much better results than the classical genetic algorithm.
Feng Zou
2016-01-01
Full Text Available An improved teaching-learning-based optimization with combining of the social character of PSO (TLBO-PSO, which is considering the teacher’s behavior influence on the students and the mean grade of the class, is proposed in the paper to find the global solutions of function optimization problems. In this method, the teacher phase of TLBO is modified; the new position of the individual is determined by the old position, the mean position, and the best position of current generation. The method overcomes disadvantage that the evolution of the original TLBO might stop when the mean position of students equals the position of the teacher. To decrease the computation cost of the algorithm, the process of removing the duplicate individual in original TLBO is not adopted in the improved algorithm. Moreover, the probability of local convergence of the improved method is decreased by the mutation operator. The effectiveness of the proposed method is tested on some benchmark functions, and the results are competitive with respect to some other methods.
OPTIMIZATION METHODS AND SEO TOOLS
Maria Cristina ENACHE
2014-06-01
Full Text Available SEO is the activity of optimizing Web pages or whole sites in order to make them more search engine friendly, thus getting higher positions in search results. Search engine optimization (SEO involves designing, writing, and coding a website in a way that helps to improve the volume and quality of traffic to your website from people using search engines. While Search Engine Optimization is the focus of this booklet, keep in mind that it is one of many marketing techniques. A brief overview of other marketing techniques is provided at the end of this booklet.
Global Optimization Using Diffusion Perturbations with Large Noise Intensity
G. Yin; K. Yin
2006-01-01
This work develops an algorithm for global optimization. The algorithm is of gradient ascent type and uses random perturbations. In contrast to the annealing type procedures, the perturbation noise intensity is large. We demonstrate that by properly varying the noise intensity, approximations to the global maximum can be achieved. We also show that the expected time to reach the domain of attraction of the global maximum,which can be approximated by the solution of a boundary value problem, is finite. Discrete-time algorithms are proposed; recursive algorithms with occasional perturbations involving large noise intensity are developed.Numerical examples are provided for illustration.
Global Optimization Approach to Non-convex Problems
LU Zi-fang; ZHENG Hui-li
2004-01-01
A new approach to find the global optimal solution of the special non-convex problems is proposed in this paper. The non-convex objective problem is first decomposed into two convex sub-problems. Then a generalized gradient is introduced to determine a search direction and the evolution equation is built to obtain a global minimum point. By the approach, we can prevent the search process from some local minima and search a global minimum point. Two numerical examples are given to prove the approach to be effective.
Global, Multi-Objective Trajectory Optimization With Parametric Spreading
Vavrina, Matthew A.; Englander, Jacob A.; Phillips, Sean M.; Hughes, Kyle M.
2017-01-01
Mission design problems are often characterized by multiple, competing trajectory optimization objectives. Recent multi-objective trajectory optimization formulations enable generation of globally-optimal, Pareto solutions via a multi-objective genetic algorithm. A byproduct of these formulations is that clustering in design space can occur in evolving the population towards the Pareto front. This clustering can be a drawback, however, if parametric evaluations of design variables are desired. This effort addresses clustering by incorporating operators that encourage a uniform spread over specified design variables while maintaining Pareto front representation. The algorithm is demonstrated on a Neptune orbiter mission, and enhanced multidimensional visualization strategies are presented.
Reliability-based concurrent subspace optimization method
FAN Hui; LI Wei-ji
2008-01-01
To avoid the high computational cost and much modification in the process of applying traditional re-liability-based design optimization method, a new reliability-based concurrent subspace optimization approach is proposed based on the comparison and analysis of the existing muhidisciplinary optimization techniques and reli-ability assessment methods. It is shown through a canard configuration optimization for a three-surface transport that the proposed method is computationally efficient and practical with the least modification to the current de-terministic optimization process.
Global Local Structural Optimization of Transportation Aircraft Wings
Ciampa, P.D.; Nagel, B.; Van Tooren, M.J.L.
2010-01-01
The study presents a multilevel optimization methodology for the preliminary structural design of transportation aircraft wings. A global level is defined by taking into account the primary wing structural components (i.e., ribs, spars and skin) which are explicitly modeled by shell layered finite e
On the Investigation of Stochastic Global Optimization Algorithms
Baritompa, B.; Hendrix, E.M.T.
2005-01-01
This discussion paper for the SGO 2001 Workshop considers the process of investigating stochastic global optimization algorithms. It outlines a general plan for the systematic study of their behavior. It raises questions about performance criteria, characteristics of test cases and classification of
Examining the Bernstein global optimization approach to optimal power flow problem
Patil, Bhagyesh V.; Sampath, L. P. M. I.; Krishnan, Ashok; Ling, K. V.; Gooi, H. B.
2016-10-01
This work addresses a nonconvex optimal power flow problem (OPF). We introduce a `new approach' in the context of OPF problem based on the Bernstein polynomials. The applicability of the approach is studied on a real-world 3-bus power system. The numerical results obtained with this new approach for a 3-bus system reveal a satisfactory improvement in terms of optimality. The results are found to be competent with generic global optimization solvers BARON and COUENNE.
Improved Particle Swarm Optimization for Global Optimization of Unimodal and Multimodal Functions
Basu, Mousumi
2016-12-01
Particle swarm optimization (PSO) performs well for small dimensional and less complicated problems but fails to locate global minima for complex multi-minima functions. This paper proposes an improved particle swarm optimization (IPSO) which introduces Gaussian random variables in velocity term. This improves search efficiency and guarantees a high probability of obtaining the global optimum without significantly impairing the speed of convergence and the simplicity of the structure of particle swarm optimization. The algorithm is experimentally validated on 17 benchmark functions and the results demonstrate good performance of the IPSO in solving unimodal and multimodal problems. Its high performance is verified by comparing with two popular PSO variants.
Endgame implementations for the Efficient Global Optimization (EGO) algorithm
Southall, Hugh L.; O'Donnell, Teresa H.; Kaanta, Bryan
2009-05-01
Efficient Global Optimization (EGO) is a competent evolutionary algorithm which can be useful for problems with expensive cost functions [1,2,3,4,5]. The goal is to find the global minimum using as few function evaluations as possible. Our research indicates that EGO requires far fewer evaluations than genetic algorithms (GAs). However, both algorithms do not always drill down to the absolute minimum, therefore the addition of a final local search technique is indicated. In this paper, we introduce three "endgame" techniques. The techniques can improve optimization efficiency (fewer cost function evaluations) and, if required, they can provide very accurate estimates of the global minimum. We also report results using a different cost function than the one previously used [2,3].
Global Method for Electron Correlation
Piris, Mario
2017-08-01
The current work presents a new single-reference method for capturing at the same time the static and dynamic electron correlation. The starting point is a determinant wave function formed with natural orbitals obtained from a new interacting-pair model. The latter leads to a natural orbital functional (NOF) capable of recovering the complete intrapair, but only the static interpair correlation. Using the solution of the NOF, two new energy functionals are defined for both dynamic (Edyn) and static (Esta) correlation. Edyn is derived from a modified second-order Møller-Plesset perturbation theory (MP2), while Esta is obtained from the static component of the new NOF. Double counting is avoided by introducing the amount of static and dynamic correlation in each orbital as a function of its occupation. As a result, the total energy is represented by the sum E˜ HF+Edyn+Esta , where E˜ HF is the Hartree-Fock energy obtained with natural orbitals. The new procedure called NOF-MP2 scales formally as O (M5) (where M is the number of basis functions), and is applied successfully to the homolytic dissociation of a selected set of diatomic molecules, paradigmatic cases of near-degeneracy effects. The size consistency has been numerically demonstrated for singlets. The values obtained are in good agreement with the experimental data.
An evolutionary algorithm for global optimization based on self-organizing maps
Barmada, Sami; Raugi, Marco; Tucci, Mauro
2016-10-01
In this article, a new population-based algorithm for real-parameter global optimization is presented, which is denoted as self-organizing centroids optimization (SOC-opt). The proposed method uses a stochastic approach which is based on the sequential learning paradigm for self-organizing maps (SOMs). A modified version of the SOM is proposed where each cell contains an individual, which performs a search for a locally optimal solution and it is affected by the search for a global optimum. The movement of the individuals in the search space is based on a discrete-time dynamic filter, and various choices of this filter are possible to obtain different dynamics of the centroids. In this way, a general framework is defined where well-known algorithms represent a particular case. The proposed algorithm is validated through a set of problems, which include non-separable problems, and compared with state-of-the-art algorithms for global optimization.
Fast globally optimal segmentation of 3D prostate MRI with axial symmetry prior.
Qiu, Wu; Yuan, Jing; Ukwatta, Eranga; Sun, Yue; Rajchl, Martin; Fenster, Aaron
2013-01-01
We propose a novel global optimization approach to segmenting a given 3D prostate T2w magnetic resonance (MR) image, which enforces the inherent axial symmetry of the prostate shape and simultaneously performs a sequence of 2D axial slice-wise segmentations with a global 3D coherence prior. We show that the proposed challenging combinatorial optimization problem can be solved globally and exactly by means of convex relaxation. With this regard, we introduce a novel coupled continuous max-flow model, which is dual to the studied convex relaxed optimization formulation and leads to an efficient multiplier augmented algorithm based on the modern convex optimization theory. Moreover, the new continuous max-flow based algorithm was implemented on GPUs to achieve a substantial improvement in computation. Experimental results using public and in-house datasets demonstrate great advantages of the proposed method in terms of both accuracy and efficiency.
Zhong, Shangping; Chen, Tianshun; He, Fengying; Niu, Yuzhen
2014-09-01
For a practical pattern classification task solved by kernel methods, the computing time is mainly spent on kernel learning (or training). However, the current kernel learning approaches are based on local optimization techniques, and hard to have good time performances, especially for large datasets. Thus the existing algorithms cannot be easily extended to large-scale tasks. In this paper, we present a fast Gaussian kernel learning method by solving a specially structured global optimization (SSGO) problem. We optimize the Gaussian kernel function by using the formulated kernel target alignment criterion, which is a difference of increasing (d.i.) functions. Through using a power-transformation based convexification method, the objective criterion can be represented as a difference of convex (d.c.) functions with a fixed power-transformation parameter. And the objective programming problem can then be converted to a SSGO problem: globally minimizing a concave function over a convex set. The SSGO problem is classical and has good solvability. Thus, to find the global optimal solution efficiently, we can adopt the improved Hoffman's outer approximation method, which need not repeat the searching procedure with different starting points to locate the best local minimum. Also, the proposed method can be proven to converge to the global solution for any classification task. We evaluate the proposed method on twenty benchmark datasets, and compare it with four other Gaussian kernel learning methods. Experimental results show that the proposed method stably achieves both good time-efficiency performance and good classification performance.
GLOBAL OPTIMIZATION OF PUMP CONFIGURATION PROBLEM USING EXTENDED CROWDING GENETIC ALGORITHM
Zhang Guijun; Wu Tihua; Ye Rong
2004-01-01
An extended crowding genetic algorithm (ECGA) is introduced for solving optimal pump configuration problem,which was presented by T.Westerlund in 1994.This problem has been found to be non-convex,and the objective function contained several local optima and global optimality could not be ensured by all the traditional MINLP optimization method.The concepts of species conserving and composite encoding are introduced to crowding genetic algorithm (CGA) for maintain the diversity of population more effectively and coping with the continuous and/or discrete variables in MINLP problem.The solution of three-levels pump configuration got from DICOPT++ software (OA algorithm) is also given.By comparing with the solutions obtained from DICOPT++,ECP method,and MIN-MIN method,the ECGA algorithm proved to be very effective in finding the global optimal solution of multi-levels pump configuration via using the problem-specific information.
Gene regulatory network modeling via global optimization of high-order dynamic Bayesian network
Xuan Nguyen
2012-06-01
Full Text Available Abstract Background Dynamic Bayesian network (DBN is among the mainstream approaches for modeling various biological networks, including the gene regulatory network (GRN. Most current methods for learning DBN employ either local search such as hill-climbing, or a meta stochastic global optimization framework such as genetic algorithm or simulated annealing, which are only able to locate sub-optimal solutions. Further, current DBN applications have essentially been limited to small sized networks. Results To overcome the above difficulties, we introduce here a deterministic global optimization based DBN approach for reverse engineering genetic networks from time course gene expression data. For such DBN models that consist only of inter time slice arcs, we show that there exists a polynomial time algorithm for learning the globally optimal network structure. The proposed approach, named GlobalMIT+, employs the recently proposed information theoretic scoring metric named mutual information test (MIT. GlobalMIT+ is able to learn high-order time delayed genetic interactions, which are common to most biological systems. Evaluation of the approach using both synthetic and real data sets, including a 733 cyanobacterial gene expression data set, shows significantly improved performance over other techniques. Conclusions Our studies demonstrate that deterministic global optimization approaches can infer large scale genetic networks.
Practical inventory routing: A problem definition and an optimization method
Geiger, Martin Josef
2011-01-01
The global objective of this work is to provide practical optimization methods to companies involved in inventory routing problems, taking into account this new type of data. Also, companies are sometimes not able to deal with changing plans every period and would like to adopt regular structures for serving customers.
Long-term stability of the Tevatron by verified global optimization
Berz, Martin; Makino, Kyoko; Kim, Youn-Kyung
2006-03-01
The tools used to compute high-order transfer maps based on differential algebraic (DA) methods have recently been augmented by methods that also allow a rigorous computation of an interval bound for the remainder. In this paper we will show how such methods can also be used to determine rigorous bounds for the global extrema of functions in an efficient way. The method is used for the bounding of normal form defect functions, which allows rigorous stability estimates for repetitive particle accelerator. However, the method is also applicable to general lattice design problems and can enhance the commonly used local optimization with heuristic successive starting point modification. The global optimization approach studied rests on the ability of the method to suppress the so-called dependency problem common to validated computations, as well as effective polynomial bounding techniques. We review the linear dominated bounder (LDB) and the quadratic fast bounder (QFB) and study their performance for various example problems in global optimization. We observe that the method is superior to other global optimization approaches and can prove stability times similar to what is desired, without any need for expensive long-term tracking and in a fully rigorous way.
Neoliberal Optimism: Applying Market Techniques to Global Health.
Mei, Yuyang
2017-01-01
Global health and neoliberalism are becoming increasingly intertwined as organizations utilize markets and profit motives to solve the traditional problems of poverty and population health. I use field work conducted over 14 months in a global health technology company to explore how the promise of neoliberalism re-envisions humanitarian efforts. In this company's vaccine refrigerator project, staff members expect their investors and their market to allow them to achieve scale and develop accountability to their users in developing countries. However, the translation of neoliberal techniques to the global health sphere falls short of the ideal, as profits are meager and purchasing power remains with donor organizations. The continued optimism in market principles amidst such a non-ideal market reveals the tenacious ideological commitment to neoliberalism in these global health projects.
Hybrid intelligent optimization methods for engineering problems
Pehlivanoglu, Yasin Volkan
quantification studies, we improved new mutation strategies and operators to provide beneficial diversity within the population. We called this new approach as multi-frequency vibrational GA or PSO. They were applied to different aeronautical engineering problems in order to study the efficiency of these new approaches. These implementations were: applications to selected benchmark test functions, inverse design of two-dimensional (2D) airfoil in subsonic flow, optimization of 2D airfoil in transonic flow, path planning problems of autonomous unmanned aerial vehicle (UAV) over a 3D terrain environment, 3D radar cross section minimization problem for a 3D air vehicle, and active flow control over a 2D airfoil. As demonstrated by these test cases, we observed that new algorithms outperform the current popular algorithms. The principal role of this multi-frequency approach was to determine which individuals or particles should be mutated, when they should be mutated, and which ones should be merged into the population. The new mutation operators, when combined with a mutation strategy and an artificial intelligent method, such as, neural networks or fuzzy logic process, they provided local and global diversities during the reproduction phases of the generations. Additionally, the new approach also introduced random and controlled diversity. Due to still being population-based techniques, these methods were as robust as the plain GA or PSO algorithms. Based on the results obtained, it was concluded that the variants of the present multi-frequency vibrational GA and PSO were efficient algorithms, since they successfully avoided all local optima within relatively short optimization cycles.
Automated parameterization of intermolecular pair potentials using global optimization techniques
Krämer, Andreas; Hülsmann, Marco; Köddermann, Thorsten; Reith, Dirk
2014-12-01
In this work, different global optimization techniques are assessed for the automated development of molecular force fields, as used in molecular dynamics and Monte Carlo simulations. The quest of finding suitable force field parameters is treated as a mathematical minimization problem. Intricate problem characteristics such as extremely costly and even abortive simulations, noisy simulation results, and especially multiple local minima naturally lead to the use of sophisticated global optimization algorithms. Five diverse algorithms (pure random search, recursive random search, CMA-ES, differential evolution, and taboo search) are compared to our own tailor-made solution named CoSMoS. CoSMoS is an automated workflow. It models the parameters' influence on the simulation observables to detect a globally optimal set of parameters. It is shown how and why this approach is superior to other algorithms. Applied to suitable test functions and simulations for phosgene, CoSMoS effectively reduces the number of required simulations and real time for the optimization task.
Automatic Construction and Global Optimization of a Multisentiment Lexicon
Xiaoping Yang
2016-01-01
Full Text Available Manual annotation of sentiment lexicons costs too much labor and time, and it is also difficult to get accurate quantification of emotional intensity. Besides, the excessive emphasis on one specific field has greatly limited the applicability of domain sentiment lexicons (Wang et al., 2010. This paper implements statistical training for large-scale Chinese corpus through neural network language model and proposes an automatic method of constructing a multidimensional sentiment lexicon based on constraints of coordinate offset. In order to distinguish the sentiment polarities of those words which may express either positive or negative meanings in different contexts, we further present a sentiment disambiguation algorithm to increase the flexibility of our lexicon. Lastly, we present a global optimization framework that provides a unified way to combine several human-annotated resources for learning our 10-dimensional sentiment lexicon SentiRuc. Experiments show the superior performance of SentiRuc lexicon in category labeling test, intensity labeling test, and sentiment classification tasks. It is worth mentioning that, in intensity label test, SentiRuc outperforms the second place by 21 percent.
Overview of multi-objective optimization methods
雷秀娟; 史忠科
2004-01-01
To assist readers to have a comprehensive understanding, the classical and intelligent methods roundly based on precursory research achievements are summarized in this paper. First, basic conception and description about multi-objective (MO) optimization are introduced. Then some definitions and related terminologies are given. Furthermore several MO optimization methods including classical and current intelligent methods are discussed one by one succinctly. Finally evaluations on advantages and disadvantages about these methods are made at the end of the paper.
Global Optimization strategies for two-mode clustering
J.M. van Rosmalen (Joost); P.J.F. Groenen (Patrick); J. Trejos (Javier); W. Castilli
2005-01-01
textabstractTwo-mode clustering is a relatively new form of clustering that clusters both rows and columns of a data matrix. To do so, a criterion similar to k-means is optimized. However, it is still unclear which optimization method should be used to perform two-mode clustering, as various meth
Development and applications of Krotov method of global control improvement
Rasina, Irina V.; Trushkova, Ekaterina A.; Baturina, Olga V.; Bulatov, Alexander V.; Guseva, Irina S.
2016-06-01
This is a survey of works on main properties, application and development of the Krotov method of global control improvement very popular among researchers of modern problems in quantum physics and quantum chemistry, applying actively optimal control methods. The survey includes a brief description of the method in comparison with well known gradient method demonstrating such its serious advantage as absence of tuning parameters; investigations aimed to make its special version for the quantum system well defined and more effective; and generalization for wide classes of control systems, including the systems of heterogeneous structure.
Experimental validation of structural optimization methods
Adelman, Howard M.
1992-01-01
The topic of validating structural optimization methods by use of experimental results is addressed. The need for validating the methods as a way of effecting a greater and an accelerated acceptance of formal optimization methods by practicing engineering designers is described. The range of validation strategies is defined which includes comparison of optimization results with more traditional design approaches, establishing the accuracy of analyses used, and finally experimental validation of the optimization results. Examples of the use of experimental results to validate optimization techniques are described. The examples include experimental validation of the following: optimum design of a trussed beam; combined control-structure design of a cable-supported beam simulating an actively controlled space structure; minimum weight design of a beam with frequency constraints; minimization of the vibration response of helicopter rotor blade; minimum weight design of a turbine blade disk; aeroelastic optimization of an aircraft vertical fin; airfoil shape optimization for drag minimization; optimization of the shape of a hole in a plate for stress minimization; optimization to minimize beam dynamic response; and structural optimization of a low vibration helicopter rotor.
A Globally Convergent Parallel SSLE Algorithm for Inequality Constrained Optimization
Zhijun Luo
2014-01-01
Full Text Available A new parallel variable distribution algorithm based on interior point SSLE algorithm is proposed for solving inequality constrained optimization problems under the condition that the constraints are block-separable by the technology of sequential system of linear equation. Each iteration of this algorithm only needs to solve three systems of linear equations with the same coefficient matrix to obtain the descent direction. Furthermore, under certain conditions, the global convergence is achieved.
Towards a Global Optimization Scheme for Multi-Band Speech Recognition
Cerisara, Christophe; Haton, Jean-Paul; Fohr, Dominique
1999-01-01
Colloque avec actes et comité de lecture.; n this paper, we deal with a new method to globally optimize a Multi-Band Speech Recognition (MBSR) system. We have tested our algorithm with the TIMIT database and obtained a significant improvement in the accuracy over a basic HMM system for clean speech. The goal of this work is not to prove the effectiveness of MBSR, what has yet been done, but to improve the training scheme by introducing a global optimization procedure. A consequence of this me...
Global Optimization for Sum of Linear Ratios Problem Using New Pruning Technique
2009-02-01
Full Text Available A global optimization algorithm is proposed for solving sum of general linear ratios problem (P using new pruning technique. Firstly, an equivalent problem (P1 of the (P is derived by exploiting the characteristics of linear constraints. Then, by utilizing linearization method the relaxation linear programming (RLP of the (P1 can be constructed and the proposed algorithm is convergent to the global minimum of the (P through the successive refinement of the linear relaxation of feasible region and solutions of a series of (RLP. Then, a new pruning technique is proposed, this technique offers a possibility to cut away a large part of the current investigated feasible region by the optimization algorithm, which can be utilized as an accelerating device for global optimization of problem (P. Finally, the numerical experiments are given to illustrate the feasibility of the proposed algorithm.
A Guiding Evolutionary Algorithm with Greedy Strategy for Global Optimization Problems
Cao, Leilei; Xu, Lihong; Goodman, Erik D.
2016-01-01
A Guiding Evolutionary Algorithm (GEA) with greedy strategy for global optimization problems is proposed. Inspired by Particle Swarm Optimization, the Genetic Algorithm, and the Bat Algorithm, the GEA was designed to retain some advantages of each method while avoiding some disadvantages. In contrast to the usual Genetic Algorithm, each individual in GEA is crossed with the current global best one instead of a randomly selected individual. The current best individual served as a guide to attract offspring to its region of genotype space. Mutation was added to offspring according to a dynamic mutation probability. To increase the capability of exploitation, a local search mechanism was applied to new individuals according to a dynamic probability of local search. Experimental results show that GEA outperformed the other three typical global optimization algorithms with which it was compared. PMID:27293421
A Guiding Evolutionary Algorithm with Greedy Strategy for Global Optimization Problems
Leilei Cao
2016-01-01
Full Text Available A Guiding Evolutionary Algorithm (GEA with greedy strategy for global optimization problems is proposed. Inspired by Particle Swarm Optimization, the Genetic Algorithm, and the Bat Algorithm, the GEA was designed to retain some advantages of each method while avoiding some disadvantages. In contrast to the usual Genetic Algorithm, each individual in GEA is crossed with the current global best one instead of a randomly selected individual. The current best individual served as a guide to attract offspring to its region of genotype space. Mutation was added to offspring according to a dynamic mutation probability. To increase the capability of exploitation, a local search mechanism was applied to new individuals according to a dynamic probability of local search. Experimental results show that GEA outperformed the other three typical global optimization algorithms with which it was compared.
A Guiding Evolutionary Algorithm with Greedy Strategy for Global Optimization Problems.
Cao, Leilei; Xu, Lihong; Goodman, Erik D
2016-01-01
A Guiding Evolutionary Algorithm (GEA) with greedy strategy for global optimization problems is proposed. Inspired by Particle Swarm Optimization, the Genetic Algorithm, and the Bat Algorithm, the GEA was designed to retain some advantages of each method while avoiding some disadvantages. In contrast to the usual Genetic Algorithm, each individual in GEA is crossed with the current global best one instead of a randomly selected individual. The current best individual served as a guide to attract offspring to its region of genotype space. Mutation was added to offspring according to a dynamic mutation probability. To increase the capability of exploitation, a local search mechanism was applied to new individuals according to a dynamic probability of local search. Experimental results show that GEA outperformed the other three typical global optimization algorithms with which it was compared.
DESIGN OPTIMIZATION METHOD USED IN MECHANICAL ENGINEERING
SCURTU Iacob Liviu
2016-11-01
Full Text Available This paper presents an optimization study in mechanical engineering. First part of the research describe the structural optimization method used, followed by the presentation of several optimization studies conducted in recent years. The second part of the paper presents the CAD modelling of an agricultural plough component. The beam of the plough is analysed using finite element method. The plough component is meshed in solid elements, and the load case which mimics the working conditions of agricultural equipment of this are created. The model is prepared to find the optimal structural design, after the FEA study of the model is done. The mass reduction of part is the criterion applied for this optimization study. The end of this research presents the final results and the model optimized shape.
Evtushenko Yury
2016-01-01
Full Text Available Paper deals with the non-uniform covering method that is aimed at deterministic global optimization. This method finds a feasible solution to the optimization problem numerically and proves that the obtained solution differs from the optimal by no more than a given accuracy. Numerical proof consists of constructing a set of covering sets - the coverage. The number of elements in the coverage can be very large and even exceed the total amount of available computer resources. Basic method of coverage construction is the comparison of upper and lower bounds on the value of the objective function. In this work we propose to use necessary optimality conditions of first and second order for reducing the search for boxconstrained problems. We provide the algorithm description and prove its correctness. The efficiency of the proposed approach is studied on test problems.
邹林君; 吴义忠; 毛虎平
2011-01-01
为了解决高效全局优化算法(EGO)中迭代次数增多时构建Kriging模型速度过慢,以及对于某些响应值变化范围较大的目标函数出现过早收敛的问题,提出了增量Kriging方法和基于此方法的改进EGO算法.增量方法利用已经得到的关联矩阵的逆矩阵和新增的数据点忽略关联系数优化的过程,直接进行一系列矩阵运算,得到新关联矩阵的逆矩阵,进而得到更新后的预测模型.改进的EGO算法使用上述的增量方法和更加严谨的停止规则,包括改善期望、自变量和响应值的停止准则.最后使用标准函数分别对增量方法和EGO算法进行测试,结果表明,增量方法可在损失少量精度的情况下大大缩短模型更新的时间,改进的EGO算法具有更高的效率和稳定性.%In efficient global optimization (EGO) algorithm, the time of rebuilding the Kriging model increases rapidly with the increasing of samples' size, and premature convergence may exist when the range of the objective function is too large. To conquer these problems, an incremental Kriging method (IKM) and the improved EGO algorithm are proposed. The inversion of the correlation matrix and the new data points are manipulated to get the coefficients of the Kriging model in IKM, while coefficients of correlation function are optimized and the inversion of new correlation matrix is directly calculated.Stopping criteria on expected improvement, response value and argument are used in the improved EGO algorithm. The experimental results demonstrate that IKM greatly reduces the time of modelling with little loss of accuracy and the improved EGO method has higher efficiency and better stability.
Sarkar, Kanchan; Bhattacharyya, S P
2013-08-21
We propose and implement a simple adaptive heuristic to optimize the geometries of clusters of point charges or ions with the ability to find the global minimum energy configurations. The approach uses random mutations of a single string encoding the geometry and accepts moves that decrease the energy. Mutation probability and mutation intensity are allowed to evolve adaptively on the basis of continuous evaluation of past explorations. The resulting algorithm has been called Completely Adaptive Random Mutation Hill Climbing method. We have implemented this method to search through the complex potential energy landscapes of parabolically confined 3D classical Coulomb clusters of hundreds or thousands of charges--usually found in high frequency discharge plasmas. The energy per particle (EN∕N) and its first and second differences, structural features, distribution of the oscillation frequencies of normal modes, etc., are analyzed as functions of confinement strength and the number of charges in the system. Certain magic numbers are identified. In order to test the feasibility of the algorithm in cluster geometry optimization on more complex energy landscapes, we have applied the algorithm for optimizing the geometries of MgO clusters, described by Coulomb-Born-Mayer potential and finding global minimum of some Lennard-Jones clusters. The convergence behavior of the algorithm compares favorably with those of other existing global optimizers.
Dong, Huachao; Song, Baowei; Wang, Peng; Huang, Shuai [Northwestern Polytechnical University, Xi' an (China)
2015-05-15
In this paper, a novel kriging-based algorithm for global optimization of computationally expensive black-box functions is presented. This algorithm utilizes a multi-start approach to find all of the local optimal values of the surrogate model and performs searches within the neighboring area around these local optimal positions. Compared with traditional surrogate-based global optimization method, this algorithm provides another kind of balance between exploitation and exploration on kriging-based model. In addition, a new search strategy is proposed and coupled into this optimization process. The local search strategy employs a kind of improved 'Minimizing the predictor' method, which dynamically adjusts search direction and radius until finds the optimal value. Furthermore, the global search strategy utilizes the advantage of kriging-based model in predicting unexplored regions to guarantee the reliability of the algorithm. Finally, experiments on 13 test functions with six algorithms are set up and the results show that the proposed algorithm is very promising.
An adaptive metamodel-based global optimization algorithm for black-box type problems
Jie, Haoxiang; Wu, Yizhong; Ding, Jianwan
2015-11-01
In this article, an adaptive metamodel-based global optimization (AMGO) algorithm is presented to solve unconstrained black-box problems. In the AMGO algorithm, a type of hybrid model composed of kriging and augmented radial basis function (RBF) is used as the surrogate model. The weight factors of hybrid model are adaptively selected in the optimization process. To balance the local and global search, a sub-optimization problem is constructed during each iteration to determine the new iterative points. As numerical experiments, six standard two-dimensional test functions are selected to show the distributions of iterative points. The AMGO algorithm is also tested on seven well-known benchmark optimization problems and contrasted with three representative metamodel-based optimization methods: efficient global optimization (EGO), GutmannRBF and hybrid and adaptive metamodel (HAM). The test results demonstrate the efficiency and robustness of the proposed method. The AMGO algorithm is finally applied to the structural design of the import and export chamber of a cycloid gear pump, achieving satisfactory results.
孙清滢
2003-01-01
Conjugate gradient optimization algorithms depend on the search directions with differentchoices for the parameters in the search directions. In this note, by combining the nice numerical per-formance of PR and HS methods with the global convergence property of the class of conjugate gradientmethods presented by HU and STOREY(1991), a class of new restarting conjugate gradient methodsis presented. Global convergences of the new method with two kinds of common line searches, areproved. Firstly, it is shown that, using reverse modulus of continuity function and forcing function,the new method for solving unconstrained optimization can work for a continously differentiable functionwith Curry-Altman's step size rule and a bounded level set. Secondly, by using comparing technique,some general convergence propecties of the new method with other kind of step size rule are established.Numerical experiments show that the new method is efficient by comparing with FR conjugate gradientmethod.
GFS algorithm based on batch Monte Carlo trials for solving global optimization problems
Popkov, Yuri S.; Darkhovskiy, Boris S.; Popkov, Alexey Y.
2016-10-01
A new method for global optimization of Hölder goal functions under compact sets given by inequalities is proposed. All functions are defined only algorithmically. The method is based on performing simple Monte Carlo trials and constructing the sequences of records and the sequence of their decrements. An estimating procedure of Hölder constants is proposed. Probability estimation of exact global minimum neighborhood using Hölder constants estimates is presented. Results on some analytical and algorithmic test problems illustrate the method's performance.
Multidisciplinary Optimization Methods for Aircraft Preliminary Design
Kroo, Ilan; Altus, Steve; Braun, Robert; Gage, Peter; Sobieski, Ian
1994-01-01
This paper describes a research program aimed at improved methods for multidisciplinary design and optimization of large-scale aeronautical systems. The research involves new approaches to system decomposition, interdisciplinary communication, and methods of exploiting coarse-grained parallelism for analysis and optimization. A new architecture, that involves a tight coupling between optimization and analysis, is intended to improve efficiency while simplifying the structure of multidisciplinary, computation-intensive design problems involving many analysis disciplines and perhaps hundreds of design variables. Work in two areas is described here: system decomposition using compatibility constraints to simplify the analysis structure and take advantage of coarse-grained parallelism; and collaborative optimization, a decomposition of the optimization process to permit parallel design and to simplify interdisciplinary communication requirements.
A Hybrid PSO-BFGS Strategy for Global Optimization of Multimodal Functions.
Shutao Li; Mingkui Tan; Tsang, I W; Kwok, James Tin-Yau
2011-08-01
Particle swarm optimizer (PSO) is a powerful optimization algorithm that has been applied to a variety of problems. It can, however, suffer from premature convergence and slow convergence rate. Motivated by these two problems, a hybrid global optimization strategy combining PSOs with a modified Broyden-Fletcher-Goldfarb-Shanno (BFGS) method is presented in this paper. The modified BFGS method is integrated into the context of the PSOs to improve the particles' local search ability. In addition, in conjunction with the territory technique, a reposition technique to maintain the diversity of particles is proposed to improve the global search ability of PSOs. One advantage of the hybrid strategy is that it can effectively find multiple local solutions or global solutions to the multimodal functions in a box-constrained space. Based on these local solutions, a reconstruction technique can be adopted to further estimate better solutions. The proposed method is compared with several recently developed optimization algorithms on a set of 20 standard benchmark problems. Experimental results demonstrate that the proposed approach can obtain high-quality solutions on multimodal function optimization problems.
ZHANG Juliang; ZHANG Xiangsun
2001-01-01
In this paper, we use the smoothing penalty function proposed in [1] as the merit function of SQP method for nonlinear optimization with inequality constraints. The global convergence of the method is obtained.
Review: Optimization methods for groundwater modeling and management
Yeh, William W.-G.
2015-09-01
Optimization methods have been used in groundwater modeling as well as for the planning and management of groundwater systems. This paper reviews and evaluates the various optimization methods that have been used for solving the inverse problem of parameter identification (estimation), experimental design, and groundwater planning and management. Various model selection criteria are discussed, as well as criteria used for model discrimination. The inverse problem of parameter identification concerns the optimal determination of model parameters using water-level observations. In general, the optimal experimental design seeks to find sampling strategies for the purpose of estimating the unknown model parameters. A typical objective of optimal conjunctive-use planning of surface water and groundwater is to minimize the operational costs of meeting water demand. The optimization methods include mathematical programming techniques such as linear programming, quadratic programming, dynamic programming, stochastic programming, nonlinear programming, and the global search algorithms such as genetic algorithms, simulated annealing, and tabu search. Emphasis is placed on groundwater flow problems as opposed to contaminant transport problems. A typical two-dimensional groundwater flow problem is used to explain the basic formulations and algorithms that have been used to solve the formulated optimization problems.
Ruisheng Sun
2016-01-01
Full Text Available This paper presents a new parametric optimization approach based on a modified particle swarm optimization (PSO to design a class of impulsive-correction projectiles with discrete, flexible-time interval, and finite-energy control. In terms of optimal control theory, the task is described as the formulation of minimum working number of impulses and minimum control error, which involves reference model linearization, boundary conditions, and discontinuous objective function. These result in difficulties in finding the global optimum solution by directly utilizing any other optimization approaches, for example, Hp-adaptive pseudospectral method. Consequently, PSO mechanism is employed for optimal setting of impulsive control by considering the time intervals between two neighboring lateral impulses as design variables, which makes the briefness of the optimization process. A modification on basic PSO algorithm is developed to improve the convergence speed of this optimization through linearly decreasing the inertial weight. In addition, a suboptimal control and guidance law based on PSO technique are put forward for the real-time consideration of the online design in practice. Finally, a simulation case coupled with a nonlinear flight dynamic model is applied to validate the modified PSO control algorithm. The results of comparative study illustrate that the proposed optimal control algorithm has a good performance in obtaining the optimal control efficiently and accurately and provides a reference approach to handling such impulsive-correction problem.
Designing Complex Interplanetary Trajectories for the Global Trajectory Optimization Competitions
Izzo, Dario; Simões, Luís F; Märtens, Marcus
2015-01-01
The design of interplanetary trajectories often involves a preliminary search for options that are later refined into one final selected trajectory. It is this broad search that, often being intractable, inspires the international event called Global Trajectory Optimization Competition. In the first part of this chapter, we introduce some fundamental problems of space flight mechanics, building blocks of any attempt to participate successfully in these competitions and we describe the use of the open source software PyKEP to assemble them into a final global solution strategy. In the second part, we formulate an instance of a multiple asteroid rendezvous problem, related to the 7th edition of the competition, and we show step by step how to build a possible solution strategy. We introduce two new techniques useful in the design of this particular mission type: the use of an asteroid phasing value and its surrogates and the efficient computation of asteroid clusters. We show how basic building blocks, sided to...
Chaotic Charged System Search with a Feasible-Based Method for Constraint Optimization Problems
B. Nouhi
2013-01-01
Full Text Available Recently developed chaotic charged system search was combined to feasible-based method to solve constraint engineering optimization problems. Using chaotic maps into the CSS increases the global search mobility for a better global optimization. In the present method, an improved feasible-based method is utilized to handle the constraints. Some constraint design examples are tested using the new chaotic-based methods, and the results are compared to recognize the most efficient and powerful algorithm.
Design and global optimization of high-efficiency thermophotovoltaic systems.
Bermel, Peter; Ghebrebrhan, Michael; Chan, Walker; Yeng, Yi Xiang; Araghchini, Mohammad; Hamam, Rafif; Marton, Christopher H; Jensen, Klavs F; Soljačić, Marin; Joannopoulos, John D; Johnson, Steven G; Celanovic, Ivan
2010-09-13
Despite their great promise, small experimental thermophotovoltaic (TPV) systems at 1000 K generally exhibit extremely low power conversion efficiencies (approximately 1%), due to heat losses such as thermal emission of undesirable mid-wavelength infrared radiation. Photonic crystals (PhC) have the potential to strongly suppress such losses. However, PhC-based designs present a set of non-convex optimization problems requiring efficient objective function evaluation and global optimization algorithms. Both are applied to two example systems: improved micro-TPV generators and solar thermal TPV systems. Micro-TPV reactors experience up to a 27-fold increase in their efficiency and power output; solar thermal TPV systems see an even greater 45-fold increase in their efficiency (exceeding the Shockley-Quiesser limit for a single-junction photovoltaic cell).
An Adaptive Unified Differential Evolution Algorithm for Global Optimization
Qiang, Ji; Mitchell, Chad
2014-11-03
In this paper, we propose a new adaptive unified differential evolution algorithm for single-objective global optimization. Instead of the multiple mutation strate- gies proposed in conventional differential evolution algorithms, this algorithm employs a single equation unifying multiple strategies into one expression. It has the virtue of mathematical simplicity and also provides users the flexibility for broader exploration of the space of mutation operators. By making all control parameters in the proposed algorithm self-adaptively evolve during the process of optimization, it frees the application users from the burden of choosing appro- priate control parameters and also improves the performance of the algorithm. In numerical tests using thirteen basic unimodal and multimodal functions, the proposed adaptive unified algorithm shows promising performance in compari- son to several conventional differential evolution algorithms.
A Unified Differential Evolution Algorithm for Global Optimization
Qiang, Ji; Mitchell, Chad
2014-06-24
Abstract?In this paper, we propose a new unified differential evolution (uDE) algorithm for single objective global optimization. Instead of selecting among multiple mutation strategies as in the conventional differential evolution algorithm, this algorithm employs a single equation as the mutation strategy. It has the virtue of mathematical simplicity and also provides users the flexbility for broader exploration of different mutation strategies. Numerical tests using twelve basic unimodal and multimodal functions show promising performance of the proposed algorithm in comparison to convential differential evolution algorithms.
Yang, Dixiong; Liu, Zhenjun; Zhou, Jilei
2014-04-01
Chaos optimization algorithms (COAs) usually utilize the chaotic map like Logistic map to generate the pseudo-random numbers mapped as the design variables for global optimization. Many existing researches indicated that COA can more easily escape from the local minima than classical stochastic optimization algorithms. This paper reveals the inherent mechanism of high efficiency and superior performance of COA, from a new perspective of both the probability distribution property and search speed of chaotic sequences generated by different chaotic maps. The statistical property and search speed of chaotic sequences are represented by the probability density function (PDF) and the Lyapunov exponent, respectively. Meanwhile, the computational performances of hybrid chaos-BFGS algorithms based on eight one-dimensional chaotic maps with different PDF and Lyapunov exponents are compared, in which BFGS is a quasi-Newton method for local optimization. Moreover, several multimodal benchmark examples illustrate that, the probability distribution property and search speed of chaotic sequences from different chaotic maps significantly affect the global searching capability and optimization efficiency of COA. To achieve the high efficiency of COA, it is recommended to adopt the appropriate chaotic map generating the desired chaotic sequences with uniform or nearly uniform probability distribution and large Lyapunov exponent.
MAKHA—A New Hybrid Swarm Intelligence Global Optimization Algorithm
Ahmed M.E. Khalil
2015-06-01
Full Text Available The search for efficient and reliable bio-inspired optimization methods continues to be an active topic of research due to the wide application of the developed methods. In this study, we developed a reliable and efficient optimization method via the hybridization of two bio-inspired swarm intelligence optimization algorithms, namely, the Monkey Algorithm (MA and the Krill Herd Algorithm (KHA. The hybridization made use of the efficient steps in each of the two original algorithms and provided a better balance between the exploration/diversification steps and the exploitation/intensification steps. The new hybrid algorithm, MAKHA, was rigorously tested with 27 benchmark problems and its results were compared with the results of the two original algorithms. MAKHA proved to be considerably more reliable and more efficient in tested problems.
Łukasz Kubuś
2015-08-01
Full Text Available Limited applicability of classical optimization methods influence the popularization of stochastic optimization techniques such as evolutionary algorithms (EAs. EAs are a class of probabilistic optimization techniques inspired by natural evolution process, witch belong to methods of Computational Intelligence (CI. EAs are based on concepts of natural selection and natural genetics. The basic principle of EA is searching optimal solution by processing population of individuals. This paper presents the results of simulation analysis of global optimization of benchmark function by Individually Directional Evolutionary Algorithm (IDEA and other EAs such as Real Coded Genetic Algorithm (RCGA, elite RCGA with the one elite individual, elite RCGA with the number of elite individuals equal to population size. IDEA is a newly developed algorithm for global optimization. Main principle of IDEA is to monitor and direct the evolution of selected individuals of population to explore promising areas in the search space. The idea of IDEA is an independent evolution of individuals in current population. This process is focused on indicating correct direction of changes in the elements of solution vector. This paper presents a flowchart, selection method and genetic operators used in IDEA. Moreover, similar mechanisms and genetic operators are also discussed.
Topology optimization using the finite volume method
Gersborg-Hansen, Allan; Bendsøe, Martin P.; Sigmund, Ole
Computational procedures for topology optimization of continuum problems using a material distribution method are typically based on the application of the finite element method (FEM) (see, e.g. [1]). In the present work we study a computational framework based on the finite volume method (FVM, see......, e.g. [2]) in order to develop methods for topology design for applications where conservation laws are critical such that element--wise conservation in the discretized models has a high priority. This encompasses problems involving for example mass and heat transport. The work described...... in this presentation is focused on a prototype model for topology optimization of steady heat diffusion. This allows for a study of the basic ingredients in working with FVM methods when dealing with topology optimization problems. The FVM and FEM based formulations differ both in how one computes the design...
A topological derivative method for topology optimization
Norato, J.; Bendsøe, Martin P.; Haber, RB;
2007-01-01
resource constraint. A smooth and consistent projection of the region bounded by the level set onto the fictitious analysis domain simplifies the response analysis and enhances the convergence of the optimization algorithm. Moreover, the projection supports the reintroduction of solid material in void......We propose a fictitious domain method for topology optimization in which a level set of the topological derivative field for the cost function identifies the boundary of the optimal design. We describe a fixed-point iteration scheme that implements this optimality criterion subject to a volumetric...... regions, a critical requirement for robust topology optimization. We present several numerical examples that demonstrate compliance minimization of fixed-volume, linearly elastic structures....
Boolean methods of optimization over independence systems
Hulme, B.L.
1983-01-01
This paper presents both a direct and an iterative method of solving the combinatorial optimization problem associated with any independence system. The methods use Boolean algebraic computations to produce solutions. In addition, the iterative method employs a version of the greedy algorithm both to compute upper bounds on the optimum value and to produce the additional circuits needed at every stage. The methods are extensions of those used to solve a problem of fire protection at nuclear reactor power plants.
The optimal homotopy asymptotic method engineering applications
Marinca, Vasile
2015-01-01
This book emphasizes in detail the applicability of the Optimal Homotopy Asymptotic Method to various engineering problems. It is a continuation of the book “Nonlinear Dynamical Systems in Engineering: Some Approximate Approaches”, published at Springer in 2011, and it contains a great amount of practical models from various fields of engineering such as classical and fluid mechanics, thermodynamics, nonlinear oscillations, electrical machines, and so on. The main structure of the book consists of 5 chapters. The first chapter is introductory while the second chapter is devoted to a short history of the development of homotopy methods, including the basic ideas of the Optimal Homotopy Asymptotic Method. The last three chapters, from Chapter 3 to Chapter 5, are introducing three distinct alternatives of the Optimal Homotopy Asymptotic Method with illustrative applications to nonlinear dynamical systems. The third chapter deals with the first alternative of our approach with two iterations. Five application...
Topology optimization using the finite volume method
Computational procedures for topology optimization of continuum problems using a material distribution method are typically based on the application of the finite element method (FEM) (see, e.g. [1]). In the present work we study a computational framework based on the finite volume method (FVM, see...... in this presentation is focused on a prototype model for topology optimization of steady heat diffusion. This allows for a study of the basic ingredients in working with FVM methods when dealing with topology optimization problems. The FVM and FEM based formulations differ both in how one computes the design...... derivative of the system matrix K and in how one computes the discretized version of certain objective functions. Thus for a cost function for minimum dissipated energy (like minimum compliance for an elastic structure) one obtains an expression c = u^\\T \\tilde{K}u $, where \\tilde{K} is different from K...
Topology optimization using the finite volume method
Gersborg-Hansen, Allan; Bendsøe, Martin P.; Sigmund, Ole
Computational procedures for topology optimization of continuum problems using a material distribution method are typically based on the application of the finite element method (FEM) (see, e.g. [1]). In the present work we study a computational framework based on the finite volume method (FVM, see...... in this presentation is focused on a prototype model for topology optimization of steady heat diffusion. This allows for a study of the basic ingredients in working with FVM methods when dealing with topology optimization problems. The FVM and FEM based formulations differ both in how one computes the design...... $, where $\\tilde{\\mathbf K}$ is different from $\\mathbf K $; in a FEM scheme these matrices are equal following the principle of virtual work. Using a staggered mesh and averaging procedures consistent with the FVM the checkerboard problem is eliminated. Two averages are compared to FE solutions, being...
Selective Segmentation for Global Optimization of Depth Estimation in Complex Scenes
Sheng Liu
2013-01-01
Full Text Available This paper proposes a segmentation-based global optimization method for depth estimation. Firstly, for obtaining accurate matching cost, the original local stereo matching approach based on self-adapting matching window is integrated with two matching cost optimization strategies aiming at handling both borders and occlusion regions. Secondly, we employ a comprehensive smooth term to satisfy diverse smoothness request in real scene. Thirdly, a selective segmentation term is used for enforcing the plane trend constraints selectively on the corresponding segments to further improve the accuracy of depth results from object level. Experiments on the Middlebury image pairs show that the proposed global optimization approach is considerably competitive with other state-of-the-art matching approaches.
Lee, Juyong; Lee, Jooyoung; Brooks, Bernard R; Ahn, Yong-Yeol
2016-01-01
We investigate the possibility of global optimization-based overlapping community detection, using link community framework. We first show that partition density, the original quality function used in link community detection method, is not suitable as a quality function for global optimization because it prefers breaking communities into triangles except in highly limited conditions. We analytically derive those conditions and confirm it with computational results on direct optimization of various synthetic and real-world networks. To overcome this limitation, we propose alternative approaches combining the weighted line graph transformation and existing quality functions for node-based communities. We suggest a new line graph weighting scheme, a normalized Jaccard index. Computational results show that community detection using the weighted line graphs generated with the normalized Jaccard index leads to a more accurate community structure.
Mehdi Neshat
2015-11-01
Full Text Available In this article, the objective was to present effective and optimal strategies aimed at improving the Swallow Swarm Optimization (SSO method. The SSO is one of the best optimization methods based on swarm intelligence which is inspired by the intelligent behaviors of swallows. It has been able to offer a relatively strong method for solving optimization problems. However, despite its many advantages, the SSO suffers from two shortcomings. Firstly, particles movement speed is not controlled satisfactorily during the search due to the lack of an inertia weight. Secondly, the variables of the acceleration coefficient are not able to strike a balance between the local and the global searches because they are not sufficiently flexible in complex environments. Therefore, the SSO algorithm does not provide adequate results when it searches in functions such as the Step or Quadric function. Hence, the fuzzy adaptive Swallow Swarm Optimization (FASSO method was introduced to deal with these problems. Meanwhile, results enjoy high accuracy which are obtained by using an adaptive inertia weight and through combining two fuzzy logic systems to accurately calculate the acceleration coefficients. High speed of convergence, avoidance from falling into local extremum, and high level of error tolerance are the advantages of proposed method. The FASSO was compared with eleven of the best PSO methods and SSO in 18 benchmark functions. Finally, significant results were obtained.
Zhang, Jiapu
2010-01-01
Evolutionary algorithms are parallel computing algorithms and simulated annealing algorithm is a sequential computing algorithm. This paper inserts simulated annealing into evolutionary computations and successful developed a hybrid Self-Adaptive Evolutionary Strategy $\\mu+\\lambda$ method and a hybrid Self-Adaptive Classical Evolutionary Programming method. Numerical results on more than 40 benchmark test problems of global optimization show that the hybrid methods presented in this paper are very effective. Lennard-Jones potential energy minimization is another benchmark for testing new global optimization algorithms. It is studied through the amyloid fibril constructions by this paper. To date, there is little molecular structural data available on the AGAAAAGA palindrome in the hydrophobic region (113-120) of prion proteins.This region belongs to the N-terminal unstructured region (1-123) of prion proteins, the structure of which has proved hard to determine using NMR spectroscopy or X-ray crystallography ...
Genetic algorithms as global random search methods
Peck, Charles C.; Dhawan, Atam P.
1995-01-01
Genetic algorithm behavior is described in terms of the construction and evolution of the sampling distributions over the space of candidate solutions. This novel perspective is motivated by analysis indicating that the schema theory is inadequate for completely and properly explaining genetic algorithm behavior. Based on the proposed theory, it is argued that the similarities of candidate solutions should be exploited directly, rather than encoding candidate solutions and then exploiting their similarities. Proportional selection is characterized as a global search operator, and recombination is characterized as the search process that exploits similarities. Sequential algorithms and many deletion methods are also analyzed. It is shown that by properly constraining the search breadth of recombination operators, convergence of genetic algorithms to a global optimum can be ensured.
Methods for mapping and monitoring global glaciovolcanism
Curtis, Aaron; Kyle, Philip
2017-03-01
The most deadly (Nevado del Ruiz, 1985) and the most costly (Eyjafjallajökull, 2010) eruptions of the last 100 years were both glaciovolcanic. Considering its great importance to studies of volcanic hazards, global climate, and even astrobiology, the global distribution of glaciovolcanism is insufficiently understood. We present and assess three algorithms for mapping, monitoring, and predicting likely centers of glaciovolcanic activity worldwide. Each algorithm intersects buffer zones representing known Holocene-active volcanic centers with existing datasets of snow, ice, and permafrost. Two detection algorithms, RGGA and PZGA, are simple spatial join operations computed from the Randolph Glacier Inventory and the Permafrost Zonation Index, respectively. The third, MDGA, is an algorithm run on all 15 available years of the MOD10A2 weekly snow cover product from the Terra MODIS satellite radiometer. Shortcomings and advantages of the three methods are discussed, including previously unreported blunders in the MOD10A2 dataset. Comparison of the results leads to an effective approach for integrating the three methods. We show that 20.4% of known Holocene volcanic centers host glaciers or areas of permanent snow. A further 10.9% potentially interact with permafrost. MDGA and PZGA do not rely on any human input, rendering them useful for investigations of change over time. An intermediate step in MDGA involves estimating the snow-covered area at every Holocene volcanic center. These estimations can be updated weekly with no human intervention. To investigate the feasibility of an automatic ice-loss alert system, we consider three examples of glaciovolcanism in the MDGA weekly dataset. We also discuss the potential use of PZGA to model past and future glaciovolcanism based on global circulation model outputs. Combined, the three algorithms provide an automated system for understanding the geographic and temporal patterns of global glaciovolcanism which should be of use
Memetic Algorithms to Solve a Global Nonlinear Optimization Problem. A Review
M. K. Sakharov
2015-01-01
Full Text Available In recent decades, evolutionary algorithms have proven themselves as the powerful optimization techniques of search engine. Their popularity is due to the fact that they are easy to implement and can be used in all areas, since they are based on the idea of universal evolution. For example, in the problems of a large number of local optima, the traditional optimization methods, usually, fail in finding the global optimum. To solve such problems using a variety of stochastic methods, in particular, the so-called population-based algorithms, which are a kind of evolutionary methods. The main disadvantage of this class of methods is their slow convergence to the exact solution in the neighborhood of the global optimum, as these methods incapable to use the local information about the landscape of the function. This often limits their use in largescale real-world problems where the computation time is a critical factor.One of the promising directions in the field of modern evolutionary computation are memetic algorithms, which can be regarded as a combination of population search of the global optimum and local procedures for verifying solutions, which gives a synergistic effect. In the context of memetic algorithms, the meme is an implementation of the local optimization method to refine solution in the search.The concept of memetic algorithms provides ample opportunities for the development of various modifications of these algorithms, which can vary the frequency of the local search, the conditions of its end, and so on. The practically significant memetic algorithm modifications involve the simultaneous use of different memes. Such algorithms are called multi-memetic.The paper gives statement of the global problem of nonlinear unconstrained optimization, describes the most promising areas of AI modifications, including hybridization and metaoptimization. The main content of the work is the classification and review of existing varieties of
SGO: A fast engine for ab initio atomic structure global optimization by differential evolution
Chen, Zhanghui; Jia, Weile; Jiang, Xiangwei; Li, Shu-Shen; Wang, Lin-Wang
2017-10-01
As the high throughout calculations and material genome approaches become more and more popular in material science, the search for optimal ways to predict atomic global minimum structure is a high research priority. This paper presents a fast method for global search of atomic structures at ab initio level. The structures global optimization (SGO) engine consists of a high-efficiency differential evolution algorithm, accelerated local relaxation methods and a plane-wave density functional theory code running on GPU machines. The purpose is to show what can be achieved by combining the superior algorithms at the different levels of the searching scheme. SGO can search the global-minimum configurations of crystals, two-dimensional materials and quantum clusters without prior symmetry restriction in a relatively short time (half or several hours for systems with less than 25 atoms), thus making such a task a routine calculation. Comparisons with other existing methods such as minima hopping and genetic algorithm are provided. One motivation of our study is to investigate the properties of magnetic systems in different phases. The SGO engine is capable of surveying the local minima surrounding the global minimum, which provides the information for the overall energy landscape of a given system. Using this capability we have found several new configurations for testing systems, explored their energy landscape, and demonstrated that the magnetic moment of metal clusters fluctuates strongly in different local minima.
Topology optimization using the finite volume method
Computational procedures for topology optimization of continuum problems using a material distribution method are typically based on the application of the finite element method (FEM) (see, e.g. [1]). In the present work we study a computational framework based on the finite volume method (FVM, see...... the well known Reuss lower bound. [1] Bendsøe, M.P.; Sigmund, O. 2004: Topology Optimization - Theory, Methods, and Applications. Berlin Heidelberg: Springer Verlag [2] Versteeg, H. K.; W. Malalasekera 1995: An introduction to Computational Fluid Dynamics: the Finite Volume Method. London: Longman......, e.g. [2]) in order to develop methods for topology design for applications where conservation laws are critical such that element--wise conservation in the discretized models has a high priority. This encompasses problems involving for example mass and heat transport. The work described...
Optimal boarding method for airline passengers
Steffen, Jason H.; /Fermilab
2008-02-01
Using a Markov Chain Monte Carlo optimization algorithm and a computer simulation, I find the passenger ordering which minimizes the time required to board the passengers onto an airplane. The model that I employ assumes that the time that a passenger requires to load his or her luggage is the dominant contribution to the time needed to completely fill the aircraft. The optimal boarding strategy may reduce the time required to board and airplane by over a factor of four and possibly more depending upon the dimensions of the aircraft. I explore some features of the optimal boarding method and discuss practical modifications to the optimal. Finally, I mention some of the benefits that could come from implementing an improved passenger boarding scheme.
State space Newton's method for topology optimization
Evgrafov, Anton
2014-01-01
We introduce a new algorithm for solving certain classes of topology optimization problems, which enjoys fast local convergence normally achieved by the full space methods while working in a smaller reduced space. The computational complexity of Newton’s direction finding subproblem in the algori......We introduce a new algorithm for solving certain classes of topology optimization problems, which enjoys fast local convergence normally achieved by the full space methods while working in a smaller reduced space. The computational complexity of Newton’s direction finding subproblem...
An introduction to harmony search optimization method
Wang, Xiaolei; Zenger, Kai
2014-01-01
This brief provides a detailed introduction, discussion and bibliographic review of the nature1-inspired optimization algorithm called Harmony Search. It uses a large number of simulation results to demonstrate the advantages of Harmony Search and its variants and also their drawbacks. The authors show how weaknesses can be amended by hybridization with other optimization methods. The Harmony Search Method with Applications will be of value to researchers in computational intelligence in demonstrating the state of the art of research on an algorithm of current interest. It also helps researche
Optimization methods applied to hybrid vehicle design
Donoghue, J. F.; Burghart, J. H.
1983-01-01
The use of optimization methods as an effective design tool in the design of hybrid vehicle propulsion systems is demonstrated. Optimization techniques were used to select values for three design parameters (battery weight, heat engine power rating and power split between the two on-board energy sources) such that various measures of vehicle performance (acquisition cost, life cycle cost and petroleum consumption) were optimized. The apporach produced designs which were often significant improvements over hybrid designs already reported on in the literature. The principal conclusions are as follows. First, it was found that the strategy used to split the required power between the two on-board energy sources can have a significant effect on life cycle cost and petroleum consumption. Second, the optimization program should be constructed so that performance measures and design variables can be easily changed. Third, the vehicle simulation program has a significant effect on the computer run time of the overall optimization program; run time can be significantly reduced by proper design of the types of trips the vehicle takes in a one year period. Fourth, care must be taken in designing the cost and constraint expressions which are used in the optimization so that they are relatively smooth functions of the design variables. Fifth, proper handling of constraints on battery weight and heat engine rating, variables which must be large enough to meet power demands, is particularly important for the success of an optimization study. Finally, the principal conclusion is that optimization methods provide a practical tool for carrying out the design of a hybrid vehicle propulsion system.
Advancing methods for global crop area estimation
King, M. L.; Hansen, M.; Adusei, B.; Stehman, S. V.; Becker-Reshef, I.; Ernst, C.; Noel, J.
2012-12-01
Cropland area estimation is a challenge, made difficult by the variety of cropping systems, including crop types, management practices, and field sizes. A MODIS derived indicator mapping product (1) developed from 16-day MODIS composites has been used to target crop type at national scales for the stratified sampling (2) of higher spatial resolution data for a standardized approach to estimate cultivated area. A global prototype is being developed using soybean, a global commodity crop with recent LCLUC dynamic and a relatively unambiguous spectral signature, for the United States, Argentina, Brazil, and China representing nearly ninety percent of soybean production. Supervised classification of soy cultivated area is performed for 40 km2 sample blocks using time-series, Landsat imagery. This method, given appropriate data for representative sampling with higher spatial resolution, represents an efficient and accurate approach for large area crop type estimation. Results for the United States sample blocks have exhibited strong agreement with the National Agricultural Statistics Service's (NASS's) Cropland Data Layer (CDL). A confusion matrix showed a 91.56% agreement and a kappa of .67 between the two products. Field measurements and RapidEye imagery have been collected for the USA, Brazil and Argentina in further assessing product accuracies. The results of this research will demonstrate the value of MODIS crop type indicator products and Landsat sample data in estimating soybean cultivated area at national scales, enabling an internally consistent global assessment of annual soybean production.
Cho, Su Gil; Jang, Jun Yong; Kim, Ji Hoon; Lee, Tae Hee [Hanyang University, Seoul (Korea, Republic of); Lee, Min Uk [Romax Technology Ltd., Seoul (Korea, Republic of); Choi, Jong Su; Hong, Sup [Korea Research Institute of Ships and Ocean Engineering, Daejeon (Korea, Republic of)
2015-04-15
Sequential surrogate model-based global optimization algorithms, such as super-EGO, have been developed to increase the efficiency of commonly used global optimization technique as well as to ensure the accuracy of optimization. However, earlier studies have drawbacks because there are three phases in the optimization loop and empirical parameters. We propose a united sampling criterion to simplify the algorithm and to achieve the global optimum of problems with constraints without any empirical parameters. It is able to select the points located in a feasible region with high model uncertainty as well as the points along the boundary of constraint at the lowest objective value. The mean squared error determines which criterion is more dominant among the infill sampling criterion and boundary sampling criterion. Also, the method guarantees the accuracy of the surrogate model because the sample points are not located within extremely small regions like super-EGO. The performance of the proposed method, such as the solvability of a problem, convergence properties, and efficiency, are validated through nonlinear numerical examples with disconnected feasible regions.
Fourier-transform and global contrast interferometer alignment methods
Goldberg, Kenneth A.
2001-01-01
Interferometric methods are presented to facilitate alignment of image-plane components within an interferometer and for the magnified viewing of interferometer masks in situ. Fourier-transforms are performed on intensity patterns that are detected with the interferometer and are used to calculate pseudo-images of the electric field in the image plane of the test optic where the critical alignment of various components is being performed. Fine alignment is aided by the introduction and optimization of a global contrast parameter that is easily calculated from the Fourier-transform.
Optimization Methods in Emotion Recognition System
L. Povoda
2016-09-01
Full Text Available Emotions play big role in our everyday communication and contain important information. This work describes a novel method of automatic emotion recognition from textual data. The method is based on well-known data mining techniques, novel approach based on parallel run of SVM (Support Vector Machine classifiers, text preprocessing and 3 optimization methods: sequential elimination of attributes, parameter optimization based on token groups, and method of extending train data sets during practical testing and production release final tuning. We outperformed current state of the art methods and the results were validated on bigger data sets (3346 manually labelled samples which is less prone to overfitting when compared to related works. The accuracy achieved in this work is 86.89% for recognition of 5 emotional classes. The experiments were performed in the real world helpdesk environment, was processing Czech language but the proposed methodology is general and can be applied to many different languages.
Malone, Brett; Mason, W. H.
1992-01-01
An extension of our parametric multidisciplinary optimization method to include design results connecting multiple objective functions is presented. New insight into the effect of the figure of merit (objective function) on aircraft configuration size and shape is demonstrated using this technique. An aircraft concept, subject to performance and aerodynamic constraints, is optimized using the global sensitivity equation method for a wide range of objective functions. These figures of merit are described parametrically such that a series of multiobjective optimal solutions can be obtained. Computational speed is facilitated by use of algebraic representations of the system technologies. Using this method, the evolution of an optimum design from one objective function to another is demonstrated. Specifically, combinations of minimum takeoff gross weight, fuel weight, and maximum cruise performance and productivity parameters are used as objective functions.
Malone, Brett; Mason, W. H.
1992-01-01
An extension of our parametric multidisciplinary optimization method to include design results connecting multiple objective functions is presented. New insight into the effect of the figure of merit (objective function) on aircraft configuration size and shape is demonstrated using this technique. An aircraft concept, subject to performance and aerodynamic constraints, is optimized using the global sensitivity equation method for a wide range of objective functions. These figures of merit are described parametrically such that a series of multiobjective optimal solutions can be obtained. Computational speed is facilitated by use of algebraic representations of the system technologies. Using this method, the evolution of an optimum design from one objective function to another is demonstrated. Specifically, combinations of minimum takeoff gross weight, fuel weight, and maximum cruise performance and productivity parameters are used as objective functions.
Adaptive finite element method for shape optimization
Morin, Pedro
2012-01-16
We examine shape optimization problems in the context of inexact sequential quadratic programming. Inexactness is a consequence of using adaptive finite element methods (AFEM) to approximate the state and adjoint equations (via the dual weighted residual method), update the boundary, and compute the geometric functional. We present a novel algorithm that equidistributes the errors due to shape optimization and discretization, thereby leading to coarse resolution in the early stages and fine resolution upon convergence, and thus optimizing the computational effort. We discuss the ability of the algorithm to detect whether or not geometric singularities such as corners are genuine to the problem or simply due to lack of resolution - a new paradigm in adaptivity. © EDP Sciences, SMAI, 2012.
Global Optimization of Interplanetary Trajectories in the Presence of Realistic Mission Contraints
Hinckley, David, Jr.; Englander, Jacob; Hitt, Darren
2015-01-01
Interplanetary missions are often subject to difficult constraints, like solar phase angle upon arrival at the destination, velocity at arrival, and altitudes for flybys. Preliminary design of such missions is often conducted by solving the unconstrained problem and then filtering away solutions which do not naturally satisfy the constraints. However this can bias the search into non-advantageous regions of the solution space, so it can be better to conduct preliminary design with the full set of constraints imposed. In this work two stochastic global search methods are developed which are well suited to the constrained global interplanetary trajectory optimization problem.
Wang, Xuewu; Shi, Yingpan; Ding, Dongyan; Gu, Xingsheng
2016-02-01
Spot-welding robots have a wide range of applications in manufacturing industries. There are usually many weld joints in a welding task, and a reasonable welding path to traverse these weld joints has a significant impact on welding efficiency. Traditional manual path planning techniques can handle a few weld joints effectively, but when the number of weld joints is large, it is difficult to obtain the optimal path. The traditional manual path planning method is also time consuming and inefficient, and cannot guarantee optimality. Double global optimum genetic algorithm-particle swarm optimization (GA-PSO) based on the GA and PSO algorithms is proposed to solve the welding robot path planning problem, where the shortest collision-free paths are used as the criteria to optimize the welding path. Besides algorithm effectiveness analysis and verification, the simulation results indicate that the algorithm has strong searching ability and practicality, and is suitable for welding robot path planning.
Adjusting process count on demand for petascale global optimization
Sosonkina, Masha
2013-01-01
There are many challenges that need to be met before efficient and reliable computation at the petascale is possible. Many scientific and engineering codes running at the petascale are likely to be memory intensive, which makes thrashing a serious problem for many petascale applications. One way to overcome this challenge is to use a dynamic number of processes, so that the total amount of memory available for the computation can be increased on demand. This paper describes modifications made to the massively parallel global optimization code pVTdirect in order to allow for a dynamic number of processes. In particular, the modified version of the code monitors memory use and spawns new processes if the amount of available memory is determined to be insufficient. The primary design challenges are discussed, and performance results are presented and analyzed.
Method for optimizing harvesting of crops
2008-01-01
In order e.g. to optimize harvesting crops of the kind which may be self dried on a field prior to a harvesting step (116, 118), there is disclosed a method of providing a mobile unit (102) for working (114, 116, 118) the field with crops, equipping the mobile unit (102) with crop biomass...
Non-probabilistic Robust Optimal Design Method
SUN Wei; XU Huanwei; ZHANG Xu
2009-01-01
For the purpose of dealing with uncertainty factors in engineering optimization problems, this paper presents a new non-probabilistic robust optimal design method based on maximum variation estimation. The method analyzes the effect of uncertain factors to objective and constraints functions, and then the maximal variations to a solution are calculated. In order to guarantee robust feasibility the maximal variations of constraints are added to original constraints as penalty term; the maximal variation of objective function is taken as a robust index to a solution; linear physical programming is used to adjust the values of quality characteristic and quality variation, and then a bi-level mathematical robust optimal model is coustructed. The method does not require presumed probability distribution of uncertain factors or continuous and differentiable of objective and constraints functions. To demonstrate the proposed method, the design of the two-bar structure acted by concentrated load is presented. In the example the robustness of the normal stress, feasibility of the total volume and the buckling stress are studied. The robust optimal design results show that in the condition of maintaining feasibility robustness, the proposed approach can obtain a robust solution which the designer is satisfied with the value of objective function and its variation.
Design of articulated mechanisms with a degree of freedom constraint using global optimization
Kawamoto, Atsushi; Stolpe, Mathias
2004-01-01
This paper deals with design of articulated mechanisms using a truss ground structure representation. The considered mechanism design problem is to maximize the output displacement for a given input force by choosing a prescribed number of truss elements out of all the available elements, so...... displacements. The problem is formulated as a non-convex mixed integer problem and solved using a convergent deterministic global optimization method based on branch and bound with convex relaxations....
Igeta, Hideki; Hasegawa, Mikio
Chaotic dynamics have been effectively applied to improve various heuristic algorithms for combinatorial optimization problems in many studies. Currently, the most used chaotic optimization scheme is to drive heuristic solution search algorithms applicable to large-scale problems by chaotic neurodynamics including the tabu effect of the tabu search. Alternatively, meta-heuristic algorithms are used for combinatorial optimization by combining a neighboring solution search algorithm, such as tabu, gradient, or other search method, with a global search algorithm, such as genetic algorithms (GA), ant colony optimization (ACO), or others. In these hybrid approaches, the ACO has effectively optimized the solution of many benchmark problems in the quadratic assignment problem library. In this paper, we propose a novel hybrid method that combines the effective chaotic search algorithm that has better performance than the tabu search and global search algorithms such as ACO and GA. Our results show that the proposed chaotic hybrid algorithm has better performance than the conventional chaotic search and conventional hybrid algorithms. In addition, we show that chaotic search algorithm combined with ACO has better performance than when combined with GA.
Models and Methods for Free Material Optimization
Weldeyesus, Alemseged Gebrehiwot
FMO problem formulations with stress constraints. These problems are highly nonlinear and lead to the so-called singularity phenomenon. The method described in the thesis has successfully solved these problems. In the numerical experiments the stress constraints have been satisfied with high...... conditions for physical attainability, in the context that, it has to be symmetric and positive semidefinite. FMO problems have been studied for the last two decades in many articles that led to the development of a wide range of models, methods, and theories. As the design variables in FMO are the local....... These problems are more difficult to solve and demand higher computational efforts than the standard optimization problems. The focus of today’s development of solution methods for FMO problems is based on first-order methods that require a large number of iterations to obtain optimal solutions. The scope...
Zhang, Jiapu
2013-01-01
Simulated annealing (SA) was inspired from annealing in metallurgy, a technique involving heating and controlled cooling of a material to increase the size of its crystals and reduce their defects, both are attributes of the material that depend on its thermodynamic free energy. In this Paper, firstly we will study SA in details on its practical implementation. Then, hybrid pure SA with local (or global) search optimization methods allows us to be able to design several effective and efficient global search optimization methods. In order to keep the original sense of SA, we clarify our understandings of SA in crystallography and molecular modeling field through the studies of prion amyloid fibrils.
Global Optimization for Black-box Simulation via Sequential Intrinsic Kriging
Mehdad, E.; Kleijnen, Jack P.C.
2014-01-01
In this paper we investigate global optimization for black-box simulations using metamodels to guide this optimization. As a novel metamodel we introduce intrinsic Kriging, for either deterministic or random simulation. For deterministic simulation we study the famous `efficient global optimization'
Global stability-based design optimization of truss structures using multiple objectives
Tugrul Talaslioglu
2013-02-01
This paper discusses the effect of global stability on the optimal size and shape of truss structures taking into account of a nonlinear critical load, truss weight and serviceability at the same time. The nonlinear critical load is computed by arc-length method. In order to increase the accuracy of the estimation of critical load (ignoring material nonlinearity), an eigenvalue analysis is implemented into the arc-length method. Furthermore, a pure pareto-ranking based multi-objective optimization model is employed for the design optimization of the truss structure with multiple objectives. The computational performance of the optimization model is increased by implementing an island model into its evolutionary search mechanism. The proposed design optimization approach is applied for both size and shape optimization of real world trusses including 101, 224 and 444 bars and successful in generating feasible designations in a large and complex design space. It is observed that the computational performance of pareto-ranking based island model is better than the pure pareto-ranking based model. Therefore, pareto-ranking based island model is recommended to optimize the design of truss structure possessing geometric nonlinearity
Quantum-inspired immune clonal algorithm for global optimization.
Jiao, Licheng; Li, Yangyang; Gong, Maoguo; Zhang, Xiangrong
2008-10-01
Based on the concepts and principles of quantum computing, a novel immune clonal algorithm, called a quantum-inspired immune clonal algorithm (QICA), is proposed to deal with the problem of global optimization. In QICA, the antibody is proliferated and divided into a set of subpopulation groups. The antibodies in a subpopulation group are represented by multistate gene quantum bits. In the antibody's updating, the general quantum rotation gate strategy and the dynamic adjusting angle mechanism are applied to accelerate convergence. The quantum not gate is used to realize quantum mutation to avoid premature convergences. The proposed quantum recombination realizes the information communication between subpopulation groups to improve the search efficiency. Theoretical analysis proves that QICA converges to the global optimum. In the first part of the experiments, 10 unconstrained and 13 constrained benchmark functions are used to test the performance of QICA. The results show that QICA performs much better than the other improved genetic algorithms in terms of the quality of solution and computational cost. In the second part of the experiments, QICA is applied to a practical problem (i.e., multiuser detection in direct-sequence code-division multiple-access systems) with a satisfying result.
SPICE benchmark for global tomographic methods
Qin, Yilong; Capdeville, Yann; Maupin, Valerie; Montagner, Jean-Paul; Lebedev, Sergei; Beucler, Eric
2008-11-01
The existing global tomographic methods result in different models due to different parametrization, scale resolution and theoretical approach. To test how current imaging techniques are limited by approximations in theory and by the inadequacy of data quality and coverage, it is necessary to perform a global-scale benchmark to understand the resolving properties of each specific imaging algorithm. In the framework of the Seismic wave Propagation and Imaging in Complex media: a European network (SPICE) project, it was decided to perform a benchmark experiment of global inversion algorithms. First, a preliminary benchmark with a simple isotropic model is carried out to check the feasibility in terms of acquisition geometry and numerical accuracy. Then, to fully validate tomographic schemes with a challenging synthetic data set, we constructed one complex anisotropic global model, which is characterized by 21 elastic constants and includes 3-D heterogeneities in velocity, anisotropy (radial and azimuthal anisotropy), attenuation, density, as well as surface topography and bathymetry. The intermediate-period (>32 s), high fidelity anisotropic modelling was performed by using state-of-the-art anisotropic anelastic modelling code, that is, coupled spectral element method (CSEM), on modern massively parallel computing resources. The benchmark data set consists of 29 events and three-component seismograms are recorded by 256 stations. Because of the limitation of the available computing power, synthetic seismograms have a minimum period of 32 s and a length of 10 500 s. The inversion of the benchmark data set demonstrates several well-known problems of classical surface wave tomography, such as the importance of crustal correction to recover the shallow structures, the loss of resolution with depth, the smearing effect, both horizontal and vertical, the inaccuracy of amplitude of isotropic S-wave velocity variation, the difficulty of retrieving the magnitude of azimuthal
Dead time optimization method for power converter
Deselaers, C.; Bergmann, U.; Gronwald, F.
2013-07-01
This paper introduces a method for dead time optimization in variable speed motor drive systems. The aim of this method is to reduce the conduction time of the freewheeling diode to a minimum without generation of cross conduction. This results in lower losses, improved EMC, and less overshooting of the phase voltage. The principle of the method is to detect beginning cross currents without adding additional components in the half bridge like resistors or inductances. Only the wave shape of the phase voltage needs to be monitored during switching. This is illustrated by an application of the method to a real power converter.
Calibration of an agricultural-hydrological model (RZWQM2) using surrogate global optimization
Xi, Maolong; Lu, Dan; Gui, Dongwei; Qi, Zhiming; Zhang, Guannan
2017-01-01
Robust calibration of an agricultural-hydrological model is critical for simulating crop yield and water quality and making reasonable agricultural management. However, calibration of the agricultural-hydrological system models is challenging because of model complexity, the existence of strong parameter correlation, and significant computational requirements. Therefore, only a limited number of simulations can be allowed in any attempt to find a near-optimal solution within an affordable time, which greatly restricts the successful application of the model. The goal of this study is to locate the optimal solution of the Root Zone Water Quality Model (RZWQM2) given a limited simulation time, so as to improve the model simulation and help make rational and effective agricultural-hydrological decisions. To this end, we propose a computationally efficient global optimization procedure using sparse-grid based surrogates. We first used advanced sparse grid (SG) interpolation to construct a surrogate system of the actual RZWQM2, and then we calibrate the surrogate model using the global optimization algorithm, Quantum-behaved Particle Swarm Optimization (QPSO). As the surrogate model is a polynomial with fast evaluation, it can be efficiently evaluated with a sufficiently large number of times during the optimization, which facilitates the global search. We calibrate seven model parameters against five years of yield, drain flow, and NO3-N loss data from a subsurface-drained corn-soybean field in Iowa. Results indicate that an accurate surrogate model can be created for the RZWQM2 with a relatively small number of SG points (i.e., RZWQM2 runs). Compared to the conventional QPSO algorithm, our surrogate-based optimization method can achieve a smaller objective function value and better calibration performance using a fewer number of expensive RZWQM2 executions, which greatly improves computational efficiency.
A VIRTUAL MESH METHOD FOR THE OPTIMIZED DESIGN OF COMPLEX STRUCTURES
DuTaisheng; HllangRongjie; SongTianxia; ChenChuanyao
2003-01-01
Concepts for a virtual 3D space and a hyper-sphere are proposed and the formulae for determining the computable nodes of the mesh are derived. Then a new optimization design method ('Virtual Mesh Method' or V.M.M) is developed. Three examples are given, showing that the method proposed is especially suitable for the optimized design of complex structures, and that the global approximate optimal solution can be searched with remarkably reduced computational work.
Global path planning approach based on ant colony optimization algorithm
WEN Zhi-qiang; CAI Zi-xing
2006-01-01
Ant colony optimization (ACO) algorithm was modified to optimize the global path. In order to simulate the real ant colonies, according to the foraging behavior of ant colonies and the characteristic of food, conceptions of neighboring area and smell area were presented. The former can ensure the diversity of paths and the latter ensures that each ant can reach the goal. Then the whole path was divided into three parts and ACO was used to search the second part path. When the three parts pathes were adjusted,the final path was found. The valid path and invalid path were defined to ensure the path valid. Finally, the strategies of the pheromone search were applied to search the optimum path. However, when only the pheromone was used to search the optimum path, ACO converges easily. In order to avoid this premature convergence, combining pheromone search and random search, a hybrid ant colony algorithm(HACO) was used to find the optimum path. The comparison between ACO and HACO shows that HACO can be used to find the shortest path.
Analyses of Methods and Algorithms for Modelling and Optimization of Biotechnological Processes
Stoyan Stoyanov
2009-08-01
Full Text Available A review of the problems in modeling, optimization and control of biotechnological processes and systems is given in this paper. An analysis of existing and some new practical optimization methods for searching global optimum based on various advanced strategies - heuristic, stochastic, genetic and combined are presented in the paper. Methods based on the sensitivity theory, stochastic and mix strategies for optimization with partial knowledge about kinetic, technical and economic parameters in optimization problems are discussed. Several approaches for the multi-criteria optimization tasks are analyzed. The problems concerning optimal controls of biotechnological systems are also discussed.
Optimizing global liver function in radiation therapy treatment planning
Wu, Victor W.; Epelman, Marina A.; Wang, Hesheng; Romeijn, H. Edwin; Feng, Mary; Cao, Yue; Ten Haken, Randall K.; Matuszak, Martha M.
2016-09-01
Liver stereotactic body radiation therapy (SBRT) patients differ in both pre-treatment liver function (e.g. due to degree of cirrhosis and/or prior treatment) and radiosensitivity, leading to high variability in potential liver toxicity with similar doses. This work investigates three treatment planning optimization models that minimize risk of toxicity: two consider both voxel-based pre-treatment liver function and local-function-based radiosensitivity with dose; one considers only dose. Each model optimizes different objective functions (varying in complexity of capturing the influence of dose on liver function) subject to the same dose constraints and are tested on 2D synthesized and 3D clinical cases. The normal-liver-based objective functions are the linearized equivalent uniform dose (\\ell \\text{EUD} ) (conventional ‘\\ell \\text{EUD} model’), the so-called perfusion-weighted \\ell \\text{EUD} (\\text{fEUD} ) (proposed ‘fEUD model’), and post-treatment global liver function (GLF) (proposed ‘GLF model’), predicted by a new liver-perfusion-based dose-response model. The resulting \\ell \\text{EUD} , fEUD, and GLF plans delivering the same target \\ell \\text{EUD} are compared with respect to their post-treatment function and various dose-based metrics. Voxel-based portal venous liver perfusion, used as a measure of local function, is computed using DCE-MRI. In cases used in our experiments, the GLF plan preserves up to 4.6 % ≤ft(7.5 % \\right) more liver function than the fEUD (\\ell \\text{EUD} ) plan does in 2D cases, and up to 4.5 % ≤ft(5.6 % \\right) in 3D cases. The GLF and fEUD plans worsen in \\ell \\text{EUD} of functional liver on average by 1.0 Gy and 0.5 Gy in 2D and 3D cases, respectively. Liver perfusion information can be used during treatment planning to minimize the risk of toxicity by improving expected GLF; the degree of benefit varies with perfusion pattern. Although fEUD model optimization is computationally inexpensive and
Optimizing global liver function in radiation therapy treatment planning
Wu, Victor W; Epelman, Marina A; Wang, Hesheng; Romeijn, H Edwin; Feng, Mary; Cao, Yue; Haken, Randall K Ten; Matuszak, Martha M
2017-01-01
Liver stereotactic body radiation therapy (SBRT) patients differ in both pre-treatment liver function (e.g. due to degree of cirrhosis and/or prior treatment) and radiosensitivity, leading to high variability in potential liver toxicity with similar doses. This work investigates three treatment planning optimization models that minimize risk of toxicity: two consider both voxel-based pre-treatment liver function and local-function-based radiosensitivity with dose; one considers only dose. Each model optimizes different objective functions (varying in complexity of capturing the influence of dose on liver function) subject to the same dose constraints and are tested on 2D synthesized and 3D clinical cases. The normal-liver-based objective functions are the linearized equivalent uniform dose (ℓEUD) (conventional ‘ℓEUD model’), the so-called perfusion-weighted ℓEUD (fEUD) (proposed ‘fEUD model’), and post-treatment global liver function (GLF) (proposed ‘GLF model’), predicted by a new liver-perfusion-based dose-response model. The resulting ℓEUD, fEUD, and GLF plans delivering the same target ℓEUD are compared with respect to their post-treatment function and various dose-based metrics. Voxel-based portal venous liver perfusion, used as a measure of local function, is computed using DCE-MRI. In cases used in our experiments, the GLF plan preserves up to 4.6%(7.5%) more liver function than the fEUD (ℓEUD) plan does in 2D cases, and up to 4.5%(5.6%) in 3D cases. The GLF and fEUD plans worsen in ℓEUD of functional liver on average by 1.0 Gy and 0.5 Gy in 2D and 3D cases, respectively. Liver perfusion information can be used during treatment planning to minimize the risk of toxicity by improving expected GLF; the degree of benefit varies with perfusion pattern. Although fEUD model optimization is computationally inexpensive and often achieves better GLF than ℓEUD model optimization does, the GLF model directly optimizes a more clinically
PART BUILDING ORIENTATION OPTIMIZATION METHOD IN STEREOLITHOGRAPHY
无
2006-01-01
Aiming at the part quality and building time problems in stereolithography (SL) caused by unreasonable building orientation, a part building orientation decision method in SL rapid prototyping (RP) is carried out. Bringing into full consideration of the deformation, stair-stepping effect, overcure effect and building time related to the part fabrication orientation, and using evaluation function method, a multi-objective optimization model for the building orientation is defined. According to the difference in the angles between normal vectors of triangular facets in standard triangulation language (STL) model and z axis, the expressions of deformation area, stair-stepping area, overcure area are established. According to the characteristics in SL process, part building time is divided into four sections, that is, hatching scanning time, outline scanning time, support building time and layer waiting time. Expressions of each building time section are given. Considering the features of this optimization model, genetic algorithm (GA) is used to derive the optimization objective, related software is developed and optimization results are tested through experiments. Application shows that this method can effectively solve the quality and efficiency troubles caused by unreasonable part building orientation, an automatic orientation-determining program is developed and verified through test.
W. J. Vanhaute
2011-11-01
Full Text Available The use of rainfall time series for various applications is widespread. However, in many cases historical rainfall records lack in length or quality for certain practical purposes, resulting in a reliance on rainfall models to supply simulated rainfall time series, e.g., in the design of hydraulic structures. One way to obtain such simulations is by means of stochastic point process rainfall models, such as the Bartlett-Lewis type of model. It is widely acknowledged that the calibration of such models suffers from the presence of multiple local minima which local search algorithms usually fail to avoid. To meet this shortcoming, four relatively new global optimization methods are presented and tested for their abilities to calibrate the Modified Bartlett-Lewis Model (MBL. The list of tested methods consists of: the Downhill Simplex Method (DSM, Simplex-Simulated Annealing (SIMPSA, Particle Swarm Optimization (PSO and Shuffled Complex Evolution (SCE-UA. The parameters of these algorithms are first optimized to ensure optimal performance, after which they are used for calibration of the MBL model. Furthermore, this paper addresses the issue of subjectivity in the choice of weights in the objective function. Three alternative weighing methods are compared to determine whether or not simulation results (obtained after calibration with the best optimization method are influenced by the choice of weights.
METAHEURISTIC OPTIMIZATION METHODS FOR PARAMETERS ESTIMATION OF DYNAMIC SYSTEMS
V. Panteleev Andrei
2017-01-01
Full Text Available The article considers the usage of metaheuristic methods of constrained global optimization: “Big Bang - Big Crunch”, “Fireworks Algorithm”, “Grenade Explosion Method” in parameters of dynamic systems estimation, described with algebraic-differential equations. Parameters estimation is based upon the observation results from mathematical model behavior. Their values are derived after criterion minimization, which describes the total squared error of state vector coordinates from the deduced ones with precise values observation at different periods of time. Paral- lelepiped type restriction is imposed on the parameters values. Used for solving problems, metaheuristic methods of constrained global extremum don’t guarantee the result, but allow to get a solution of a rather good quality in accepta- ble amount of time. The algorithm of using metaheuristic methods is given. Alongside with the obvious methods for solving algebraic-differential equation systems, it is convenient to use implicit methods for solving ordinary differen- tial equation systems. Two ways of solving the problem of parameters evaluation are given, those parameters differ in their mathematical model. In the first example, a linear mathematical model describes the chemical action parameters change, and in the second one, a nonlinear mathematical model describes predator-prey dynamics, which characterize the changes in both kinds’ population. For each of the observed examples there are calculation results from all the three methods of optimization, there are also some recommendations for how to choose methods parameters. The obtained numerical results have demonstrated the efficiency of the proposed approach. The deduced parameters ap- proximate points slightly differ from the best known solutions, which were deduced differently. To refine the results one should apply hybrid schemes that combine classical methods of optimization of zero, first and second orders and
On the wavelet optimized finite difference method
Jameson, Leland
1994-01-01
When one considers the effect in the physical space, Daubechies-based wavelet methods are equivalent to finite difference methods with grid refinement in regions of the domain where small scale structure exists. Adding a wavelet basis function at a given scale and location where one has a correspondingly large wavelet coefficient is, essentially, equivalent to adding a grid point, or two, at the same location and at a grid density which corresponds to the wavelet scale. This paper introduces a wavelet optimized finite difference method which is equivalent to a wavelet method in its multiresolution approach but which does not suffer from difficulties with nonlinear terms and boundary conditions, since all calculations are done in the physical space. With this method one can obtain an arbitrarily good approximation to a conservative difference method for solving nonlinear conservation laws.
SU-E-J-130: Automating Liver Segmentation Via Combined Global and Local Optimization
Li, Dengwang; Wang, Jie [College of Physics and Electronics, Shandong Normal University, Jinan, Shandong (China); Kapp, Daniel S.; Xing, Lei [Department of Radiation Oncology, Stanford University School of Medicine, Stanford, CA (United States)
2015-06-15
Purpose: The aim of this work is to develop a robust algorithm for accurate segmentation of liver with special attention paid to the problems with fuzzy edges and tumor. Methods: 200 CT images were collected from radiotherapy treatment planning system. 150 datasets are selected as the panel data for shape dictionary and parameters estimation. The remaining 50 datasets were used as test images. In our study liver segmentation was formulated as optimization process of implicit function. The liver region was optimized via local and global optimization during iterations. Our method consists five steps: 1)The livers from the panel data were segmented manually by physicians, and then We estimated the parameters of GMM (Gaussian mixture model) and MRF (Markov random field). Shape dictionary was built by utilizing the 3D liver shapes. 2)The outlines of chest and abdomen were located according to rib structure in the input images, and the liver region was initialized based on GMM. 3)The liver shape for each 2D slice was adjusted using MRF within the neighborhood of liver edge for local optimization. 4)The 3D liver shape was corrected by employing SSR (sparse shape representation) based on liver shape dictionary for global optimization. Furthermore, H-PSO(Hybrid Particle Swarm Optimization) was employed to solve the SSR equation. 5)The corrected 3D liver was divided into 2D slices as input data of the third step. The iteration was repeated within the local optimization and global optimization until it satisfied the suspension conditions (maximum iterations and changing rate). Results: The experiments indicated that our method performed well even for the CT images with fuzzy edge and tumors. Comparing with physician delineated results, the segmentation accuracy with the 50 test datasets (VOE, volume overlap percentage) was on average 91%–95%. Conclusion: The proposed automatic segmentation method provides a sensible technique for segmentation of CT images. This work is
Layout optimization with algebraic multigrid methods
Regler, Hans; Ruede, Ulrich
1993-01-01
Finding the optimal position for the individual cells (also called functional modules) on the chip surface is an important and difficult step in the design of integrated circuits. This paper deals with the problem of relative placement, that is the minimization of a quadratic functional with a large, sparse, positive definite system matrix. The basic optimization problem must be augmented by constraints to inhibit solutions where cells overlap. Besides classical iterative methods, based on conjugate gradients (CG), we show that algebraic multigrid methods (AMG) provide an interesting alternative. For moderately sized examples with about 10000 cells, AMG is already competitive with CG and is expected to be superior for larger problems. Besides the classical 'multiplicative' AMG algorithm where the levels are visited sequentially, we propose an 'additive' variant of AMG where levels may be treated in parallel and that is suitable as a preconditioner in the CG algorithm.
Reduced basis method for source mask optimization
Pomplun, J; Burger, S; Schmidt, F; Tyminski, J; Flagello, D; Toshiharu, N; 10.1117/12.866101
2010-01-01
Image modeling and simulation are critical to extending the limits of leading edge lithography technologies used for IC making. Simultaneous source mask optimization (SMO) has become an important objective in the field of computational lithography. SMO is considered essential to extending immersion lithography beyond the 45nm node. However, SMO is computationally extremely challenging and time-consuming. The key challenges are due to run time vs. accuracy tradeoffs of the imaging models used for the computational lithography. We present a new technique to be incorporated in the SMO flow. This new approach is based on the reduced basis method (RBM) applied to the simulation of light transmission through the lithography masks. It provides a rigorous approximation to the exact lithographical problem, based on fully vectorial Maxwell's equations. Using the reduced basis method, the optimization process is divided into an offline and an online steps. In the offline step, a RBM model with variable geometrical param...
Adiabatic optimization versus diffusion Monte Carlo methods
Jarret, Michael; Jordan, Stephen P.; Lackey, Brad
2016-10-01
Most experimental and theoretical studies of adiabatic optimization use stoquastic Hamiltonians, whose ground states are expressible using only real nonnegative amplitudes. This raises a question as to whether classical Monte Carlo methods can simulate stoquastic adiabatic algorithms with polynomial overhead. Here we analyze diffusion Monte Carlo algorithms. We argue that, based on differences between L1 and L2 normalized states, these algorithms suffer from certain obstructions preventing them from efficiently simulating stoquastic adiabatic evolution in generality. In practice however, we obtain good performance by introducing a method that we call Substochastic Monte Carlo. In fact, our simulations are good classical optimization algorithms in their own right, competitive with the best previously known heuristic solvers for MAX-k -SAT at k =2 ,3 ,4 .
Yamaleev, N. K.; Diskin, B.; Nielsen, E. J.
2009-01-01
.We study local-in-time adjoint-based methods for minimization of ow matching functionals subject to the 2-D unsteady compressible Euler equations. The key idea of the local-in-time method is to construct a very accurate approximation of the global-in-time adjoint equations and the corresponding sensitivity derivative by using only local information available on each time subinterval. In contrast to conventional time-dependent adjoint-based optimization methods which require backward-in-time integration of the adjoint equations over the entire time interval, the local-in-time method solves local adjoint equations sequentially over each time subinterval. Since each subinterval contains relatively few time steps, the storage cost of the local-in-time method is much lower than that of the global adjoint formulation, thus making the time-dependent optimization feasible for practical applications. The paper presents a detailed comparison of the local- and global-in-time adjoint-based methods for minimization of a tracking functional governed by the Euler equations describing the ow around a circular bump. Our numerical results show that the local-in-time method converges to the same optimal solution obtained with the global counterpart, while drastically reducing the memory cost as compared to the global-in-time adjoint formulation.
Decision-Theoretic Methods in Simulation Optimization
2014-09-24
Materiel Command REPORT DOCUMENTATION PAGE Form Approved OMB No. 0704-0188 Public reporting burden for this collection of information is...Alamos National Lab: Frazier visited LANL , hosted by Frank Alexander, in January 2013, where he discussed the use of simulation optimization methods for...Alexander, Turab Lookman, and others from LANL , at the Materials Informatics Workshop at the Sante Fe Institute in April 2013. In February 2014, Frazier
Lifecycle-Based Swarm Optimization Method for Numerical Optimization
Hai Shen
2014-01-01
Full Text Available Bioinspired optimization algorithms have been widely used to solve various scientific and engineering problems. Inspired by biological lifecycle, this paper presents a novel optimization algorithm called lifecycle-based swarm optimization (LSO. Biological lifecycle includes four stages: birth, growth, reproduction, and death. With this process, even though individual organism died, the species will not perish. Furthermore, species will have stronger ability of adaptation to the environment and achieve perfect evolution. LSO simulates Biological lifecycle process through six optimization operators: chemotactic, assimilation, transposition, crossover, selection, and mutation. In addition, the spatial distribution of initialization population meets clumped distribution. Experiments were conducted on unconstrained benchmark optimization problems and mechanical design optimization problems. Unconstrained benchmark problems include both unimodal and multimodal cases the demonstration of the optimal performance and stability, and the mechanical design problem was tested for algorithm practicability. The results demonstrate remarkable performance of the LSO algorithm on all chosen benchmark functions when compared to several successful optimization techniques.
portfolio optimization based on nonparametric estimation methods
mahsa ghandehari
2017-03-01
Full Text Available One of the major issues investors are facing with in capital markets is decision making about select an appropriate stock exchange for investing and selecting an optimal portfolio. This process is done through the risk and expected return assessment. On the other hand in portfolio selection problem if the assets expected returns are normally distributed, variance and standard deviation are used as a risk measure. But, the expected returns on assets are not necessarily normal and sometimes have dramatic differences from normal distribution. This paper with the introduction of conditional value at risk ( CVaR, as a measure of risk in a nonparametric framework, for a given expected return, offers the optimal portfolio and this method is compared with the linear programming method. The data used in this study consists of monthly returns of 15 companies selected from the top 50 companies in Tehran Stock Exchange during the winter of 1392 which is considered from April of 1388 to June of 1393. The results of this study show the superiority of nonparametric method over the linear programming method and the nonparametric method is much faster than the linear programming method.
Optimized Vertex Method and Hybrid Reliability
Smith, Steven A.; Krishnamurthy, T.; Mason, B. H.
2002-01-01
A method of calculating the fuzzy response of a system is presented. This method, called the Optimized Vertex Method (OVM), is based upon the vertex method but requires considerably fewer function evaluations. The method is demonstrated by calculating the response membership function of strain-energy release rate for a bonded joint with a crack. The possibility of failure of the bonded joint was determined over a range of loads. After completing the possibilistic analysis, the possibilistic (fuzzy) membership functions were transformed to probability density functions and the probability of failure of the bonded joint was calculated. This approach is called a possibility-based hybrid reliability assessment. The possibility and probability of failure are presented and compared to a Monte Carlo Simulation (MCS) of the bonded joint.
Swarm Optimization Methods in Microwave Imaging
Andrea Randazzo
2012-01-01
Full Text Available Swarm intelligence denotes a class of new stochastic algorithms inspired by the collective social behavior of natural entities (e.g., birds, ants, etc.. Such approaches have been proven to be quite effective in several applicative fields, ranging from intelligent routing to image processing. In the last years, they have also been successfully applied in electromagnetics, especially for antenna synthesis, component design, and microwave imaging. In this paper, the application of swarm optimization methods to microwave imaging is discussed, and some recent imaging approaches based on such methods are critically reviewed.
A conjugate gradient method with descent direction for unconstrained optimization
Yuan, Gonglin; Lu, Xiwen; Wei, Zengxin
2009-11-01
A modified conjugate gradient method is presented for solving unconstrained optimization problems, which possesses the following properties: (i) The sufficient descent property is satisfied without any line search; (ii) The search direction will be in a trust region automatically; (iii) The Zoutendijk condition holds for the Wolfe-Powell line search technique; (iv) This method inherits an important property of the well-known Polak-Ribière-Polyak (PRP) method: the tendency to turn towards the steepest descent direction if a small step is generated away from the solution, preventing a sequence of tiny steps from happening. The global convergence and the linearly convergent rate of the given method are established. Numerical results show that this method is interesting.
Models and Methods for Structural Topology Optimization with Discrete Design Variables
Stolpe, Mathias
Structural topology optimization is a multi-disciplinary research field covering optimal design of load carrying mechanical structures such as bridges, airplanes, wind turbines, cars, etc. Topology optimization is a collection of theory, mathematical models, and numerical methods and is often used...... such as bridges, airplanes, wind turbines, cars, etc. Topology optimization is a collection of theory, mathematical models, and numerical methods and is often used in the conceptual design phase to find innovative designs. The strength of topology optimization is the capability of determining both the optimal...... methods. The methods are often based on the concept of divide-and-conquer. Despite the proposed theoretical and numerical advances, this thesis clearly indicates that solving large-scale structural topology optimization problems with discrete design variables to proven global optimality is currently...
Annealing evolutionary stochastic approximation Monte Carlo for global optimization
Liang, Faming
2010-04-08
In this paper, we propose a new algorithm, the so-called annealing evolutionary stochastic approximation Monte Carlo (AESAMC) algorithm as a general optimization technique, and study its convergence. AESAMC possesses a self-adjusting mechanism, whose target distribution can be adapted at each iteration according to the current samples. Thus, AESAMC falls into the class of adaptive Monte Carlo methods. This mechanism also makes AESAMC less trapped by local energy minima than nonadaptive MCMC algorithms. Under mild conditions, we show that AESAMC can converge weakly toward a neighboring set of global minima in the space of energy. AESAMC is tested on multiple optimization problems. The numerical results indicate that AESAMC can potentially outperform simulated annealing, the genetic algorithm, annealing stochastic approximation Monte Carlo, and some other metaheuristics in function optimization. © 2010 Springer Science+Business Media, LLC.
M.A. Ali
2015-06-01
Full Text Available This study presents a new multi-objective approach for optimal placement of Static Compensator (STATCOM for global (overall voltage sag mitigation as well as for power system performance improvement. The problem is formulated as a non linear constrained multi-objective optimization problem and solved using Genetic Algorithm (GA. The proposed method determines optimal locations of STATCOMs which simultaneously minimizes the overall voltage sags at network buses, bus voltage deviation and system real power loss and maximizes the voltage stability margin of the system. The proposed approach has been applied on IEEE 24-bus Reliability Test System (RTS and IEEE 57-bus test systems. The details of implementation and simulation results are presented. The application results are promising and encouraging.
Sun Qingying
2005-01-01
In this paper, a new class of three term memory gradient method with nonmonotone line search technique for unconstrained optimization is presented. Global convergence properties of the new methods are discussed. Combining the quasi-Newton method with the new method, the former is modified to have global convergence property. Numerical results show that the new algorithm is efficient.
A ROBUST SQP METHOD FOR OPTIMIZATION WITH INEQUALITY CONSTRAINTS
Juliang Zhang; Xiangsun Zhang
2003-01-01
A new algorithm for inequality constrained optimization is presented, which solves a linear programming subproblem and a quadratic subproblem at each iteration. The algorithm can circumvent the difficulties associated with the possible inconsistency of QP subproblem of the original SQP method. Moreover, the algorithm can converge to a point which satisfies a certain first-order necessary condition even if the original problem is itself infeasible. Under certain condition, some global convergence results are proved and local superlinear convergence results are also obtained. Preliminary numerical results are reported.
Adaptive nonmonotone line search method for unconstrained optimization
Qunyan ZHOU; Wenyu SUN
2008-01-01
In this paper, an adaptive nonmonotone line search method for unconstrained minimization problems is proposed. At every iteration, the new algorithm selects only one of the two directions: a Newton-type direc-tion and a negative curvature direction, to perform the line search. The nonmonotone technique is included in the backtracking line search when the Newton-type direction is the search direction. Furthermore, if the negative curvature direction is the search direction, we increase the steplength un-der certain conditions. The global convergence to a stationary point with second-order optimality conditions is established. Some numerical results which show the efficiency of the new algorithm are reported.
Phenology as a strategy for carbon optimality: a global model
S. Caldararu
2013-09-01
Full Text Available Phenology is essential to our understanding of biogeochemical cycles and the climate system. We develop a global mechanistic model of leaf phenology based on the hypothesis that phenology is a strategy for optimal carbon gain at the canopy level so that trees adjust leaf gains and losses in response to environmental factors such as light, temperature and soil moisture, to achieve maximum carbon assimilation. We fit this model to five years of satellite observations of leaf area index (LAI using a Bayesian fitting algorithm. We show that our model is able to reproduce phenological patterns for all vegetation types and use it to explore variations in growing season length and the climate factors that limit leaf growth for different biomes. Phenology in wet tropical areas is limited by leaf age physiological constraints while at higher latitude leaf seasonality is limited by low temperature and light availability. Leaf growth in grassland regions is limited by water availability but often in combination with other factors. This model will advance the current understanding of phenology for ecosystem carbon models and our ability to predict future phenological behaviour.
Binary discrete method of topology optimization
MEI Yu-lin; WANG Xiao-ming; CHENG Geng-dong
2007-01-01
The numerical non-stability of a discrete algorithm of topology optimization can result from the inaccurate evaluation of element sensitivities. Especially, when material is added to elements, the estimation of element sensitivities is very inaccurate,even their signs are also estimated wrong. In order to overcome the problem, a new incremental sensitivity analysis formula is constructed based on the perturbation analysis of the elastic equilibrium increment equation, which can provide us a good estimate of the change of the objective function whether material is removed from or added to elements,meanwhile it can also be considered as the conventional sensitivity formula modified by a non-local element stiffness matrix. As a consequence, a binary discrete method of topology optimization is established, in which each element is assigned either a stiffness value of solid material or a small value indicating no material, and the optimization process can remove material from elements or add material to elements so as to make the objective function decrease. And a main advantage of the method is simple and no need of much mathematics, particularly interesting in engineering application.
Darup, Moritz Schulze; Mross, Stefan; Mönnigmann, Martin
2012-01-01
We compare two established and a new method for the calculation of spectral bounds for Hessian matrices on hyperrectangles by applying them to a large collection of 1522 objective and constraint functions extracted from benchmark global optimization problems. Both the tightness of the spectral bounds and the computational effort are assessed. Specifically, we compare eigenvalue bounds obtained with the interval variant of Gershgorin's circle criterion [2,6], Hertz and Rohn's [7,16] method for tight bounds of interval matrices, and a recently proposed Hessian matrix eigenvalue arithmetic [12], which deliberately avoids the computation of interval Hessians.
METHODS OF INTEGRATED OPTIMIZATION MAGLEV TRANSPORT SYSTEMS
A. Lasher
2013-09-01
example, this research proved the sustainability of the proposed integrated optimization parameters of transport systems. This approach could be applied not only for MTS, but also for other transport systems. Originality. The bases of the complex optimization of transport presented are the new system of universal scientific methods and approaches that ensure high accuracy and authenticity of calculations with the simulation of transport systems and transport networks taking into account the dynamics of their development. Practical value. The development of the theoretical and technological bases of conducting the complex optimization of transport makes it possible to create the scientific tool, which ensures the fulfillment of the automated simulation and calculating of technical and economic structure and technology of the work of different objects of transport, including its infrastructure.
Automatic 3D liver segmentation based on deep learning and globally optimized surface evolution
Hu, Peijun; Wu, Fa; Peng, Jialin; Liang, Ping; Kong, Dexing
2016-12-01
The detection and delineation of the liver from abdominal 3D computed tomography (CT) images are fundamental tasks in computer-assisted liver surgery planning. However, automatic and accurate segmentation, especially liver detection, remains challenging due to complex backgrounds, ambiguous boundaries, heterogeneous appearances and highly varied shapes of the liver. To address these difficulties, we propose an automatic segmentation framework based on 3D convolutional neural network (CNN) and globally optimized surface evolution. First, a deep 3D CNN is trained to learn a subject-specific probability map of the liver, which gives the initial surface and acts as a shape prior in the following segmentation step. Then, both global and local appearance information from the prior segmentation are adaptively incorporated into a segmentation model, which is globally optimized in a surface evolution way. The proposed method has been validated on 42 CT images from the public Sliver07 database and local hospitals. On the Sliver07 online testing set, the proposed method can achieve an overall score of 80.3+/- 4.5 , yielding a mean Dice similarity coefficient of 97.25+/- 0.65 % , and an average symmetric surface distance of 0.84+/- 0.25 mm. The quantitative validations and comparisons show that the proposed method is accurate and effective for clinical application.
Comparison of global optimization approaches for robust calibration of hydrologic model parameters
Jung, I. W.
2015-12-01
Robustness of the calibrated parameters of hydrologic models is necessary to provide a reliable prediction of future performance of watershed behavior under varying climate conditions. This study investigated calibration performances according to the length of calibration period, objective functions, hydrologic model structures and optimization methods. To do this, the combination of three global optimization methods (i.e. SCE-UA, Micro-GA, and DREAM) and four hydrologic models (i.e. SAC-SMA, GR4J, HBV, and PRMS) was tested with different calibration periods and objective functions. Our results showed that three global optimization methods provided close calibration performances under different calibration periods, objective functions, and hydrologic models. However, using the agreement of index, normalized root mean square error, Nash-Sutcliffe efficiency as the objective function showed better performance than using correlation coefficient and percent bias. Calibration performances according to different calibration periods from one year to seven years were hard to generalize because four hydrologic models have different levels of complexity and different years have different information content of hydrological observation. Acknowledgements This research was supported by a grant (14AWMP-B082564-01) from Advanced Water Management Research Program funded by Ministry of Land, Infrastructure and Transport of Korean government.
Methods for Distributed Optimal Energy Management
Brehm, Robert
The presented research deals with the fundamental underlying methods and concepts of how the growing number of distributed generation units based on renewable energy resources and distributed storage devices can be most efficiently integrated into the existing utility grid. In contrast to convent......The presented research deals with the fundamental underlying methods and concepts of how the growing number of distributed generation units based on renewable energy resources and distributed storage devices can be most efficiently integrated into the existing utility grid. In contrast...... to conventional centralised optimal energy flow management systems, here-in, focus is set on how optimal energy management can be achieved in a decentralised distributed architecture such as a multi-agent system. Distributed optimisation methods are introduced, targeting optimisation of energy flow in virtual...... micro-grids by prevention of meteorologic power flows into high voltage grids. A method, based on mathematical optimisation and a consensus algorithm is introduced and evaluated to coordinate charge/discharge scheduling for batteries between a number of buildings in order to improve self...
Zhang, Songchuan; Xia, Youshen
2016-12-28
Much research has been devoted to complex-variable optimization problems due to their engineering applications. However, the complex-valued optimization method for solving complex-variable optimization problems is still an active research area. This paper proposes two efficient complex-valued optimization methods for solving constrained nonlinear optimization problems of real functions in complex variables, respectively. One solves the complex-valued nonlinear programming problem with linear equality constraints. Another solves the complex-valued nonlinear programming problem with both linear equality constraints and an ℓ₁-norm constraint. Theoretically, we prove the global convergence of the proposed two complex-valued optimization algorithms under mild conditions. The proposed two algorithms can solve the complex-valued optimization problem completely in the complex domain and significantly extend existing complex-valued optimization algorithms. Numerical results further show that the proposed two algorithms have a faster speed than several conventional real-valued optimization algorithms.
Carlos Pozo
Full Text Available Optimization models in metabolic engineering and systems biology focus typically on optimizing a unique criterion, usually the synthesis rate of a metabolite of interest or the rate of growth. Connectivity and non-linear regulatory effects, however, make it necessary to consider multiple objectives in order to identify useful strategies that balance out different metabolic issues. This is a fundamental aspect, as optimization of maximum yield in a given condition may involve unrealistic values in other key processes. Due to the difficulties associated with detailed non-linear models, analysis using stoichiometric descriptions and linear optimization methods have become rather popular in systems biology. However, despite being useful, these approaches fail in capturing the intrinsic nonlinear nature of the underlying metabolic systems and the regulatory signals involved. Targeting more complex biological systems requires the application of global optimization methods to non-linear representations. In this work we address the multi-objective global optimization of metabolic networks that are described by a special class of models based on the power-law formalism: the generalized mass action (GMA representation. Our goal is to develop global optimization methods capable of efficiently dealing with several biological criteria simultaneously. In order to overcome the numerical difficulties of dealing with multiple criteria in the optimization, we propose a heuristic approach based on the epsilon constraint method that reduces the computational burden of generating a set of Pareto optimal alternatives, each achieving a unique combination of objectives values. To facilitate the post-optimal analysis of these solutions and narrow down their number prior to being tested in the laboratory, we explore the use of Pareto filters that identify the preferred subset of enzymatic profiles. We demonstrate the usefulness of our approach by means of a case study
Pozo, Carlos; Guillén-Gosálbez, Gonzalo; Sorribas, Albert; Jiménez, Laureano
2012-01-01
Optimization models in metabolic engineering and systems biology focus typically on optimizing a unique criterion, usually the synthesis rate of a metabolite of interest or the rate of growth. Connectivity and non-linear regulatory effects, however, make it necessary to consider multiple objectives in order to identify useful strategies that balance out different metabolic issues. This is a fundamental aspect, as optimization of maximum yield in a given condition may involve unrealistic values in other key processes. Due to the difficulties associated with detailed non-linear models, analysis using stoichiometric descriptions and linear optimization methods have become rather popular in systems biology. However, despite being useful, these approaches fail in capturing the intrinsic nonlinear nature of the underlying metabolic systems and the regulatory signals involved. Targeting more complex biological systems requires the application of global optimization methods to non-linear representations. In this work we address the multi-objective global optimization of metabolic networks that are described by a special class of models based on the power-law formalism: the generalized mass action (GMA) representation. Our goal is to develop global optimization methods capable of efficiently dealing with several biological criteria simultaneously. In order to overcome the numerical difficulties of dealing with multiple criteria in the optimization, we propose a heuristic approach based on the epsilon constraint method that reduces the computational burden of generating a set of Pareto optimal alternatives, each achieving a unique combination of objectives values. To facilitate the post-optimal analysis of these solutions and narrow down their number prior to being tested in the laboratory, we explore the use of Pareto filters that identify the preferred subset of enzymatic profiles. We demonstrate the usefulness of our approach by means of a case study that optimizes the
杨璐鸿; 刘顺安; 张冠宇; 王春雪
2015-01-01
To improve the operational efficiency of global optimization in engineering, Kriging model was established to simplify the mathematical model for calculations. Ducted coaxial-rotors aircraft was taken as an example and Fluent software was applied to the virtual prototype simulations. Through simulation sample points, the total lift of the ducted coaxial-rotors aircraft was obtained. The Kriging model was then constructed, and the function was fitted. Improved particle swarm optimization (PSO) was also utilized for the global optimization of the Kriging model of the ducted coaxial-rotors aircraft for the determination of optimized global coordinates. Finally, the optimized results were simulated by Fluent. The results show that the Kriging model and the improved PSO algorithm significantly improve the lift performance of ducted coaxial-rotors aircraft and computer operational efficiency.
Aijun Zhu; Chuanpei Xu; Zhi Li; Jun Wu; Zhenbing Liu
2015-01-01
A new meta-heuristic method is proposed to enhance current meta-heuristic methods for global optimization and test scheduling for three-dimensional (3D) stacked system-on-chip (SoC) by hybridizing grey wolf optimization with differential evo-lution (HGWO). Because basic grey wolf optimization (GWO) is easy to fal into stagnation when it carries out the operation of at-tacking prey, and differential evolution (DE) is integrated into GWO to update the previous best position of grey wolf Alpha, Beta and Delta, in order to force GWO to jump out of the stagnation with DE’s strong searching ability. The proposed algorithm can accele-rate the convergence speed of GWO and improve its performance. Twenty-three wel-known benchmark functions and an NP hard problem of test scheduling for 3D SoC are employed to verify the performance of the proposed algorithm. Experimental results show the superior performance of the proposed algorithm for exploiting the optimum and it has advantages in terms of exploration.
Hong Xia YIN; Dong Lei DU
2007-01-01
The self-scaling quasi-Newton method solves an unconstrained optimization problem by scaling the Hessian approximation matrix before it is updated at each iteration to avoid the possible large eigenvalues in the Hessian approximation matrices of the objective function. It has been proved in the literature that this method has the global and superlinear convergence when the objective function is convex (or even uniformly convex). We propose to solve unconstrained nonconvex optimization problems by a self-scaling BFGS algorithm with nonmonotone linear search. Nonmonotone line search has been recognized in numerical practices as a competitive approach for solving large-scale nonlinear problems. We consider two different nonmonotone line search forms and study the global convergence of these nonmonotone self-scale BFGS algorithms. We prove that, under some weaker condition than that in the literature, both forms of the self-scaling BFGS algorithm are globally convergent for unconstrained nonconvex optimization problems.
PRODUCT OPTIMIZATION METHOD BASED ON ANALYSIS OF OPTIMAL VALUES OF THEIR CHARACTERISTICS
Constantin D. STANESCU
2016-05-01
Full Text Available The paper presents an original method of optimizing products based on the analysis of optimal values of their characteristics . Optimization method comprises statistical model and analytical model . With this original method can easily and quickly obtain optimal product or material .
Optimal Variational Method for Truly Nonlinear Oscillators
Vasile Marinca
2013-01-01
Full Text Available The Optimal Variational Method (OVM is introduced and applied for calculating approximate periodic solutions of “truly nonlinear oscillators”. The main advantage of this procedure consists in that it provides a convenient way to control the convergence of approximate solutions in a very rigorous way and allows adjustment of convergence regions where necessary. This approach does not depend upon any small or large parameters. A very good agreement was found between approximate and numerical solution, which proves that OVM is very efficient and accurate.
Method for optimizing harvesting of crops
2010-01-01
In order e.g. to optimize harvesting crops of the kind which may be self dried on a field prior to a harvesting step (116, 118), there is disclosed a method of providing a mobile unit (102) for working (114, 116, 118) the field with crops, equipping the mobile unit (102) with crop biomass measuring...... moving the mobile unit on the field and the moisture content (109a, 109b), and determining an optimised drying time (104a, 104b) prior to the following harvesting step (116, 118) in response to the spatial crop biomass and crop moisture content characteristics map and in response to a weather forecast...
Circular SAR Optimization Imaging Method of Buildings
Wang Jian-feng
2015-12-01
Full Text Available The Circular Synthetic Aperture Radar (CSAR can obtain the entire scattering properties of targets because of its great ability of 360° observation. In this study, an optimal orientation of the CSAR imaging algorithm of buildings is proposed by applying a combination of coherent and incoherent processing techniques. FEKO software is used to construct the electromagnetic scattering modes and simulate the radar echo. The FEKO imaging results are compared with the isotropic scattering results. On comparison, the optimal azimuth coherent accumulation angle of CSAR imaging of buildings is obtained. Practically, the scattering directions of buildings are unknown; therefore, we divide the 360° echo of CSAR into many overlapped and few angle echoes corresponding to the sub-aperture and then perform an imaging procedure on each sub-aperture. Sub-aperture imaging results are applied to obtain the all-around image using incoherent fusion techniques. The polarimetry decomposition method is used to decompose the all-around image and further retrieve the edge information of buildings successfully. The proposed method is validated with P-band airborne CSAR data from Sichuan, China.
Optimization methods for activities selection problems
Mahad, Nor Faradilah; Alias, Suriana; Yaakop, Siti Zulaika; Arshad, Norul Amanina Mohd; Mazni, Elis Sofia
2017-08-01
Co-curriculum activities must be joined by every student in Malaysia and these activities bring a lot of benefits to the students. By joining these activities, the students can learn about the time management and they can developing many useful skills. This project focuses on the selection of co-curriculum activities in secondary school using the optimization methods which are the Analytic Hierarchy Process (AHP) and Zero-One Goal Programming (ZOGP). A secondary school in Negeri Sembilan, Malaysia was chosen as a case study. A set of questionnaires were distributed randomly to calculate the weighted for each activity based on the 3 chosen criteria which are soft skills, interesting activities and performances. The weighted was calculated by using AHP and the results showed that the most important criteria is soft skills. Then, the ZOGP model will be analyzed by using LINGO Software version 15.0. There are two priorities to be considered. The first priority which is to minimize the budget for the activities is achieved since the total budget can be reduced by RM233.00. Therefore, the total budget to implement the selected activities is RM11,195.00. The second priority which is to select the co-curriculum activities is also achieved. The results showed that 9 out of 15 activities were selected. Thus, it can concluded that AHP and ZOGP approach can be used as the optimization methods for activities selection problem.
Design of large Francis turbine using optimal methods
Flores, E.; Bornard, L.; Tomas, L.; Liu, J.; Couston, M.
2012-11-01
Among a high number of Francis turbine references all over the world, covering the whole market range of heads, Alstom has especially been involved in the development and equipment of the largest power plants in the world : Three Gorges (China -32×767 MW - 61 to 113 m), Itaipu (Brazil- 20x750 MW - 98.7m to 127m) and Xiangjiaba (China - 8x812 MW - 82.5m to 113.6m - in erection). Many new projects are under study to equip new power plants with Francis turbines in order to answer an increasing demand of renewable energy. In this context, Alstom Hydro is carrying out many developments to answer those needs, especially for jumbo units such the planned 1GW type units in China. The turbine design for such units requires specific care by using the state of the art in computation methods and the latest technologies in model testing as well as the maximum feedback from operation of Jumbo plants already in operation. We present in this paper how a large Francis turbine can be designed using specific design methods, including the global and local optimization methods. The design of the spiral case, the tandem cascade profiles, the runner and the draft tube are designed with optimization loops involving a blade design tool, an automatic meshing software and a Navier-Stokes solver, piloted by a genetic algorithm. These automated optimization methods, presented in different papers over the last decade, are nowadays widely used, thanks to the growing computation capacity of the HPC clusters: the intensive use of such optimization methods at the turbine design stage allows to reach very high level of performances, while the hydraulic flow characteristics are carefully studied over the whole water passage to avoid any unexpected hydraulic phenomena.
Computational methods applied to wind tunnel optimization
Lindsay, David
This report describes computational methods developed for optimizing the nozzle of a three-dimensional subsonic wind tunnel. This requires determination of a shape that delivers flow to the test section, typically with a speed increase of 7 or more and a velocity uniformity of .25% or better, in a compact length without introducing boundary layer separation. The need for high precision, smooth solutions, and three-dimensional modeling required the development of special computational techniques. These include: (1) alternative formulations to Neumann and Dirichlet boundary conditions, to deal with overspecified, ill-posed, or cyclic problems, and to reduce the discrepancy between numerical solutions and boundary conditions; (2) modification of the Finite Element Method to obtain solutions with numerically exact conservation properties; (3) a Matlab implementation of general degree Finite Element solvers for various element designs in two and three dimensions, exploiting vector indexing to obtain optimal efficiency; (4) derivation of optimal quadrature formulas for integration over simplexes in two and three dimensions, and development of a program for semi-automated generation of formulas for any degree and dimension; (5) a modification of a two-dimensional boundary layer formulation to provide accurate flow conservation in three dimensions, and modification of the algorithm to improve stability; (6) development of multi-dimensional spline functions to achieve smoother solutions in three dimensions by post-processing, new three-dimensional elements for C1 basis functions, and a program to assist in the design of elements with higher continuity; and (7) a development of ellipsoidal harmonics and Lame's equation, with generalization to any dimension and a demonstration that Cartesian, cylindrical, spherical, spheroidal, and sphero-conical harmonics are all limiting cases. The report includes a description of the Finite Difference, Finite Volume, and domain remapping
WANG Hui; WU Di; AGOULMINE Nazim; MA Mao-de
2009-01-01
The multi-source and single-sink (MSSS) topology in wireless sensor networks (WSNs) is defined as a network topology, where all of nodes can gather, receive and transmit data to the sink. In energy-constrained WSNs with such a topology, the joint optimal design in the physical, medium access control (MAC) and network layers is considered for network lifetime maximization (NLM). The problem of integrating multi-layer information to compute NLM, which involves routing flow, link schedule and transmission power, is formulated as a non-linear optimization problem. Specially under time division multiple access (TDMA) scheme, this problem can be transformed into a convex optimization problem. To solve it analytically we make use of the property that local optimization is global optimization in convex problem. This allows us to exploit the Karush-Kuhn-Tucker (KKT) optimality conditions to solve it and obtain analytical solution expression, i.e., the globally optimal network lifetime (NL). NL is derived as a function of number of nodes, their initial energy and data rate arrived at them.Based on the analysis of analytical approach, it takes the influence of data rates, link access and routing method over NLM into account. Moreover, the globally optimal transmission schemes are achieved by solution set during analytical approach and applied to algorithms in TDMA-based WSNs aiming at NLM on OMNeT to compare with other suboptimal schemes.
Global invariant methods for object recognition
Stiller, Peter F.
2001-11-01
certain Schubert varieties in the Grassmannian. We call this approach the global invariant approach. It greatly increases the robustness and numerical stability of the methods. This approach also has advantages when considering issue sin geometric computation, notably geometric hashing. Here we can exploit the natural metric on the Grassmannian to measure distances between objects and images. Our ultimate aim is the development of new algorithms for geometric content-based retrieval. Content-based retrieval of information from large-scale databases, particularly visual/geometric information contained in images, schematics, design drawings, and geometric models of environments, mechanical parts, or molecules, etc., will play an important role in future distributed information and knowledge system.
A Study of Electrical Motors Controlling Optimization Methods
Saeid Fatemi
2013-11-01
Full Text Available In order to design an efficient motor cooling system, it is important to accurately predict the power optimization which is normally dissipated in form of heat. This study presents an analytical method for estimating bearing frictional optimization and numerical method for estimating electromagnetic optimization for an electric vehicle electrical motor. The power optimization obtained use heat sources when evaluating the thermal performance of the motor. The results showed that electromagnetic optimization are dominant and contributed over 80% of all optimization, while bearing optimization contributes about 2% of the total electric motor. The results also showed that bearing optimization increase significantly with increasing speed or load.
On Best Practice Optimization Methods in R
John C. Nash
2014-09-01
Full Text Available R (R Core Team 2014 provides a powerful and flexible system for statistical computations. It has a default-install set of functionality that can be expanded by the use of several thousand add-in packages as well as user-written scripts. While R is itself a programming language, it has proven relatively easy to incorporate programs in other languages, particularly Fortran and C. Success, however, can lead to its own costs: • Users face a confusion of choice when trying to select packages in approaching a problem. • A need to maintain workable examples using early methods may mean some tools offered as a default may be dated. • In an open-source project like R, how to decide what tools offer "best practice" choices, and how to implement such a policy, present a serious challenge. We discuss these issues with reference to the tools in R for nonlinear parameter estimation (NLPE and optimization, though for the present article `optimization` will be limited to function minimization of essentially smooth functions with at most bounds constraints on the parameters. We will abbreviate this class of problems as NLPE. We believe that the concepts proposed are transferable to other classes of problems seen by R users.
3-D carotid multi-region MRI segmentation by globally optimal evolution of coupled surfaces.
Ukwatta, Eranga; Yuan, Jing; Rajchl, Martin; Qiu, Wu; Tessier, David; Fenster, Aaron
2013-04-01
In this paper, we propose a novel global optimization based 3-D multi-region segmentation algorithm for T1-weighted black-blood carotid magnetic resonance (MR) images. The proposed algorithm partitions a 3-D carotid MR image into three regions: wall, lumen, and background. The algorithm performs such partitioning by simultaneously evolving two coupled 3-D surfaces of carotid artery adventitia boundary (AB) and lumen-intima boundary (LIB) while preserving their anatomical inter-surface consistency such that the LIB is always located within the AB. In particular, we show that the proposed algorithm results in a fully time implicit scheme that propagates the two linearly ordered surfaces of the AB and LIB to their globally optimal positions during each discrete time frame by convex relaxation. In this regard, we introduce the continuous max-flow model and prove its duality/equivalence to the convex relaxed optimization problem with respect to each evolution step. We then propose a fully parallelized continuous max-flow-based algorithm, which can be readily implemented on a GPU to achieve high computational efficiency. Extensive experiments, with four users using 12 3T MR and 26 1.5T MR images, demonstrate that the proposed algorithm yields high accuracy and low operator variability in computing vessel wall volume. In addition, we show the algorithm outperforms previous methods in terms of high computational efficiency and robustness with fewer user interactions.
A Fast Hybrid Algorithm of Global Optimization for Feedforward Neural Networks
JIANG Minghu; ZHANG Bo; ZHU Xiaoyan; JINAG Mingyan
2001-01-01
This paper presents the hybrid algorithm of global optimization of dynamic learning rate for multilayer feedforward neural networks (MLFNN).The effect of inexact line search on conjugacy was studied, based on which a generalized conjugate gradient method was proposed, showing global convergence for error backpagation of MLFNN. It overcomes the drawback of conventional BP and Polak-Ribieve conjugate gradient algorithms that maybe plunge into local minima. The hybrid algorithm's recognition rate is higher than that of Polak-Ribieve algorithm and convergence BP for test data, its training time is less than that of Fletcher-Reeves algorithm and far less than that of convergence BP, and it has a less complicated and stronger robustness to real speech data.
A New Global Optimization Algorithm for Solving a Class of Nonconvex Programming Problems
Xue-Gang Zhou
2014-01-01
Full Text Available A new two-part parametric linearization technique is proposed globally to a class of nonconvex programming problems (NPP. Firstly, a two-part parametric linearization method is adopted to construct the underestimator of objective and constraint functions, by utilizing a transformation and a parametric linear upper bounding function (LUBF and a linear lower bounding function (LLBF of a natural logarithm function and an exponential function with e as the base, respectively. Then, a sequence of relaxation lower linear programming problems, which are embedded in a branch-and-bound algorithm, are derived in an initial nonconvex programming problem. The proposed algorithm is converged to global optimal solution by means of a subsequent solution to a series of linear programming problems. Finally, some examples are given to illustrate the feasibility of the presented algorithm.
Global Optimization of Low-Thrust Interplanetary Trajectories Subject to Operational Constraints
Englander, Jacob A.; Vavrina, Matthew A.; Hinckley, David
2016-01-01
Low-thrust interplanetary space missions are highly complex and there can be many locally optimal solutions. While several techniques exist to search for globally optimal solutions to low-thrust trajectory design problems, they are typically limited to unconstrained trajectories. The operational design community in turn has largely avoided using such techniques and has primarily focused on accurate constrained local optimization combined with grid searches and intuitive design processes at the expense of efficient exploration of the global design space. This work is an attempt to bridge the gap between the global optimization and operational design communities by presenting a mathematical framework for global optimization of low-thrust trajectories subject to complex constraints including the targeting of planetary landing sites, a solar range constraint to simplify the thermal design of the spacecraft, and a real-world multi-thruster electric propulsion system that must switch thrusters on and off as available power changes over the course of a mission.
Khac Duc Do
2015-01-01
This paper presents a design of optimal controllers with respect to a meaningful cost function to force an underactuated omni-directional intelligent navigator (ODIN) under unknown constant environmental loads to track a reference trajectory in two-dimensional space. Motivated by the vehicle’s steering practice, the yaw angle regarded as a virtual control plus the surge thrust force are used to force the position of the vehicle to globally track its reference trajectory. The control design is based on several recent results developed for inverse optimal control and stability analysis of nonlinear systems, a new design of bounded disturbance observers, and backstepping and Lyapunov’s direct methods. Both state- and output-feedback control designs are addressed. Simulations are included to illustrate the effectiveness of the proposed results.
Optimization of Binder Jetting Using Taguchi Method
Shrestha, Sanjay; Manogharan, Guha
2017-03-01
Among several additive manufacturing (AM) methods, binder-jetting has undergone a recent advancement in its ability to process metal powders through selective deposition of binders on a powder bed followed by curing, sintering, and infiltration. This study analyzes the impact of various process parameters in binder jetting on mechanical properties of sintered AM metal parts. The Taguchi optimization method has been employed to determine the optimum AM parameters to improve transverse rupture strength (TRS), specifically: binder saturation, layer thickness, roll speed, and feed-to-powder ratio. The effects of the selected process parameters on the TRS performance of sintered SS 316L samples are studied with the American Society of Testing Materials (ASTM) standard test method. It was found that binder saturation and feed-to-powder ratio were the most critical parameters, which reflects the strong influence of binder powder interaction and density of powder bed on resulting mechanical properties. This article serves as an aid in understanding the optimum process parameters for binder jetting of SS 316L.
Optimization of Binder Jetting Using Taguchi Method
Shrestha, Sanjay; Manogharan, Guha
2017-01-01
Among several additive manufacturing (AM) methods, binder-jetting has undergone a recent advancement in its ability to process metal powders through selective deposition of binders on a powder bed followed by curing, sintering, and infiltration. This study analyzes the impact of various process parameters in binder jetting on mechanical properties of sintered AM metal parts. The Taguchi optimization method has been employed to determine the optimum AM parameters to improve transverse rupture strength (TRS), specifically: binder saturation, layer thickness, roll speed, and feed-to-powder ratio. The effects of the selected process parameters on the TRS performance of sintered SS 316L samples are studied with the American Society of Testing Materials (ASTM) standard test method. It was found that binder saturation and feed-to-powder ratio were the most critical parameters, which reflects the strong influence of binder powder interaction and density of powder bed on resulting mechanical properties. This article serves as an aid in understanding the optimum process parameters for binder jetting of SS 316L.
Globally Optimal Path Planning with Anisotropic Running Costs
2013-03-01
Proceedings of the American Control Conference , pp...Jacques, D. R. & Pachter, M. (2002) Air vehicle optimal trajectories between two radars, in Proceedings of the American Control Conference . Pachter...M. & Hebert, J. (2001) Optimal aircraft trajectories for radar exposure mini- mization, in Proceedings of the American Control Conference .
DETERMINATION METHOD OF OPTIMAL SUPPORTING TIME IN HEADING FACE
杜长龙; 曹红波; 王燕宁; 张艳
1997-01-01
This paper has put forward a concept of optimal supporting time through analysing the influence of the supporting time in the heading face on the supporting result of surrounding rock. The method of the optimal supporting time determined by graphical method is discussed, and the calculating formula for determining the optimal supporting time through the analysis method is derived.
Design optimization method for Francis turbine
Kawajiri, H.; Enomoto, Y.; Kurosawa, S.
2014-03-01
This paper presents a design optimization system coupled CFD. Optimization algorithm of the system employs particle swarm optimization (PSO). Blade shape design is carried out in one kind of NURBS curve defined by a series of control points. The system was applied for designing the stationary vanes and the runner of higher specific speed francis turbine. As the first step, single objective optimization was performed on stay vane profile, and second step was multi-objective optimization for runner in wide operating range. As a result, it was confirmed that the design system is useful for developing of hydro turbine.
Chaotic Teaching-Learning-Based Optimization with Lévy Flight for Global Numerical Optimization
Xiangzhu He
2016-01-01
Full Text Available Recently, teaching-learning-based optimization (TLBO, as one of the emerging nature-inspired heuristic algorithms, has attracted increasing attention. In order to enhance its convergence rate and prevent it from getting stuck in local optima, a novel metaheuristic has been developed in this paper, where particular characteristics of the chaos mechanism and Lévy flight are introduced to the basic framework of TLBO. The new algorithm is tested on several large-scale nonlinear benchmark functions with different characteristics and compared with other methods. Experimental results show that the proposed algorithm outperforms other algorithms and achieves a satisfactory improvement over TLBO.
Chaotic Teaching-Learning-Based Optimization with Lévy Flight for Global Numerical Optimization.
He, Xiangzhu; Huang, Jida; Rao, Yunqing; Gao, Liang
2016-01-01
Recently, teaching-learning-based optimization (TLBO), as one of the emerging nature-inspired heuristic algorithms, has attracted increasing attention. In order to enhance its convergence rate and prevent it from getting stuck in local optima, a novel metaheuristic has been developed in this paper, where particular characteristics of the chaos mechanism and Lévy flight are introduced to the basic framework of TLBO. The new algorithm is tested on several large-scale nonlinear benchmark functions with different characteristics and compared with other methods. Experimental results show that the proposed algorithm outperforms other algorithms and achieves a satisfactory improvement over TLBO.
UNDERSTANDING OF FUZZY OPTIMIZATION:THEORIES AND METHODS
TANG Jiafu; WANG Dingwei; Richard Y K FUNG; Kai-Leung Yung
2004-01-01
A brief summary on and comprehensive understanding of fuzzy optimizationis presentedThis summary is made on aspects of fuzzy modelling and fuzzy optimization,classification and formulation for the fuzzy optimization problems, models and methods.The importance of interpretation of the problem and formulation of the optimal solutionin fuzzy sense are emphasized in the summary of the fuzzy optimization.
Numerical methods and optimization a consumer guide
Walter, Éric
2014-01-01
Initial training in pure and applied sciences tends to present problem-solving as the process of elaborating explicit closed-form solutions from basic principles, and then using these solutions in numerical applications. This approach is only applicable to very limited classes of problems that are simple enough for such closed-form solutions to exist. Unfortunately, most real-life problems are too complex to be amenable to this type of treatment. Numerical Methods and Optimization – A Consumer Guide presents methods for dealing with them. Shifting the paradigm from formal calculus to numerical computation, the text makes it possible for the reader to · discover how to escape the dictatorship of those particular cases that are simple enough to receive a closed-form solution, and thus gain the ability to solve complex, real-life problems; · understand the principles behind recognized algorithms used in state-of-the-art numerical software; · learn the advantag...
Wu Zhi-jian; Tang Zhi-long; Kang Li-shan
2003-01-01
This paper presents a parallel two level evolutionary algorithm based on domain decomposition for solving function optimization problem containing multiple solutions.By combining the characteristics of the global search and local search in each sub-domain, the former enables individual to draw closer to each optirma and keeps the diversity of individuals, while the latter selects local optimal solutions known as latent solutions in sub-domain. In the end, by selecting the global optimal solutions from latent solutions in each sub-domain, we can discover all the optimal solutions easily and quickly.
AN ADAPTIVE TRUST REGION METHOD FOR EQUALITY CONSTRAINED OPTIMIZATION
ZHANG Juliang; ZHANG Xiangsun; ZHUO Xinjian
2003-01-01
In this paper, a trust region method for equality constrained optimization based on nondifferentiable exact penalty is proposed. In this algorithm, the trail step is characterized by computation of its normal component being separated from computation of its tangential component, i.e., only the tangential component of the trail step is constrained by trust radius while the normal component and trail step itself have no constraints. The other main characteristic of the algorithm is the decision of trust region radius. Here, the decision of trust region radius uses the information of the gradient of objective function and reduced Hessian. However, Maratos effect will occur when we use the nondifferentiable exact penalty function as the merit function. In order to obtain the superlinear convergence of the algorithm, we use the twice order correction technique. Because of the speciality of the adaptive trust region method, we use twice order correction when p = 0 (the definition is as in Section 2) and this is different from the traditional trust region methods for equality constrained optimization. So the computation of the algorithm in this paper is reduced. What is more, we can prove that the algorithm is globally and superlinearly convergent.
Global/local methods research using the CSM testbed
Knight, Norman F., Jr.; Ransom, Jonathan B.; Griffin, O. Hayden, Jr.; Thompson, Danniella M.
1990-01-01
Research activities in global/local stress analysis are described including both two- and three-dimensional analysis methods. These methods are being developed within a common structural analysis framework. Representative structural analysis problems are presented to demonstrate the global/local methodologies being developed.
Global positioning system recorder and method
Hayes, D.W.; Hofstetter, K.J.; Eakle, R.F. Jr.; Reeves, G.E.
1998-12-22
A global positioning system recorder (GPSR) is disclosed in which operational parameters and recorded positional data are stored on a transferable memory element. Through this transferrable memory element, the user of the GPSR need have no knowledge of GPSR devices other than that the memory element needs to be inserted into the memory element slot and the GPSR must be activated. The use of the data element also allows for minimal downtime of the GPSR and the ability to reprogram the GPSR and download data therefrom, without having to physically attach it to another computer. 4 figs.
A global rate-distortion optimized approach for H.26L low bit rate robust video over the Internet
Yang Hua; Yu Songyu; Yang Songan
2005-01-01
In recent years, more and more applications of video communication over the Internet have been extended, so the demand for reliable transmission of compressed video in a packet loss environment is ever increasing. Rate-Distortion optimized mode selection is a fundamental problem of video communication over packet-switched networks, but the classical R-D method only considers quantization distortion in the source and hence it cannot achieve global optimality. Here we introduce a new global R-D optimal Macro-Block coding mode decision scheme for the new H.26L video compression standard. Based on the Internet packet loss model of Bernoulli and Gilbert, this R-D mode decision approach can result in better error robustness than classical method. Furthermore, our experimental results also demonstrate its superior adaptive error resilience and feasibility.
On stochastic and discontinuous optimization methods
Ermoliev, Y.
1994-12-31
The talk is based on a joint article by Y. Ermoliev, V. Norkin and R. Wets. A new notion of subgradient is introduced which allows to develop easily implementable procedures of discontinuous optimization, in particular, finite-difference approximation schemes. The approach relies on the notion of differentiability in the sense of distributions converting a discontinuous optimization problem into a problem of the stochastic optimization. Applications involving risks and abrupt transitions are discussed.
Travelling Methods: Tracing the Globalization of Qualitative Communication Research
Bryan C. Taylor
2016-05-01
Full Text Available Existing discussion of the relationships between globalization, communication research, and qualitative methods emphasizes two images: the challenges posed by globalization to existing communication theory and research methods, and the impact of post-colonial politics and ethics on qualitative research. We draw in this paper on a third image – qualitative research methods as artifacts of globalization – to explore the globalization of qualitative communication research methods. Following a review of literature which tentatively models this process, we discuss two case studies of qualitative research in the disciplinary subfields of intercultural communication and media audience studies. These cases elaborate the forces which influence the articulation of national, disciplinary, and methodological identities which mediate the globalization of qualitative communication research methods.
Chaonong Xu; Chi Zhang; Yongjun Xu; Zhiguang Wang
2015-01-01
The idea of network protocol design based on optimization theory has been proposed and used practically in Internet for about 15 years. However, for large-scale wireless ad hoc network, although protocol could be viewed as a recursive solving of a global optimization problem, protocol design is still facing huge challenge because an effective distributed algorithm for solving global optimization problem is still lacking. We solve the problem by putting forward a systematic design method based...
The global convergence of the non-quasi-Newton methods with non-monotone line search
无
2006-01-01
The non-quasi-Newton methods for unconstrained optimization was investigated. Non-monotone line search procedure is introduced, which is combined with the non-quasi-Newton family. Under the uniform convexity assumption on objective function, the global convergence of the non-quasi-Newton family was proved.Numerical experiments showed that the non-monotone line search was more effective.
Global Convergence of the Broyden's Class of Quasi-Newton Methods with Nonmonotone Linesearch
Da-chuan Xu
2003-01-01
In this paper, the Broyden class of quasi-Newton methods for unconstrained optimization is investigated. Non-monotone linesearch procedure is introduced, which is combined with the Broyden's class. Under the convexity assumption on objective function, the global convergence of the Broyden's class is proved.
Mathematical programming methods for large-scale topology optimization problems
Rojas Labanda, Susana
, and at the same time, reduce the number of function evaluations. Nonlinear optimization methods, such as sequential quadratic programming and interior point solvers, have almost not been embraced by the topology optimization community. Thus, this work is focused on the introduction of this kind of second......This thesis investigates new optimization methods for structural topology optimization problems. The aim of topology optimization is finding the optimal design of a structure. The physical problem is modelled as a nonlinear optimization problem. This powerful tool was initially developed...... for the classical minimum compliance problem. Two of the state-of-the-art optimization algorithms are investigated and implemented for this structural topology optimization problem. A Sequential Quadratic Programming (TopSQP) and an interior point method (TopIP) are developed exploiting the specific mathematical...
Adjoint Optimization of a Wing Using the CSRT Method
Straathof, M.H.; Van Tooren, M.J.L.
2011-01-01
This paper will demonstrate the potential of the Class-Shape-Refinement-Transformation (CSRT) method for aerodynamically optimizing three-dimensional surfaces. The CSRT method was coupled to an in-house Euler solver and this combination was used in an optimization framework to optimize the ONERA M6
Gradient type optimization methods for electronic structure calculations
Zhang, Xin; Wen, Zaiwen; Zhou, Aihui
2013-01-01
The density functional theory (DFT) in electronic structure calculations can be formulated as either a nonlinear eigenvalue or direct minimization problem. The most widely used approach for solving the former is the so-called self-consistent field (SCF) iteration. A common observation is that the convergence of SCF is not clear theoretically while approaches with convergence guarantee for solving the latter are often not competitive to SCF numerically. In this paper, we study gradient type methods for solving the direct minimization problem by constructing new iterations along the gradient on the Stiefel manifold. Global convergence (i.e., convergence to a stationary point from any initial solution) as well as local convergence rate follows from the standard theory for optimization on manifold directly. A major computational advantage is that the computation of linear eigenvalue problems is no longer needed. The main costs of our approaches arise from the assembling of the total energy functional and its grad...
Chun-Liang Lu
2014-12-01
Full Text Available Differential evolution (DE is a simple, powerful optimization algorithm, which has been widely used in many areas. However, the choices of the best mutation and search strategies are difficult for the specific issues. To alleviate these drawbacks and enhance the performance of DE, in this paper, the hybrid framework based on the adaptive mutation and Wrapper Local Search (WLS schemes, is proposed to improve searching ability to efficiently guide the evolution of the population toward the global optimum. Furthermore, the effective particle encoding representation named Particle Segment Operation-Machine Assignment (PSOMA that we previously published is applied to always produce feasible candidate solutions for solving the Flexible Job-shop Scheduling Problem (FJSP. Experiments were conducted on comprehensive set of complex benchmarks including the unimodal, multimodal and hybrid composition function, to validate performance of the proposed method and to compare with other state-of-the art DE variants such as jDE, JADE, MDE_pBX etc. Meanwhile, the hybrid DE model incorporating PSOMA is used to solve different representative instances based on practical data for multi-objective FJSP verifications. Simulation results indicate that the proposed method performs better for the majority of the single-objective scalable benchmark functions in terms of the solution accuracy and convergence rate. In addition, the wide range of Pareto-optimal solutions and more Gantt chart decision-makings can be provided for the multi-objective FJSP combinatorial optimizations.
The method of global learning in teaching foreign languages
Tatjana Dragovič
2001-12-01
Full Text Available The authors describe the method of global learning of foreign languages, which is based on the principles of neurolinguistic programming (NLP. According to this theory, the educator should use the method of the so-called periphery learning, where students learn relaxation techniques and at the same time they »incidentally « or subconsciously learn a foreign language. The method of global learning imitates successful strategies of learning in early childhood and therefore creates a relaxed attitude towards learning. Global learning is also compared with standard methods.
Exploration of Stellarator Configuration Space with Global Search Methods
H.E. Mynick; N. Pomphrey; S. Ethier
2001-09-10
An exploration of stellarator configuration space z for quasi-axisymmetric stellarator (QAS) designs is discussed, using methods which provide a more global view of that space. To this end, we have implemented a ''differential evolution'' (DE) search algorithm in an existing stellarator optimizer, which is much less prone to become trapped in local, suboptimal minima of the cost function chi than the local search methods used previously. This search algorithm is complemented by mapping studies of chi over z aimed at gaining insight into the results of the automated searches. We find that a wide range of the attractive QAS configurations previously found fall into a small number of classes, with each class corresponding to a basin of chi(z). We develop maps on which these earlier stellarators can be placed, the relations among them seen, and understanding gained into the physics differences between them. It is also found that, while still large, the region of z space containing practically realizable QAS configurations is much smaller than earlier supposed.
Optimal function explains forest responses to global change
Roderick Dewar; Oskar Franklin; Annikki Makela; Ross E. McMurtrie; Harry T. Valentine
2009-01-01
Plant responses to global changes in carbon dioxide (CO2), nitrogen, and water availability are critical to future atmospheric CO2 concentrations, hydrology, and hence climate. Our understanding of those responses is incomplete, however. Multiple-resource manipulation experiments and empirical observations have revealed a...
Globally Optimal Segmentation of Permanent-Magnet Systems
Insinga, Andrea Roberto; Bjørk, Rasmus; Smith, Anders
2016-01-01
Permanent-magnet systems are widely used for generation of magnetic fields with specific properties. The reciprocity theorem, an energy-equivalence principle in magnetostatics, can be employed to calculate the optimal remanent flux density of the permanent-magnet system, given any objective...... functional that is linear in the magnetic field. This approach, however, yields a continuously varying remanent flux density, while in practical applications, magnetic assemblies are realized by combining uniformly magnetized segments. The problem of determining the optimal shape of each of these segments...
A Review of Deterministic Optimization Methods in Engineering and Management
Ming-Hua Lin
2012-01-01
Full Text Available With the increasing reliance on modeling optimization problems in practical applications, a number of theoretical and algorithmic contributions of optimization have been proposed. The approaches developed for treating optimization problems can be classified into deterministic and heuristic. This paper aims to introduce recent advances in deterministic methods for solving signomial programming problems and mixed-integer nonlinear programming problems. A number of important applications in engineering and management are also reviewed to reveal the usefulness of the optimization methods.
A Study of Electrical Motors Controlling Optimization Methods
Saeid Fatemi
2013-01-01
In order to design an efficient motor cooling system, it is important to accurately predict the power optimization which is normally dissipated in form of heat. This study presents an analytical method for estimating bearing frictional optimization and numerical method for estimating electromagnetic optimization for an electric vehicle electrical motor. The power optimization obtained use heat sources when evaluating the thermal performance of the motor. The results showed that electromagneti...
Global Launcher Trajectory Optimization for Lunar Base Settlement
Pagano, A.; Mooij, E.
2010-01-01
The problem of a mission to the Moon to set a permanent outpost can be tackled by dividing the journey into three phases: the Earth ascent, the Earth-Moon transfer and the lunar landing. In this paper we present an optimization analysis of Earth ascent trajectories of existing launch vehicles inject
Computational Methods for Design, Control and Optimization
2007-10-01
34scenario" that applies to channel flows ( Poiseuille flows , Couette flow ) and pipe flows . Over the past 75 years many complex "transition theories" have...other areas of flow control, optimization and aerodynamic design. approximate sensitivity calculations and optimization codes. The effort was built on a...for fluid flow problems. The improved robustness and computational efficiency of this approach makes it practical for a wide class of problems. The
A simple method to optimize HMC performance
Bussone, Andrea; Drach, Vincent; Hansen, Martin; Hietanen, Ari; Rantaharju, Jarno; Pica, Claudio
2016-01-01
We present a practical strategy to optimize a set of Hybrid Monte Carlo parameters in simulations of QCD and QCD-like theories. We specialize to the case of mass-preconditioning, with multiple time-step Omelyan integrators. Starting from properties of the shadow Hamiltonian we show how the optimal setup for the integrator can be chosen once the forces and their variances are measured, assuming that those only depend on the mass-preconditioning parameter.
Gaviano, Marco; Lera, Daniela; Sergeyev, Yaroslav D
2011-01-01
A procedure for generating non-differentiable, continuously differentiable, and twice continuously differentiable classes of test functions for multiextremal multidimensional box-constrained global optimization and a corresponding package of C subroutines are presented. Each test class consists of 100 functions. Test functions are generated by defining a convex quadratic function systematically distorted by polynomials in order to introduce local minima. To determine a class, the user defines the following parameters: (i) problem dimension, (ii) number of local minima, (iii) value of the global minimum, (iv) radius of the attraction region of the global minimizer, (v) distance from the global minimizer to the vertex of the quadratic function. Then, all other necessary parameters are generated randomly for all 100 functions of the class. Full information about each test function including locations and values of all local minima is supplied to the user. Partial derivatives are also generated where possible.
An Efficient Method for Reliability-based Multidisciplinary Design Optimization
Fan Hui; Li Weiji
2008-01-01
Design for modem engineering system is becoming multidisciplinary and incorporates practical uncertainties; therefore, it is necessary to synthesize reliability analysis and the multidiscipLinary design optimization (MDO) techniques for the design of complex engineering system. An advanced first order second moment method-based concurrent subspace optimization approach is proposed based on the comparison and analysis of the existing multidisciplinary optimization techniques and the reliability analysis methods. It is seen through a canard configuration optimization for a three-surface transport that the proposed method is computationally efficient and practical with the least modification to the current deterministic optimization process.
Analysis and Improvement of TCP Congestion Control Mechanism Based on Global Optimization Model
无
2001-01-01
Network flow control is formulated as a global optimization problem of user profit. A general global optimization flow control model is established. This model combined with the stochastic model of TCP is used to study the global rate allocation characteristic of TCP. Analysis shows when active queue manage ment is used in network TCP rates tend to be allocated to maximize the aggregate of a user utility function Us (called Us fairness). The TCP throughput formula is derived. An improved TCP congestion control mecha nism is proposed. Simulations show its throughput is TCP friendly when competing with existing TCP and its rate change is smoother. Therefore, it is suitable to carry multimedia applications.
A Filled Function with Adjustable Parameters for Unconstrained Global Optimization
SHANGYou-lin; LIXiao-yan
2004-01-01
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.
Global stability and optimal control of an SIRS epidemic model on heterogeneous networks
Chen, Lijuan; Sun, Jitao
2014-09-01
In this paper, we consider an SIRS epidemic model with vaccination on heterogeneous networks. By constructing suitable Lyapunov functions, global stability of the disease-free equilibrium and the endemic equilibrium of the model is investigated. Also we firstly study an optimally controlled SIRS epidemic model on complex networks. We show that an optimal control exists for the control problem. Finally some examples are presented to show the global stability and the efficiency of this optimal control. These results can help in adopting pragmatic treatment upon diseases in structured populations.
V. Sedenka
2010-09-01
Full Text Available The paper deals with efficiency comparison of two global evolutionary optimization methods implemented in MATLAB. Attention is turned to an elitist Non-dominated Sorting Genetic Algorithm (NSGA-II and a novel multi-objective Particle Swarm Optimization (PSO. The performance of optimizers is compared on three different test functions and on a cavity resonator synthesis. The microwave resonator is modeled using the Finite Element Method (FEM. The hit rate and the quality of the Pareto front distribution are classified.
MA Wei; WANG Zheng-Ou
2003-01-01
Since there were few chaotic neural networks applicable to the global optimization, in this paper, we proposea new neural network model - chaotic parameters disturbance annealing (CPDA) network, which is superior to otherexisting neural networks, genetic algorithms, and simulated annealing algorithms in global optimization. In the presentCPDA network, we add some chaotic parameters in the energy function, which make the Hopfield neural network escapefrom the attraction of a local minimal solution and with the parameter p1 annealing, our model will converge to theglobal optimal solutions quickly and steadily. The converge ability and other characters are also analyzed in this paper.The benchmark examples show the present CPDA neuralnetwork's merits in nonlinear global optimization.
A Novel Global MPP Tracking of Photovoltaic System based on Whale Optimization Algorithm
Santhan Kumar Cherukuri
2016-11-01
Full Text Available To harvest maximum amount of solar energy and to attain higher efficiency, photovoltaic generation (PVG systems are to be operated at their maximum power point (MPP under both variable climatic and partial shaded condition (PSC. From literature most of conventional MPP tracking (MPPT methods are able to guarantee MPP successfully under uniform shading condition but fails to get global MPP as they may trap at local MPP under PSC, which adversely deteriorates the efficiency of Photovoltaic Generation (PVG system. In this paper a novel MPPT based on Whale Optimization Algorithm (WOA is proposed to analyze analytic modeling of PV system considering both series and shunt resistances for MPP tracking under PSC. The proposed algorithm is tested on 6S, 3S2P and 2S3P Photovoltaic array configurations for different shading patterns and results are presented. To compare the performance, GWO and PSO MPPT algorithms are also simulated and results are also presented. From the results it is noticed that proposed MPPT method is superior to other MPPT methods with reference to accuracy and tracking speed. Article History: Received July 23rd 2016; Received in revised form September 15th 2016; Accepted October 1st 2016; Available online How to Cite This Article: Kumar, C.H.S and Rao, R.S. (2016 A Novel Global MPP Tracking of Photovoltaic System based on Whale Optimization Algorithm. Int. Journal of Renewable Energy Development, 5(3, 225-232. http://dx.doi.org/10.14710/ijred.5.3.225-232
Design Methods and Optimization for Morphing Aircraft
Crossley, William A.
2005-01-01
This report provides a summary of accomplishments made during this research effort. The major accomplishments are in three areas. The first is the use of a multiobjective optimization strategy to help identify potential morphing features that uses an existing aircraft sizing code to predict the weight, size and performance of several fixed-geometry aircraft that are Pareto-optimal based upon on two competing aircraft performance objectives. The second area has been titled morphing as an independent variable and formulates the sizing of a morphing aircraft as an optimization problem in which the amount of geometric morphing for various aircraft parameters are included as design variables. This second effort consumed most of the overall effort on the project. The third area involved a more detailed sizing study of a commercial transport aircraft that would incorporate a morphing wing to possibly enable transatlantic point-to-point passenger service.
Multimodel methods for optimal control of aeroacoustics.
Chen, Guoquan (Rice University, Houston, TX); Collis, Samuel Scott
2005-01-01
A new multidomain/multiphysics computational framework for optimal control of aeroacoustic noise has been developed based on a near-field compressible Navier-Stokes solver coupled with a far-field linearized Euler solver both based on a discontinuous Galerkin formulation. In this approach, the coupling of near- and far-field domains is achieved by weakly enforcing continuity of normal fluxes across a coupling surface that encloses all nonlinearities and noise sources. For optimal control, gradient information is obtained by the solution of an appropriate adjoint problem that involves the propagation of adjoint information from the far-field to the near-field. This computational framework has been successfully applied to study optimal boundary-control of blade-vortex interaction, which is a significant noise source for helicopters on approach to landing. In the model-problem presented here, the noise propagated toward the ground is reduced by 12dB.
A Method for Determining Optimal Residential Energy Efficiency Packages
Polly, B. [National Renewable Energy Lab. (NREL), Golden, CO (United States); Gestwick, M. [National Renewable Energy Lab. (NREL), Golden, CO (United States); Bianchi, M. [National Renewable Energy Lab. (NREL), Golden, CO (United States); Anderson, R. [National Renewable Energy Lab. (NREL), Golden, CO (United States); Horowitz, S. [National Renewable Energy Lab. (NREL), Golden, CO (United States); Christensen, C. [National Renewable Energy Lab. (NREL), Golden, CO (United States); Judkoff, R. [National Renewable Energy Lab. (NREL), Golden, CO (United States)
2011-04-01
This report describes an analysis method for determining optimal residential energy efficiency retrofit packages and, as an illustrative example, applies the analysis method to a 1960s-era home in eight U.S. cities covering a range of International Energy Conservation Code (IECC) climate regions. The method uses an optimization scheme that considers average energy use (determined from building energy simulations) and equivalent annual cost to recommend optimal retrofit packages specific to the building, occupants, and location.
Advanced Topology Optimization Methods for Conceptual Architectural Design
Aage, Niels; Amir, Oded; Clausen, Anders
2014-01-01
This paper presents a series of new, advanced topology optimization methods, developed specifically for conceptual architectural design of structures. The proposed computational procedures are implemented as components in the framework of a Grasshopper plugin, providing novel capacities...... in topological optimization: Interactive control and continuous visualization; embedding flexible voids within the design space; consideration of distinct tension / compression properties; and optimization of dual material systems. In extension, optimization procedures for skeletal structures such as trusses...... and frames are implemented. The developed procedures allow for the exploration of new territories in optimization of architectural structures, and offer new methodological strategies for bridging conceptual gaps between optimization and architectural practice....
A Global Optimization Algorithm for Sum of Linear Ratios Problem
Yuelin Gao
2013-01-01
Full Text Available We equivalently transform the sum of linear ratios programming problem into bilinear programming problem, then by using the linear characteristics of convex envelope and concave envelope of double variables product function, linear relaxation programming of the bilinear programming problem is given, which can determine the lower bound of the optimal value of original problem. Therefore, a branch and bound algorithm for solving sum of linear ratios programming problem is put forward, and the convergence of the algorithm is proved. Numerical experiments are reported to show the effectiveness of the proposed algorithm.
COMPARISON OF NONLINEAR DYNAMICS OPTIMIZATION METHODS FOR APS-U
Sun, Y.; Borland, Michael
2017-06-25
Many different objectives and genetic algorithms have been proposed for storage ring nonlinear dynamics performance optimization. These optimization objectives include nonlinear chromaticities and driving/detuning terms, on-momentum and off-momentum dynamic acceptance, chromatic detuning, local momentum acceptance, variation of transverse invariant, Touschek lifetime, etc. In this paper, the effectiveness of several different optimization methods and objectives are compared for the nonlinear beam dynamics optimization of the Advanced Photon Source upgrade (APS-U) lattice. The optimized solutions from these different methods are preliminarily compared in terms of the dynamic acceptance, local momentum acceptance, chromatic detuning, and other performance measures.
METHOD FOR OPTIMIZING THE ENERGY OF PUMPS
Skovmose Kallesøe, Carsten; De Persis, Claudio
2013-01-01
The device for energy-optimization on operation of several centrifugal pumps controlled in rotational speed, in a hydraulic installation, begins firstly with determining which pumps as pilot pumps are assigned directly to a consumer and which pumps are hydraulically connected in series upstream of t
Global optimization of parameters in the reactive force field ReaxFF for SiOH.
Larsson, Henrik R; van Duin, Adri C T; Hartke, Bernd
2013-09-30
We have used unbiased global optimization to fit a reactive force field to a given set of reference data. Specifically, we have employed genetic algorithms (GA) to fit ReaxFF to SiOH data, using an in-house GA code that is parallelized across reference data items via the message-passing interface (MPI). Details of GA tuning turn-ed out to be far less important for global optimization efficiency than using suitable ranges within which the parameters are varied. To establish these ranges, either prior knowledge can be used or successive stages of GA optimizations, each building upon the best parameter vectors and ranges found in the previous stage. We have finally arrive-ed at optimized force fields with smaller error measures than those published previously. Hence, this optimization approach will contribute to converting force-field fitting from a specialist task to an everyday commodity, even for the more difficult case of reactive force fields.
Global Optimization, Local Adaptation, and the Role of Growth in Distribution Networks
Ronellenfitsch, Henrik; Katifori, Eleni
2016-09-01
Highly optimized complex transport networks serve crucial functions in many man-made and natural systems such as power grids and plant or animal vasculature. Often, the relevant optimization functional is nonconvex and characterized by many local extrema. In general, finding the global, or nearly global optimum is difficult. In biological systems, it is believed that such an optimal state is slowly achieved through natural selection. However, general coarse grained models for flow networks with local positive feedback rules for the vessel conductivity typically get trapped in low efficiency, local minima. In this work we show how the growth of the underlying tissue, coupled to the dynamical equations for network development, can drive the system to a dramatically improved optimal state. This general model provides a surprisingly simple explanation for the appearance of highly optimized transport networks in biology such as leaf and animal vasculature.
Global optimization, local adaptation and the role of growth in distribution networks
Ronellenfitsch, Henrik
2016-01-01
Highly-optimized complex transport networks serve crucial functions in many man-made and natural systems such as power grids and plant or animal vasculature. Often, the relevant optimization functional is non-convex and characterized by many local extrema. In general, finding the global, or nearly global optimum is difficult. In biological systems, it is believed that natural selection slowly guides the network towards an optimized state. However, general coarse grained models for flow networks with local positive feedback rules for the vessel conductivity typically get trapped in low efficiency, local minima. In this work we show how the growth of the underlying tissue, coupled to the dynamical equations for network development, can drive the system to a dramatically improved optimal state. This general model provides a surprisingly simple explanation for the appearance of highly optimized transport networks in biology such as leaf and animal vasculature.
Logic-based methods for optimization combining optimization and constraint satisfaction
Hooker, John
2011-01-01
A pioneering look at the fundamental role of logic in optimization and constraint satisfaction While recent efforts to combine optimization and constraint satisfaction have received considerable attention, little has been said about using logic in optimization as the key to unifying the two fields. Logic-Based Methods for Optimization develops for the first time a comprehensive conceptual framework for integrating optimization and constraint satisfaction, then goes a step further and shows how extending logical inference to optimization allows for more powerful as well as flexible
A Conjugate Gradient Type Method for the Nonnegative Constraints Optimization Problems
Can Li
2013-01-01
Full Text Available We are concerned with the nonnegative constraints optimization problems. It is well known that the conjugate gradient methods are efficient methods for solving large-scale unconstrained optimization problems due to their simplicity and low storage. Combining the modified Polak-Ribière-Polyak method proposed by Zhang, Zhou, and Li with the Zoutendijk feasible direction method, we proposed a conjugate gradient type method for solving the nonnegative constraints optimization problems. If the current iteration is a feasible point, the direction generated by the proposed method is always a feasible descent direction at the current iteration. Under appropriate conditions, we show that the proposed method is globally convergent. We also present some numerical results to show the efficiency of the proposed method.
SIMULTANEOUS SHAPE AND TOPOLOGY OPTIMIZATION OF TRUSS UNDER LOCAL AND GLOBAL STABILITY CONSTRAINTS
GuoXu; LiuWei; LiHongyan
2003-01-01
A new approach for the solution of truss shape and topology optimization problem sunder local and global stability constraints is proposed. By employing the cross sectional areas of each bar and some shape parameters as topology design variables, the difficulty arising from the jumping of buckling length phenomenon can be easily overcome without the necessity of introducing the overlapping bars into the initial ground structure. Therefore computational efforts can be saved for the solution of this kind of problem. By modifying the elements of the stiffness matrix using Sigmoid function, the continuity of the objective and constraint functions with respect to shape design parameters can be restored to some extent. Some numerical examples demonstrate the effectiveness of the proposed method.
GENOPT 2016: Design of a generalization-based challenge in global optimization
Battiti, Roberto; Sergeyev, Yaroslav; Brunato, Mauro; Kvasov, Dmitri
2016-10-01
While comparing results on benchmark functions is a widely used practice to demonstrate the competitiveness of global optimization algorithms, fixed benchmarks can lead to a negative data mining process. To avoid this negative effect, the GENOPT contest benchmarks can be used which are based on randomized function generators, designed for scientific experiments, with fixed statistical characteristics but individual variation of the generated instances. The generators are available to participants for off-line tests and online tuning schemes, but the final competition is based on random seeds communicated in the last phase through a cooperative process. A brief presentation and discussion of the methods and results obtained in the framework of the GENOPT contest are given in this contribution.
Nacelle Chine Installation Based on Wind-Tunnel Test Using Efficient Global Optimization
Kanazaki, Masahiro; Yokokawa, Yuzuru; Murayama, Mitsuhiro; Ito, Takeshi; Jeong, Shinkyu; Yamamoto, Kazuomi
Design exploration of a nacelle chine installation was carried out. The nacelle chine improves stall performance when deploying multi-element high-lift devices. This study proposes an efficient design process using a Kriging surrogate model to determine the nacelle chine installation point in wind-tunnel tests. The design exploration was conducted in a wind-tunnel using the JAXA high-lift aircraft model at the JAXA Large-scale Low-speed Wind Tunnel. The objective was to maximize the maximum lift. The chine installation points were designed on the engine nacelle in the axial and chord-wise direction, while the geometry of the chine was fixed. In the design process, efficient global optimization (EGO) which includes Kriging model and genetic algorithm (GA) was employed. This method makes it possible both to improve the accuracy of the response surface and to explore the global optimum efficiently. Detailed observations of flowfields using the Particle Image Velocimetry method confirmed the chine effect and design results.
Yang, Jian; Cong, Weijian; Chen, Yang; Fan, Jingfan; Liu, Yue; Wang, Yongtian
2014-02-21
The clinical value of the 3D reconstruction of a coronary artery is important for the diagnosis and intervention of cardiovascular diseases. This work proposes a method based on a deformable model for reconstructing coronary arteries from two monoplane angiographic images acquired from different angles. First, an external force back-projective composition model is developed to determine the external force, for which the force distributions in different views are back-projected to the 3D space and composited in the same coordinate system based on the perspective projection principle of x-ray imaging. The elasticity and bending forces are composited as an internal force to maintain the smoothness of the deformable curve. Second, the deformable curve evolves rapidly toward the true vascular centerlines in 3D space and angiographic images under the combination of internal and external forces. Third, densely matched correspondence among vessel centerlines is constructed using a curve alignment method. The bundle adjustment method is then utilized for the global optimization of the projection parameters and the 3D structures. The proposed method is validated on phantom data and routine angiographic images with consideration for space and re-projection image errors. Experimental results demonstrate the effectiveness and robustness of the proposed method for the reconstruction of coronary arteries from two monoplane angiographic images. The proposed method can achieve a mean space error of 0.564 mm and a mean re-projection error of 0.349 mm.
Protein structure prediction using global optimization by basin-hopping with NMR shift restraints.
Hoffmann, Falk; Strodel, Birgit
2013-01-14
Computational methods that utilize chemical shifts to produce protein structures at atomic resolution have recently been introduced. In the current work, we exploit chemical shifts by combining the basin-hopping approach to global optimization with chemical shift restraints using a penalty function. For three peptides, we demonstrate that this approach allows us to find near-native structures from fully extended structures within 10,000 basin-hopping steps. The effect of adding chemical shift restraints is that the α and β secondary structure elements form within 1000 basin-hopping steps, after which the orientation of the secondary structure elements, which produces the tertiary contacts, is driven by the underlying protein force field. We further show that our chemical shift-restraint BH approach also works for incomplete chemical shift assignments, where the information from only one chemical shift type is considered. For the proper implementation of chemical shift restraints in the basin-hopping approach, we determined the optimal weight of the chemical shift penalty energy with respect to the CHARMM force field in conjunction with the FACTS solvation model employed in this study. In order to speed up the local energy minimization procedure, we developed a function, which continuously decreases the width of the chemical shift penalty function as the minimization progresses. We conclude that the basin-hopping approach with chemical shift restraints is a promising method for protein structure prediction.
Efficient Parallel Global Optimization for High Resolution Hydrologic and Climate Impact Models
Shoemaker, C. A.; Mueller, J.; Pang, M.
2013-12-01
High Resolution hydrologic models are typically computationally expensive, requiring many minutes or perhaps hours for one simulation. Optimization can be used with these models for parameter estimation or for analyzing management alternatives. However Optimization of these computationally expensive simulations requires algorithms that can obtain accurate answers with relatively few simulations to avoid infeasibly long computation times. We have developed a number of efficient parallel algorithms and software codes for optimization of expensive problems with multiple local minimum. This is open source software we are distributing. It runs in Matlab and Python, and has been run on Yellowstone supercomputer. The talk will quickly discuss the characteristics of the problem (e.g. the presence of integer as well as continuous variables, the number of dimensions, the availability of parallel/grid computing, the number of simulations that can be allowed to find a solution, etc. ) that determine which algorithms are most appropriate for each type of problem. A major application of this optimization software is for parameter estimation for nonlinear hydrologic models, including contaminant transport in subsurface (e.g. for groundwater remediation or multi-phase flow for carbon sequestration), nutrient transport in watersheds, and climate models. We will present results for carbon sequestration plume monitoring (multi-phase, multi-constiuent), for groundwater remediation, and for the CLM climate model. The carbon sequestration example is based on the Frio CO2 field site and the groundwater example is for a 50,000 acre remediation site (with model requiring about 1 hour per simulation). Parallel speed-ups are excellent in most cases, and our serial and parallel algorithms tend to outperform alternative methods on complex computationally expensive simulations that have multiple global minima.
Vertical bifacial solar farms: Physics, design, and global optimization
Khan, M. Ryyan
2017-09-04
There have been sustained interest in bifacial solar cell technology since 1980s, with prospects of 30–50% increase in the output power from a stand-alone panel. Moreover, a vertical bifacial panel reduces dust accumulation and provides two output peaks during the day, with the second peak aligned to the peak electricity demand. Recent commercialization and anticipated growth of bifacial panel market have encouraged a closer scrutiny of the integrated power-output and economic viability of bifacial solar farms, where mutual shading will erode some of the anticipated energy gain associated with an isolated, single panel. Towards that goal, in this paper we focus on geography-specific optimization of ground-mounted vertical bifacial solar farms for the entire world. For local irradiance, we combine the measured meteorological data with the clear-sky model. In addition, we consider the effects of direct, diffuse, and albedo light. We assume the panel is configured into sub-strings with bypass-diodes. Based on calculated light collection and panel output, we analyze the optimum farm design for maximum yearly output at any given location in the world. Our results predict that, regardless of the geographical location, a vertical bifacial farm will yield 10–20% more energy than a traditional monofacial farm for a practical row-spacing of 2 m (corresponding to 1.2 m high panels). With the prospect of additional 5–20% energy gain from reduced soiling and tilt optimization, bifacial solar farm do offer a viable technology option for large-scale solar energy generation.
A Novel Parametric Modeling Method and Optimal Design for Savonius Wind Turbines
Baoshou Zhang
2017-03-01
Full Text Available Under the inspiration of polar coordinates, a novel parametric modeling and optimization method for Savonius wind turbines was proposed to obtain the highest power output, in which a quadratic polynomial curve was bent to describe a blade. Only two design parameters are needed for the shape-complicated blade. Therefore, this novel method reduces sampling scale. A series of transient simulations was run to get the optimal performance coefficient (power coefficient C p for different modified turbines based on computational fluid dynamics (CFD method. Then, a global response surface model and a more precise local response surface model were created according to Kriging Method. These models defined the relationship between optimization objective Cp and design parameters. Particle swarm optimization (PSO algorithm was applied to find the optimal design based on these response surface models. Finally, the optimal Savonius blade shaped like a “hook” was obtained. Cm (torque coefficient, Cp and flow structure were compared for the optimal design and the classical design. The results demonstrate that the optimal Savonius turbine has excellent comprehensive performance. The power coefficient Cp is significantly increased from 0.247 to 0.262 (6% higher. The weight of the optimal blade is reduced by 17.9%.
Numerical methods of mathematical optimization with Algol and Fortran programs
Künzi, Hans P; Zehnder, C A; Rheinboldt, Werner
1971-01-01
Numerical Methods of Mathematical Optimization: With ALGOL and FORTRAN Programs reviews the theory and the practical application of the numerical methods of mathematical optimization. An ALGOL and a FORTRAN program was developed for each one of the algorithms described in the theoretical section. This should result in easy access to the application of the different optimization methods.Comprised of four chapters, this volume begins with a discussion on the theory of linear and nonlinear optimization, with the main stress on an easily understood, mathematically precise presentation. In addition
Fast global convergence of gradient methods for high-dimensional statistical recovery
Agarwal, Alekh; Wainwright, Martin J
2011-01-01
Many statistical M-estimators are based on convex optimization problems formed by the combination of a data-dependent loss function with a norm-based regularizer. We analyze the convergence rates of projected gradient methods for solving such problems, working within a high-dimensional framework that allows the data dimension d to grow with (and possibly exceed) the sample size n. This high-dimensional structure precludes the usual global assumptions---namely, strong convexity and smoothness conditions---that underlie much of classical optimization analysis. We define appropriately restricted versions of these conditions, and show that they are satisfied with high probability for various statistical models. Under these conditions, our theory guarantees that projected gradient descent has a globally geometric rate of convergence up to the \\emph{statistical precision} of the model, meaning the typical distance between the true unknown parameter $\\theta^*$ and an optimal solution $\\hat{\\theta}$. This result is s...
A NEW DERIVATIVE FREE OPTIMIZATION METHOD BASED ON CONIC INTERPOLATION MODEL
倪勤; 胡书华
2004-01-01
In this paper, a new derivative free trust region method is developed based on the conic interpolation model for the unconstrained optimization. The conic interpolation model is built by means of the quadratic model function, the collinear scaling formula, quadratic approximation and interpolation. All the parameters in this model are determined by objective function interpolation condition. A new derivative free method is developed based upon this model and the global convergence of this new method is proved without any information on gradient.
Review of dynamic optimization methods in renewable natural resource management
Williams, B.K.
1989-01-01
In recent years, the applications of dynamic optimization procedures in natural resource management have proliferated. A systematic review of these applications is given in terms of a number of optimization methodologies and natural resource systems. The applicability of the methods to renewable natural resource systems are compared in terms of system complexity, system size, and precision of the optimal solutions. Recommendations are made concerning the appropriate methods for certain kinds of biological resource problems.
Study on optimization control method based on artificial neural network
FU Hua; SUN Shao-guang; XU Zhen-Iiang
2005-01-01
In the goal optimization and control optimization process the problems with common artificial neural network algorithm are unsure convergence, insufficient post-training network precision, and slow training speed, in which partial minimum value question tends to occur. This paper conducted an in-depth study on the causes of the limitations of the algorithm, presented a rapid artificial neural network algorithm, which is characterized by integrating multiple algorithms and by using their complementary advantages. The salient feature of the method is self-organization, which can effectively prevent the optimized results from tending to be partial minimum values. Overall optimization can be achieved with this method, goal function can be searched for in overall scope. With optimization control of coal mine ventilator as a practical application, the paper proves that by integrating multiple artificial neural network algorithms, best control optimization and goal optimized can be achieved.
Optimization and control methods in industrial engineering and construction
Wang, Xiangyu
2014-01-01
This book presents recent advances in optimization and control methods with applications to industrial engineering and construction management. It consists of 15 chapters authored by recognized experts in a variety of fields including control and operation research, industrial engineering, and project management. Topics include numerical methods in unconstrained optimization, robust optimal control problems, set splitting problems, optimum confidence interval analysis, a monitoring networks optimization survey, distributed fault detection, nonferrous industrial optimization approaches, neural networks in traffic flows, economic scheduling of CCHP systems, a project scheduling optimization survey, lean and agile construction project management, practical construction projects in Hong Kong, dynamic project management, production control in PC4P, and target contracts optimization. The book offers a valuable reference work for scientists, engineers, researchers and practitioners in industrial engineering and c...
DYNAMIC OPTIMIZATION FOR UNCERTAIN STRUCTURES USING INTERVAL METHOD
ChertSub-A-; WuJie; LiuChun
2003-01-01
An interval optimization method for the dynamic response of structures with interval parameters is presented. The matrices of structures with interval parameters are given. Combining the interval extension with the perturbation, the method for interval dynamic response analysis is derived. The interval optimization problem is transformed into a corresponding deterministic one. Because the mean values and the uncertainties of the interval parameters can be elected design variables, more information of the optimization results can be obtained by the present method than that obtained by the deterministic one. The present method is implemented for a truss structure. The numerical results show that the method is effective.
Methods for researching intercultural communication in globalized complex societies
Jensen, Iben; Andreasen, Lars Birch
2014-01-01
The field of intercultural communication research is challenged theoretically as well as methodologically by global changes such as migration, global mobility, mass media, tourism, etc. According to these changes cultures can no longer be seen as national entities, and cultural identity can...... are not capable of addressing these new realities, research in intercultural communication will have a tendency to reproduce ‘old’ assumptions. The aim of this chapter is to discuss four criteria for developing methods that are relevant to intercultural communication research in complex globalized societies...... no longer be taken for granted as related to a single ethnic group. Thus, in globalized complex societies, knowledge of ‘the other’ no longer primarily comes from business guides or international literature, but is an integrated part of everyday experiences. If the methods we use in intercultural research...
An uncertain multidisciplinary design optimization method using interval convex models
Li, Fangyi; Luo, Zhen; Sun, Guangyong; Zhang, Nong
2013-06-01
This article proposes an uncertain multi-objective multidisciplinary design optimization methodology, which employs the interval model to represent the uncertainties of uncertain-but-bounded parameters. The interval number programming method is applied to transform each uncertain objective function into two deterministic objective functions, and a satisfaction degree of intervals is used to convert both the uncertain inequality and equality constraints to deterministic inequality constraints. In doing so, an unconstrained deterministic optimization problem will be constructed in association with the penalty function method. The design will be finally formulated as a nested three-loop optimization, a class of highly challenging problems in the area of engineering design optimization. An advanced hierarchical optimization scheme is developed to solve the proposed optimization problem based on the multidisciplinary feasible strategy, which is a well-studied method able to reduce the dimensions of multidisciplinary design optimization problems by using the design variables as independent optimization variables. In the hierarchical optimization system, the non-dominated sorting genetic algorithm II, sequential quadratic programming method and Gauss-Seidel iterative approach are applied to the outer, middle and inner loops of the optimization problem, respectively. Typical numerical examples are used to demonstrate the effectiveness of the proposed methodology.
Gradient-based methods for production optimization of oil reservoirs
Suwartadi, Eka
2012-07-01
Production optimization for water flooding in the secondary phase of oil recovery is the main topic in this thesis. The emphasis has been on numerical optimization algorithms, tested on case examples using simple hypothetical oil reservoirs. Gradientbased optimization, which utilizes adjoint-based gradient computation, is used to solve the optimization problems. The first contribution of this thesis is to address output constraint problems. These kinds of constraints are natural in production optimization. Limiting total water production and water cut at producer wells are examples of such constraints. To maintain the feasibility of an optimization solution, a Lagrangian barrier method is proposed to handle the output constraints. This method incorporates the output constraints into the objective function, thus avoiding additional computations for the constraints gradient (Jacobian) which may be detrimental to the efficiency of the adjoint method. The second contribution is the study of the use of second-order adjoint-gradient information for production optimization. In order to speedup convergence rate in the optimization, one usually uses quasi-Newton approaches such as BFGS and SR1 methods. These methods compute an approximation of the inverse of the Hessian matrix given the first-order gradient from the adjoint method. The methods may not give significant speedup if the Hessian is ill-conditioned. We have developed and implemented the Hessian matrix computation using the adjoint method. Due to high computational cost of the Newton method itself, we instead compute the Hessian-timesvector product which is used in a conjugate gradient algorithm. Finally, the last contribution of this thesis is on surrogate optimization for water flooding in the presence of the output constraints. Two kinds of model order reduction techniques are applied to build surrogate models. These are proper orthogonal decomposition (POD) and the discrete empirical interpolation method (DEIM
Martian Radiative Transfer Modeling Using the Optimal Spectral Sampling Method
Eluszkiewicz, J.; Cady-Pereira, K.; Uymin, G.; Moncet, J.-L.
2005-01-01
The large volume of existing and planned infrared observations of Mars have prompted the development of a new martian radiative transfer model that could be used in the retrievals of atmospheric and surface properties. The model is based on the Optimal Spectral Sampling (OSS) method [1]. The method is a fast and accurate monochromatic technique applicable to a wide range of remote sensing platforms (from microwave to UV) and was originally developed for the real-time processing of infrared and microwave data acquired by instruments aboard the satellites forming part of the next-generation global weather satellite system NPOESS (National Polarorbiting Operational Satellite System) [2]. As part of our on-going research related to the radiative properties of the martian polar caps, we have begun the development of a martian OSS model with the goal of using it to perform self-consistent atmospheric corrections necessary to retrieve caps emissivity from the Thermal Emission Spectrometer (TES) spectra. While the caps will provide the initial focus area for applying the new model, it is hoped that the model will be of interest to the wider Mars remote sensing community.
Mixed methods for viscoelastodynamics and topology optimization
Giacomo Maurelli
2014-07-01
Full Text Available A truly-mixed approach for the analysis of viscoelastic structures and continua is presented. An additive decomposition of the stress state into a viscoelastic part and a purely elastic one is introduced along with an Hellinger-Reissner variational principle wherein the stress represents the main variable of the formulation whereas the kinematic descriptor (that in the case at hand is the velocity field acts as Lagrange multiplier. The resulting problem is a Differential Algebraic Equation (DAE because of the need to introduce static Lagrange multipliers to comply with the Cauchy boundary condition on the stress. The associated eigenvalue problem is known in the literature as constrained eigenvalue problem and poses several difficulties for its solution that are addressed in the paper. The second part of the paper proposes a topology optimization approach for the rationale design of viscoelastic structures and continua. Details concerning density interpolation, compliance problems and eigenvalue-based objectives are given. Worked numerical examples are presented concerning both the dynamic analysis of viscoelastic structures and their topology optimization.
Design and Optimization Method of a Two-Disk Rotor System
Huang, Jingjing; Zheng, Longxi; Mei, Qing
2016-04-01
An integrated analytical method based on multidisciplinary optimization software Isight and general finite element software ANSYS was proposed in this paper. Firstly, a two-disk rotor system was established and the mode, humorous response and transient response at acceleration condition were analyzed with ANSYS. The dynamic characteristics of the two-disk rotor system were achieved. On this basis, the two-disk rotor model was integrated to the multidisciplinary design optimization software Isight. According to the design of experiment (DOE) and the dynamic characteristics, the optimization variables, optimization objectives and constraints were confirmed. After that, the multi-objective design optimization of the transient process was carried out with three different global optimization algorithms including Evolutionary Optimization Algorithm, Multi-Island Genetic Algorithm and Pointer Automatic Optimizer. The optimum position of the two-disk rotor system was obtained at the specified constraints. Meanwhile, the accuracy and calculation numbers of different optimization algorithms were compared. The optimization results indicated that the rotor vibration reached the minimum value and the design efficiency and quality were improved by the multidisciplinary design optimization in the case of meeting the design requirements, which provided the reference to improve the design efficiency and reliability of the aero-engine rotor.
2015-09-24
19. Colloquium lecture at College of Management , National Chiao Tung University, June 22, 2012. Title: Unified Framework in Global Supply Chain and...the well-known logistic equation in population dynamical systems can be reformulated as a global optimization problem, which could have at most 2n...making, supply chain , scheduling problems, and computational mechanics, etc. Impacts to the communities: The canonical duality theory is now
Amstel, van T.; Groen, M.; Post, J.; Huetink, J.
2005-01-01
This article describes an inverse optimization method for the Sandvik Nanoflex steel in cold forming processes. The optimization revolves around measured samples and calculations using the Finite Element Method. Sandvik Nanoflex is part of the group of meta-stable stainless steels. These materials a
A branch and bound algorithm for the global optimization of Hessian Lipschitz continuous functions
Fowkes, Jaroslav M.
2012-06-21
We present a branch and bound algorithm for the global optimization of a twice differentiable nonconvex objective function with a Lipschitz continuous Hessian over a compact, convex set. The algorithm is based on applying cubic regularisation techniques to the objective function within an overlapping branch and bound algorithm for convex constrained global optimization. Unlike other branch and bound algorithms, lower bounds are obtained via nonconvex underestimators of the function. For a numerical example, we apply the proposed branch and bound algorithm to radial basis function approximations. © 2012 Springer Science+Business Media, LLC.
A non-parametric method for correction of global radiation observations
Bacher, Peder; Madsen, Henrik; Perers, Bengt;
2013-01-01
This paper presents a method for correction and alignment of global radiation observations based on information obtained from calculated global radiation, in the present study one-hour forecast of global radiation from a numerical weather prediction (NWP) model is used. Systematical errors detected...... in the observations are corrected. These are errors such as: tilt in the leveling of the sensor, shadowing from surrounding objects, clipping and saturation in the signal processing, and errors from dirt and wear. The method is based on a statistical non-parametric clear-sky model which is applied to both...... University. The method can be useful for optimized use of solar radiation observations for forecasting, monitoring, and modeling of energy production and load which are affected by solar radiation....
A class of globally convergent conjugate gradient methods
DAI; Yuhong(戴彧虹); YUAN; Yaxiang(袁亚湘)
2003-01-01
Conjugate gradient methods are very important ones for solving nonlinear optimization problems,especially for large scale problems. However, unlike quasi-Newton methods, conjugate gradient methods wereusually analyzed individually. In this paper, we propose a class of conjugate gradient methods, which can beregarded as some kind of convex combination of the Fletcher-Reeves method and the method proposed byDai et al. To analyze this class of methods, we introduce some unified tools that concern a general methodwith the scalarβk having the form of φk/φk-1. Consequently, the class of conjugate gradient methods canuniformly be analyzed.
Present-day Problems and Methods of Optimization in Mechatronics
Tarnowski Wojciech
2017-06-01
Full Text Available It is justified that design is an inverse problem, and the optimization is a paradigm. Classes of design problems are proposed and typical obstacles are recognized. Peculiarities of the mechatronic designing are specified as a proof of a particle importance of optimization in the mechatronic design. Two main obstacles of optimization are discussed: a complexity of mathematical models and an uncertainty of the value system, in concrete case. Then a set of non-standard approaches and methods are presented and discussed, illustrated by examples: a fuzzy description, a constraint-based iterative optimization, AHP ranking method and a few MADM functions in Matlab.
Computation of Optimal Monotonicity Preserving General Linear Methods
Ketcheson, David I.
2009-07-01
Monotonicity preserving numerical methods for ordinary differential equations prevent the growth of propagated errors and preserve convex boundedness properties of the solution. We formulate the problem of finding optimal monotonicity preserving general linear methods for linear autonomous equations, and propose an efficient algorithm for its solution. This algorithm reliably finds optimal methods even among classes involving very high order accuracy and that use many steps and/or stages. The optimality of some recently proposed methods is verified, and many more efficient methods are found. We use similar algorithms to find optimal strong stability preserving linear multistep methods of both explicit and implicit type, including methods for hyperbolic PDEs that use downwind-biased operators.
A Novel Multiobjective Optimization Method Based on Sensitivity Analysis
Tiane Li
2016-01-01
Full Text Available For multiobjective optimization problems, different optimization variables have different influences on objectives, which implies that attention should be paid to the variables according to their sensitivity. However, previous optimization studies have not considered the variables sensitivity or conducted sensitivity analysis independent of optimization. In this paper, an integrated algorithm is proposed, which combines the optimization method SPEA (Strength Pareto Evolutionary Algorithm with the sensitivity analysis method SRCC (Spearman Rank Correlation Coefficient. In the proposed algorithm, the optimization variables are worked as samples of sensitivity analysis, and the consequent sensitivity result is used to guide the optimization process by changing the evolutionary parameters. Three cases including a mathematical problem, an airship envelope optimization, and a truss topology optimization are used to demonstrate the computational efficiency of the integrated algorithm. The results showed that this algorithm is able to simultaneously achieve parameter sensitivity and a well-distributed Pareto optimal set, without increasing the computational time greatly in comparison with the SPEA method.
Simulation-Based Methodologies for Global Optimization and Planning
2013-10-11
denoted as ε j(xi). The uncertainties in M and ε j are referred as extrinsic and intrinsic uncertainties, respectively. Denote the sample mean of...The researchers developed a new method of distributed ordinal comparison of selecting the best option, which maximizes the average of local reward ...option, which maximizes the average of local reward function values among available options in a dynamic network. they discovered a new innovative
Fast sequential Monte Carlo methods for counting and optimization
Rubinstein, Reuven Y; Vaisman, Radislav
2013-01-01
A comprehensive account of the theory and application of Monte Carlo methods Based on years of research in efficient Monte Carlo methods for estimation of rare-event probabilities, counting problems, and combinatorial optimization, Fast Sequential Monte Carlo Methods for Counting and Optimization is a complete illustration of fast sequential Monte Carlo techniques. The book provides an accessible overview of current work in the field of Monte Carlo methods, specifically sequential Monte Carlo techniques, for solving abstract counting and optimization problems. Written by authorities in the
J. Lang; J.G. Verwer (Jan)
2013-01-01
htmlabstractThis paper addresses consistency and stability of W-methods up to order three for nonlinear ODE-constrained control problems with possible restrictions on the control. The analysis is based on the transformed adjoint system and the control uniqueness property. These methods can also be
A method optimization study for atomic absorption ...
Sadia Ata
2014-04-24
Apr 24, 2014 ... spectrophotometric determination of total zinc in insulin using .... A linear regression by the least squares method is then applied. The value of the determination coefficient (R2 =0.99842) showed excellent linearity of the calibration curve for the ... method is applied repeatedly to multiple sampling of homol-.
Control Methods Utilizing Energy Optimizing Schemes in Refrigeration Systems
Larsen, L.S; Thybo, C.; Stoustrup, Jakob
2003-01-01
The potential energy savings in refrigeration systems using energy optimal control has been proved to be substantial. This however requires an intelligent control that drives the refrigeration systems towards the energy optimal state. This paper proposes an approach for a control, which drives th...... the condenser pressure towards an optimal state. The objective of this is to present a feasible method that can be used for energy optimizing control. A simulation model of a simple refrigeration system will be used as basis for testing the control method.......The potential energy savings in refrigeration systems using energy optimal control has been proved to be substantial. This however requires an intelligent control that drives the refrigeration systems towards the energy optimal state. This paper proposes an approach for a control, which drives...
Flexible and generalized uncertainty optimization theory and methods
Lodwick, Weldon A
2017-01-01
This book presents the theory and methods of flexible and generalized uncertainty optimization. Particularly, it describes the theory of generalized uncertainty in the context of optimization modeling. The book starts with an overview of flexible and generalized uncertainty optimization. It covers uncertainties that are both associated with lack of information and that more general than stochastic theory, where well-defined distributions are assumed. Starting from families of distributions that are enclosed by upper and lower functions, the book presents construction methods for obtaining flexible and generalized uncertainty input data that can be used in a flexible and generalized uncertainty optimization model. It then describes the development of such a model in detail. All in all, the book provides the readers with the necessary background to understand flexible and generalized uncertainty optimization and develop their own optimization model. .
Extremal Optimization: Methods Derived from Co-Evolution
Boettcher, S.; Percus, A.G.
1999-07-13
We describe a general-purpose method for finding high-quality solutions to hard optimization problems, inspired by self-organized critical models of co-evolution such as the Bak-Sneppen model. The method, called Extremal Optimization, successively eliminates extremely undesirable components of sub-optimal solutions, rather than ''breeding'' better components. In contrast to Genetic Algorithms which operate on an entire ''gene-pool'' of possible solutions, Extremal Optimization improves on a single candidate solution by treating each of its components as species co-evolving according to Darwinian principles. Unlike Simulated Annealing, its non-equilibrium approach effects an algorithm requiring few parameters to tune. With only one adjustable parameter, its performance proves competitive with, and often superior to, more elaborate stochastic optimization procedures. We demonstrate it here on two classic hard optimization problems: graph partitioning and the traveling salesman problem.
Microstructure optimization design methods of the forging process and applications
WANG Guangchun; ZHAO Guoqun; GUAN Jing
2007-01-01
A microstructure optimization design method of the forging process is proposed. The optimization goal is the fine grain size and homogeneous grain distribution. The optimization object is the forging process parameters and the shape of the preform die. The grain size sub-objective function, the forgings shape sub-objective function and the whole objective function including the shape and the grain size are established, espectively. The detailed optimization steps are given. The microstructure optimization program is developed using the micro-genetic algorithm and the finite element method. Then, the upsetting process of the cylindrical billet is analyzed using a self-developed program. The forging parameters and the shape of preform die of the upsetting process are optimized respectively. The fine size and homogenous distribution of the grain can be achieved by controlling the shape of the preform die and improving the friction condition.
Optimized protein extraction methods for proteomic analysis of Rhizoctonia solani.
Lakshman, Dilip K; Natarajan, Savithiry S; Lakshman, Sukla; Garrett, Wesley M; Dhar, Arun K
2008-01-01
Rhizoctonia solani (Teleomorph: Thanatephorus cucumeris, T. praticola) is a basidiomycetous fungus and a major cause of root diseases of economically important plants. Various isolates of this fungus are also beneficially associated with orchids, may serve as biocontrol agents or remain as saprophytes with roles in decaying and recycling of soil organic matter. R. solani displays several hyphal anastomosis groups (AG) with distinct host and pathogenic specializations. Even though there are reports on the physiological and histological basis of Rhizoctonia-host interactions, very little is known about the molecular biology and control of gene expression early during infection by this pathogen. Proteamic technologies are powerful tools for examining alterations in protein profiles. To aid studies on its biology and host pathogen interactions, a two-dimensional (2-D) gel-based global proteomic study has been initiated. To develop an optimized protein extraction protocol for R. solani, we compared two previously reported protein extraction protocols for 2-D gel analysis of R. solani (AG-4) isolate Rs23. Both TCA-acetone precipitation and phosphate solubilization before TCA-acetone precipitation worked well for R. solani protein extraction, although selective enrichment of some proteins was noted with either method. About 450 spots could be detected with the densitiometric tracing of Coomassie blue-stained 2-D PAGE gels covering pH 4-7 and 6.5-205 kDa. Selected protein spots were subjected to mass spectrometric analysis with matrix-assisted laser desorption/ionization time-of-flight mass spectrometry (MALDI-TOF-MS). Eleven protein spots were positively identified based on peptide mass fingerprinting match with fungal proteins in public databases with the Mascot search engine. These results testify to the suitability of the two optimized protein extraction protocols for 2-D proteomic studies of R. solani.
Three-dimensional decomposition method of global atmospheric circulation
LIU HaiTao; HU ShuJuan; XU Ming; CHOU JiFan
2008-01-01
By adopting the idea of three-dimensional Walker, Hadley and Rossby stream functions, the global atmospheric circulation can be considered as the sum of three stream functions from a global perspective. Therefore, a mathematical model of three-dimensional decomposition of global atmospheric circulation is proposed and the existence and uniqueness of the model are proved. Besides, the model includes a numerical method leading to no truncation error in the discrete three-dimensional grid points. Results also show that the three-dimensional stream functions exist and are unique for a given velocity field. The mathematical model shows the generalized form of three-dimensional stream functions equal to the velocity field in representing the features of atmospheric motion. Besides, the vertical velocity calculated through the model can represent the main characteristics of the vertical motion. In sum, the three-dimensional decomposition of atmospheric circulation is convenient for the further investigation of the features of global atmospheric motions.
Total energy global optimizations using non orthogonal localized orbitals
Kim, J; Galli, G; Kim, Jeongnim; Mauri, Francesco; Galli, Giulia
1994-01-01
An energy functional for orbital based $O(N)$ calculations is proposed, which depends on a number of non orthogonal, localized orbitals larger than the number of occupied states in the system, and on a parameter, the electronic chemical potential, determining the number of electrons. We show that the minimization of the functional with respect to overlapping localized orbitals can be performed so as to attain directly the ground state energy, without being trapped at local minima. The present approach overcomes the multiple minima problem present within the original formulation of orbital based $O(N)$ methods; it therefore makes it possible to perform $O(N)$ calculations for an arbitrary system, without including any information about the system bonding properties in the construction of the input wavefunctions. Furthermore, while retaining the same computational cost as the original approach, our formulation allows one to improve the variational estimate of the ground state energy, and the energy conservation...
Polynomial method for PLL controller optimization.
Wang, Ta-Chung; Lall, Sanjay; Chiou, Tsung-Yu
2011-01-01
The Phase-Locked Loop (PLL) is a key component of modern electronic communication and control systems. PLL is designed to extract signals from transmission channels. It plays an important role in systems where it is required to estimate the phase of a received signal, such as carrier tracking from global positioning system satellites. In order to robustly provide centimeter-level accuracy, it is crucial for the PLL to estimate the instantaneous phase of an incoming signal which is usually buried in random noise or some type of interference. This paper presents an approach that utilizes the recent development in the semi-definite programming and sum-of-squares field. A Lyapunov function will be searched as the certificate of the pull-in range of the PLL system. Moreover, a polynomial design procedure is proposed to further refine the controller parameters for system response away from the equilibrium point. Several simulation results as well as an experiment result are provided to show the effectiveness of this approach.
Polynomial Method for PLL Controller Optimization
Tsung-Yu Chiou
2011-06-01
Full Text Available The Phase-Locked Loop (PLL is a key component of modern electronic communication and control systems. PLL is designed to extract signals from transmission channels. It plays an important role in systems where it is required to estimate the phase of a received signal, such as carrier tracking from global positioning system satellites. In order to robustly provide centimeter-level accuracy, it is crucial for the PLL to estimate the instantaneous phase of an incoming signal which is usually buried in random noise or some type of interference. This paper presents an approach that utilizes the recent development in the semi-definite programming and sum-of-squares field. A Lyapunov function will be searched as the certificate of the pull-in range of the PLL system. Moreover, a polynomial design procedure is proposed to further refine the controller parameters for system response away from the equilibrium point. Several simulation results as well as an experiment result are provided to show the effectiveness of this approach.
Qin Ni
2001-01-01
An NGTN method was proposed for solving large-scale sparse nonlinear programming (NLP) problems. This is a hybrid method of a truncated Newton direction and a modified negative gradient direction, which is suitable for handling sparse data structure and possesses Q-quadratic convergence rate. The global convergence of this new method is proved,the convergence rate is further analysed, and the detailed implementation is discussed in this paper. Some numerical tests for solving truss optimization and large sparse problems are reported. The theoretical and numerical results show that the new method is efficient for solving large-scale sparse NLP problems.
Numerical methods for control optimization in linear systems
Tyatyushkin, A. I.
2015-05-01
Numerical methods are considered for solving optimal control problems in linear systems, namely, terminal control problems with control and phase constraints and time-optimal control problems. Several algorithms with various computer storage requirements are proposed for solving these problems. The algorithms are intended for finding an optimal control in linear systems having certain features, for example, when the reachable set of a system has flat faces.
Method of product portfolio analysis based on optimization models
V.M. Lozyuk
2011-12-01
Full Text Available The research is devoted to optimization of the structure of product portfolio of trading company with using the principles of the investment modeling. We further developed the models of investment portfolio optimization, using the known Markowitz and Sharp methods to determine the optimal portfolio of trade company. Adapted to the goods market the models in this study could be applied to the business of trade companies.
Software for optimization using a sequential simplex method
Evandro Bona
2000-05-01
Full Text Available A computer program for process optimization influenced by continuous and qualitative variables was developed from the simplex method. Software was validated through case studies found in literature by predictive models with two distinct processes. The obtained results showed great concordance with values supplied by literature. The developed program is portable and friendly, and may be used in several optimization systems. Software complementation with other subroutines, as combined response optimization, may make its application more comprehensive.
A GLOBALLY DERIVATIVE-FREE DESCENT METHOD FOR NONLINEAR COMPLEMENTARITY PROBLEMS
Hou-duo Qi; Yu-zhong Zhang
2000-01-01
Based on a class of functions. which generalize the squared Fischer-Burmeister NCP function and have many desirable properties as the latter function has, we reformulate nonlinear complementarity problem (NCP for short) as an equivalent unconstrained optimization problem, for which we propose a derivative-free descent method in monotone case. We show its global convergence under some mild conditions. If F, the function involved in NCP, is Ro－function, the optimization problem has bounded level sets. A local property of the merit function is discussed. Finally, we report some numerical results.
Genetic algorithm and particle swarm optimization combined with Powell method
Bento, David; Pinho, Diana; Pereira, Ana I.; Lima, Rui
2013-10-01
In recent years, the population algorithms are becoming increasingly robust and easy to use, based on Darwin's Theory of Evolution, perform a search for the best solution around a population that will progress according to several generations. This paper present variants of hybrid genetic algorithm - Genetic Algorithm and a bio-inspired hybrid algorithm - Particle Swarm Optimization, both combined with the local method - Powell Method. The developed methods were tested with twelve test functions from unconstrained optimization context.
Reliability-based design optimization with Cross-Entropy method
Ghidey, Hiruy
2015-01-01
Implementation of the Cross-entropy (CE) method to solve reliability-based design optimization (RBDO) problems was investigated. The emphasis of this implementation method was to solve independently both the reliability and optimization sub-problems within the RBDO problem; therefore, the main aim of this study was to evaluate the performance of the Cross-entropy method in terms of efficiency and accuracy to solve RBDO problems. A numerical approach was followed in which the implementatio...
A Decentralized Variable Ordering Method for Distributed Constraint Optimization
2005-05-01
Either aproach can be used depending on how densely the nodes are connected inside blocks. If inside-block connec- tivity is sparse, the latter method ...A Decentralized Variable Ordering Method for Distributed Constraint Optimization Anton Chechetka Katia Sycara CMU-RI-TR-05-18 May 2005 Robotics...00-00-2005 4. TITLE AND SUBTITLE A Decentralized Variable Ordering Method for Distributed Constraint Optimization 5a. CONTRACT NUMBER 5b. GRANT
A Descent Gradient Method and Its Global Convergence
LIU Jin-kui
2014-01-01
Y Liu and C Storey(1992) proposed the famous LS conjugate gradient method which has good numerical results. However, the LS method has very weak convergence under the Wolfe-type line search. In this paper, we give a new descent gradient method based on the LS method. It can guarantee the sufficient descent property at each iteration and the global convergence under the strong Wolfe line search. Finally, we also present extensive preliminary numerical experiments to show the efficiency of the proposed method by comparing with the famous PRP+ method.
Enhancement of the downhill simplex method of optimization
Koshel, R. John
2002-12-01
The downhill simplex method of optimization is a "geometric" method to achieve function minimization. The standard algorithm uses arbitrary values for the deterministic factors that describe the "movement" of the simplex in the merit space. While it is a robust method of optimization, it is relatively slow to converge to local minima. However, its stability and the lack of use of derivatives make it useful for optical design optimization, especially for the field of illumination. This paper describes preliminary efforts of optimizing the performance of the simplex optimizer. This enhancement is accomplished by optimizing the various control factors: alpha (reflection), beta (contraction), and gamma (expansion). This effort is accomplished by investigating the "end game" of optimal design, i.e., the shape of the figure of merit space is parabolic in N-dimensions near local minima. The figure of merit for the control factor optimization is the number of iterations to achieve a solution in comparison to the same case using the standard control factors. This optimization is done for parabolic wells of order N equals 2 to 15. In this study it is shown that with the correct choice of the control factors, one can achieve up to a 35% improvement in convergence. Techniques using gradient weighting and the inclusion of additional control factors are proposed.
Optimal control for mathematical models of cancer therapies an application of geometric methods
Schättler, Heinz
2015-01-01
This book presents applications of geometric optimal control to real life biomedical problems with an emphasis on cancer treatments. A number of mathematical models for both classical and novel cancer treatments are presented as optimal control problems with the goal of constructing optimal protocols. The power of geometric methods is illustrated with fully worked out complete global solutions to these mathematically challenging problems. Elaborate constructions of optimal controls and corresponding system responses provide great examples of applications of the tools of geometric optimal control and the outcomes aid the design of simpler, practically realizable suboptimal protocols. The book blends mathematical rigor with practically important topics in an easily readable tutorial style. Graduate students and researchers in science and engineering, particularly biomathematics and more mathematical aspects of biomedical engineering, would find this book particularly useful.
Co-iterative augmented Hessian method for orbital optimization
Sun, Qiming
2016-01-01
Orbital optimization procedure is widely called in electronic structure simulation. To efficiently find the orbital optimization solution, we developed a new second order orbital optimization algorithm, co-iteration augmented Hessian (CIAH) method. In this method, the orbital optimization is embedded in the diagonalization procedure for augmented Hessian (AH) eigenvalue equation. Hessian approximations can be easily employed in this method to improve the computational costs. We numerically performed the CIAH algorithm with SCF convergence of 20 challenging systems and Boys localization of C60 molecule. We found that CIAH algorithm has better SCF convergence and less computational costs than direct inversion iterative subspace (DIIS) algorithm. The numerical tests suggest that CIAH is a stable, reliable and efficient algorithm for orbital optimization problem.
A hybrid optimization method for biplanar transverse gradient coil design
Qi Feng [Key Laboratory for Quantum Information and Measurements, Ministry of Education, School of Electronics Engineering and Computer Science, Peking University, Beijing 100871 (China); Tang Xin [Beijing Key Laboratory of Medical Physics and Engineering, Institute of Heavy Ion Physics, School of Physics, Peking University, Beijing 100871 (China); Jin Zhe [Key Laboratory for Quantum Information and Measurements, Ministry of Education, School of Electronics Engineering and Computer Science, Peking University, Beijing 100871 (China); Jiang Zhongde [Beijing Key Laboratory of Medical Physics and Engineering, Institute of Heavy Ion Physics, School of Physics, Peking University, Beijing 100871 (China); Shen Yifei [Key Laboratory for Quantum Information and Measurements, Ministry of Education, School of Electronics Engineering and Computer Science, Peking University, Beijing 100871 (China); Meng Bin [Key Laboratory for Quantum Information and Measurements, Ministry of Education, School of Electronics Engineering and Computer Science, Peking University, Beijing 100871 (China); Zu Donglin [Beijing Key Laboratory of Medical Physics and Engineering, Institute of Heavy Ion Physics, School of Physics, Peking University, Beijing 100871 (China); Wang Weimin [Key Laboratory for Quantum Information and Measurements, Ministry of Education, School of Electronics Engineering and Computer Science, Peking University, Beijing 100871 (China)
2007-05-07
The optimization of transverse gradient coils is one of the fundamental problems in designing magnetic resonance imaging gradient systems. A new approach is presented in this paper to optimize the transverse gradient coils' performance. First, in the traditional spherical harmonic target field method, high order coefficients, which are commonly ignored, are used in the first stage of the optimization process to give better homogeneity. Then, some cosine terms are introduced into the series expansion of stream function. These new terms provide simulated annealing optimization with new freedoms. Comparison between the traditional method and the optimized method shows that the inhomogeneity in the region of interest can be reduced from 5.03% to 1.39%, the coil efficiency increased from 3.83 to 6.31 mT m{sup -1} A{sup -1} and the minimum distance of these discrete coils raised from 1.54 to 3.16 mm.
Machine Self-Teaching Methods for Parameter Optimization.
1986-12-01
A199 285 MACHINE SELF- TEACHING METHODS FOR PARAMETER / OPTIMIZATION(U) NAVAL OCEAN SYSTEMS CENTER SAN DIEGO CA R A DILLARD DEC 86 NOSC/TR-1S39...Technical Document 1039 C) ,December 1986 Machine Self- Teaching Methods for Parameter Optimization Robin A. Dillard DTICS ELECTE MAY i01 STAra Approved...ELEMEWt NO PROECi’ No TASK NO ARC Locally FundedI I1 I TE (ewd* Seawmy Cft*Wi., Machine Self- Teaching Methods for Parameter Optimization it PERSONAL
On estimating workload in branch-and-bound global optimization algorithms
Berenguel, J.L.; Casado, L.G.; Garcia, I.; Hendrix, E.M.T.
2013-01-01
In general, solving Global Optimization (GO) problems by Branch-and-Bound (B&B) requires a huge computational capacity. Parallel execution is used to speed up the computing time. As in this type of algorithms, the foreseen computational workload (number of nodes in the B&B tree) changes
Process control and optimization with simple interval calculation method
Pomerantsev, A.; Rodionova, O.; Høskuldsson, Agnar
2006-01-01
the series of expanding PLS/SIC models in order to support the on-line process improvements. This method helps to predict the effect of planned actions on the product quality and thus enables passive quality control. We have also considered an optimization approach that proposes the correcting actions......Methods of process control and optimization are presented and illustrated with a real world example. The optimization methods are based on the PLS block modeling as well as on the simple interval calculation methods of interval prediction and object status classification. It is proposed to employ...... for the quality improvement in the course of production. The latter is an active quality optimization, which takes into account the actual history of the process. The advocate approach is allied to the conventional method of multivariate statistical process control (MSPC) as it also employs the historical process...
Method of generating features optimal to a dataset and classifier
Bruillard, Paul J.; Gosink, Luke J.; Jarman, Kenneth D.
2016-10-18
A method of generating features optimal to a particular dataset and classifier is disclosed. A dataset of messages is inputted and a classifier is selected. An algebra of features is encoded. Computable features that are capable of describing the dataset from the algebra of features are selected. Irredundant features that are optimal for the classifier and the dataset are selected.
Optimization of Nanostructuring Burnishing Technological Parameters by Taguchi Method
Kuznetsov, V. P.; Dmitriev, A. I.; Anisimova, G. S.; Semenova, Yu V.
2016-04-01
On the basis of application of Taguchi optimization method, an approach for researching influence of nanostructuring burnishing technological parameters, considering the surface layer microhardness criterion, is developed. Optimal values of burnishing force, feed and number of tool passes for hardened steel AISI 420 hardening treatment are defined.
Maximum super angle optimization method for array antenna pattern synthesis
Wu, Ji; Roederer, A. G
1991-01-01
Different optimization criteria related to antenna pattern synthesis are discussed. Based on the maximum criteria and vector space representation, a simple and efficient optimization method is presented for array and array fed reflector power pattern synthesis. A sector pattern synthesized by a 20...
Exact and useful optimization methods for microeconomics
Balder, E.J.
2011-01-01
This paper points out that the treatment of utility maximization in current textbooks on microeconomic theory is deficient in at least three respects: breadth of coverage, completeness-cum-coherence of solution methods and mathematical correctness. Improvements are suggested in the form of a Kuhn-Tu
Global optimal design of ground water monitoring network using embedded kriging.
Dhar, Anirban; Datta, Bithin
2009-01-01
We present a methodology for global optimal design of ground water quality monitoring networks using a linear mixed-integer formulation. The proposed methodology incorporates ordinary kriging (OK) within the decision model formulation for spatial estimation of contaminant concentration values. Different monitoring network design models incorporating concentration estimation error, variance estimation error, mass estimation error, error in locating plume centroid, and spatial coverage of the designed network are developed. A big-M technique is used for reformulating the monitoring network design model to a linear decision model while incorporating different objectives and OK equations. Global optimality of the solutions obtained for the monitoring network design can be ensured due to the linear mixed-integer programming formulations proposed. Performances of the proposed models are evaluated for both field and hypothetical illustrative systems. Evaluation results indicate that the proposed methodology performs satisfactorily. These performance evaluation results demonstrate the potential applicability of the proposed methodology for optimal ground water contaminant monitoring network design.
Detailed design of a lattice composite fuselage structure by a mixed optimization method
Liu, D.; Lohse-Busch, H.; Toropov, V.; Hühne, C.; Armani, U.
2016-10-01
In this article, a procedure for designing a lattice fuselage barrel is developed. It comprises three stages: first, topology optimization of an aircraft fuselage barrel is performed with respect to weight and structural performance to obtain the conceptual design. The interpretation of the optimal result is given to demonstrate the development of this new lattice airframe concept for the fuselage barrel. Subsequently, parametric optimization of the lattice aircraft fuselage barrel is carried out using genetic algorithms on metamodels generated with genetic programming from a 101-point optimal Latin hypercube design of experiments. The optimal design is achieved in terms of weight savings subject to stability, global stiffness and strain requirements, and then verified by the fine mesh finite element simulation of the lattice fuselage barrel. Finally, a practical design of the composite skin complying with the aircraft industry lay-up rules is presented. It is concluded that the mixed optimization method, combining topology optimization with the global metamodel-based approach, allows the problem to be solved with sufficient accuracy and provides the designers with a wealth of information on the structural behaviour of the novel anisogrid composite fuselage design.
Cho, Tae Min; Lee, Byung Chai [Korea Advanced Institute of Science and Technology, Daejeon (Korea, Republic of)
2010-01-15
In this study, an effective method for reliability-based design optimization (RBDO) is proposed enhancing sequential optimization and reliability assessment (SORA) method by convex approximations. In SORA, reliability estimation and deterministic optimization are performed sequentially. The sensitivity and function value of probabilistic constraint at the most probable point (MPP) are obtained in the reliability analysis loop. In this study, the convex approximations for probabilistic constraint are constructed by utilizing the sensitivity and function value of the probabilistic constraint at the MPP. Hence, the proposed method requires much less function evaluations of probabilistic constraints in the deterministic optimization than the original SORA method. The efficiency and accuracy of the proposed method were verified through numerical examples
Lattice Boltzmann method for shape optimization of fluid distributor
Wang, Limin; Luo, Lingai
2013-01-01
This paper presents the shape optimization of a flat-type arborescent fluid distributor for the purpose of process intensification. A shape optimization algorithm based on the lattice Boltzmann method (LBM) is proposed with the objective of decreasing the flow resistance of such distributor at the constraint of constant fluid volume. Prototypes of the initial distributor as well as the optimized one are designed. Fluid distribution and hydraulic characteristics of these distributors are investigated numerically. Results show that the pressure drop of the optimized distributor is between 15.9% and 25.1% lower than that of the initial reference while keeping a uniform flow distribution, demonstrating the process intensification in fluid distributor, and suggesting the interests of the proposed optimization algorithm in engineering optimal design.
Particle swarm optimization method for the control of a fleet of Unmanned Aerial Vehicles
Belkadi, A.; Ciarletta, L.; Theilliol, D.
2015-11-01
This paper concerns a control approach of a fleet of Unmanned Aerial Vehicles (UAV) based on virtual leader. Among others, optimization methods are used to develop the virtual leader control approach, particularly the particle swarm optimization method (PSO). The goal is to find optimal positions at each instant of each UAV to guarantee the best performance of a given task by minimizing a predefined objective function. The UAVs are able to organize themselves on a 2D plane in a predefined architecture, following a mission led by a virtual leader and simultaneously avoiding collisions between various vehicles of the group. The global proposed method is independent from the model or the control of a particular UAV. The method is tested in simulation on a group of UAVs whose model is treated as a double integrator. Test results for the different cases are presented.
Optimization Methods for Supply Chain Activities
Balasescu S.
2014-12-01
Full Text Available This paper approach the theme of supply chain activities for medium and large companies which run many operations and need many facilities. The first goal is to analyse the influence of optimisation methods of supply chain activities on the success rate for a business. The second goal is to compare some logistic strategies applied by companies with the same profile to see which is the most effective. The final goal is to show which is the necessity of strategic optimum for a company and how can be achieved the considering the demand uncertainty.
OPTIMAL SIGNAL PROCESSING METHODS IN GPR
Saeid Karamzadeh
2014-01-01
Full Text Available In the past three decades, a lot of various applications of Ground Penetrating Radar (GPR took place in real life. There are important challenges of this radar in civil applications and also in military applications. In this paper, the fundamentals of GPR systems will be covered and three important signal processing methods (Wavelet Transform, Matched Filter and Hilbert Huang will be compared to each other in order to get most accurate information about objects which are in subsurface or behind the wall.
Optimization Design based on BP Neural Network and GA Method
Bing Wang
2013-12-01
Full Text Available This study puts forward one kind optimization controlling solution method on complicated system. At first modeling using neural network then adopt the real data to structure the neural network model of pertinence, make the parameter to seek to the neural network model excellently by mixing GA finally, thus got intelligence to the complicated system to optimize and control. The method can identify network configuration and network training methods. By adopting the number coding and effectively reducing the network size and the network convergence time, increase the network training speed. The study provides this and optimizes relevant MATLAB procedure which controls the method, so long as adjust a little to the concrete problem, can believe this procedure well the optimization of the complicated system controls the problem in the reality of solving.
Gálvez, Akemi; Iglesias, Andrés; Cabellos, Luis
2014-01-01
The problem of data fitting is very important in many theoretical and applied fields. In this paper, we consider the problem of optimizing a weighted Bayesian energy functional for data fitting by using global-support approximating curves. By global-support curves we mean curves expressed as a linear combination of basis functions whose support is the whole domain of the problem, as opposed to other common approaches in CAD/CAM and computer graphics driven by piecewise functions (such as B-splines and NURBS) that provide local control of the shape of the curve. Our method applies a powerful nature-inspired metaheuristic algorithm called cuckoo search, introduced recently to solve optimization problems. A major advantage of this method is its simplicity: cuckoo search requires only two parameters, many fewer than other metaheuristic approaches, so the parameter tuning becomes a very simple task. The paper shows that this new approach can be successfully used to solve our optimization problem. To check the performance of our approach, it has been applied to five illustrative examples of different types, including open and closed 2D and 3D curves that exhibit challenging features, such as cusps and self-intersections. Our results show that the method performs pretty well, being able to solve our minimization problem in an astonishingly straightforward way.
Numerical methods for solving terminal optimal control problems
Gornov, A. Yu.; Tyatyushkin, A. I.; Finkelstein, E. A.
2016-02-01
Numerical methods for solving optimal control problems with equality constraints at the right end of the trajectory are discussed. Algorithms for optimal control search are proposed that are based on the multimethod technique for finding an approximate solution of prescribed accuracy that satisfies terminal conditions. High accuracy is achieved by applying a second-order method analogous to Newton's method or Bellman's quasilinearization method. In the solution of problems with direct control constraints, the variation of the control is computed using a finite-dimensional approximation of an auxiliary problem, which is solved by applying linear programming methods.
Research of the Optimization Methods for Mass Customization (MC)
无
2002-01-01
A group of graphical models and mathematical models a re used to describe the methods of mass customization (MC). The relationships am ong the models and methods are shown in Fig.1. Fig.1 Relationships among optimization methods for MCThe methods for MC relate to both of product and process, also customized quanti ty and deepness. The methods for MC are integrated by the work in the paper, whi ch can help to understand and use MC better. The optimization and standardization of product is the key for M...
Comparison of optimal design methods in inverse problems
Banks, H. T.; Holm, K.; Kappel, F.
2011-07-01
Typical optimal design methods for inverse or parameter estimation problems are designed to choose optimal sampling distributions through minimization of a specific cost function related to the resulting error in parameter estimates. It is hoped that the inverse problem will produce parameter estimates with increased accuracy using data collected according to the optimal sampling distribution. Here we formulate the classical optimal design problem in the context of general optimization problems over distributions of sampling times. We present a new Prohorov metric-based theoretical framework that permits one to treat succinctly and rigorously any optimal design criteria based on the Fisher information matrix. A fundamental approximation theory is also included in this framework. A new optimal design, SE-optimal design (standard error optimal design), is then introduced in the context of this framework. We compare this new design criterion with the more traditional D-optimal and E-optimal designs. The optimal sampling distributions from each design are used to compute and compare standard errors; the standard errors for parameters are computed using asymptotic theory or bootstrapping and the optimal mesh. We use three examples to illustrate ideas: the Verhulst-Pearl logistic population model (Banks H T and Tran H T 2009 Mathematical and Experimental Modeling of Physical and Biological Processes (Boca Raton, FL: Chapman and Hall/CRC)), the standard harmonic oscillator model (Banks H T and Tran H T 2009) and a popular glucose regulation model (Bergman R N, Ider Y Z, Bowden C R and Cobelli C 1979 Am. J. Physiol. 236 E667-77 De Gaetano A and Arino O 2000 J. Math. Biol. 40 136-68 Toffolo G, Bergman R N, Finegood D T, Bowden C R and Cobelli C 1980 Diabetes 29 979-90).
Zhang, Rui; Xie, Wen-Ming; Yu, Han-Qing; Li, Wen-Wei
2014-04-01
An improved multi-objective optimization (MOO) model was established and used for simultaneously optimizing the treatment cost and multiple effluent quality indexes (including effluent COD, NH4(+)-N, NO3(-)-N) of a municipal wastewater treatment plant (WWTP). Compared with previous models that were mainly based on the use of fixed decision factors and did not taken into account the treatment cost, this model introduces a relationship model based on back propagation algorithm to determine the set of decision factors according to the expected optimization targets. Thus, a more flexible and precise optimization of the treatment process was allowed. Moreover, a MOO of conflicting objectives (i.e., treatment cost and effluent quality) was achieved. Applying this method, an optimal balance between operating cost and effluent quality of a WWTP can be found. This model may offer a useful tool for optimized design and control of practical WWTPs.
A Filter Method for Nonlinear Semidefinite Programming with Global Convergence
Zhi Bin ZHU; Hua Li ZHU
2014-01-01
In this study, a new filter algorithm is presented for solving the nonlinear semidefinite programming. This algorithm is inspired by the classical sequential quadratic programming method. Unlike the traditional filter methods, the suffi cient descent is ensured by changing the step size instead of the trust region radius. Under some suitable conditions, the global convergence is obtained. In the end, some numerical experiments are given to show that the algorithm is eff ective.
An improved optimal elemental method for updating finite element models
Duan Zhongdong(段忠东); Spencer B.F.; Yan Guirong(闫桂荣); Ou Jinping(欧进萍)
2004-01-01
The optimal matrix method and optimal elemental method used to update finite element models may not provide accurate results. This situation occurs when the test modal model is incomplete, as is often the case in practice. An improved optimal elemental method is presented that defines a new objective function, and as a byproduct, circumvents the need for mass normalized modal shapes, which are also not readily available in practice. To solve the group of nonlinear equations created by the improved optimal method, the Lagrange multiplier method and Matlab function fmincon are employed. To deal with actual complex structures,the float-encoding genetic algorithm (FGA) is introduced to enhance the capability of the improved method. Two examples, a 7-degree of freedom (DOF) mass-spring system and a 53-DOF planar frame, respectively, are updated using the improved method.Thc example results demonstrate the advantages of the improved method over existing optimal methods, and show that the genetic algorithm is an effective way to update the models used for actual complex structures.
Fast optimization of binary clusters using a novel dynamic lattice searching method.
Wu, Xia; Cheng, Wen
2014-09-28
Global optimization of binary clusters has been a difficult task despite of much effort and many efficient methods. Directing toward two types of elements (i.e., homotop problem) in binary clusters, two classes of virtual dynamic lattices are constructed and a modified dynamic lattice searching (DLS) method, i.e., binary DLS (BDLS) method, is developed. However, it was found that the BDLS can only be utilized for the optimization of binary clusters with small sizes because homotop problem is hard to be solved without atomic exchange operation. Therefore, the iterated local search (ILS) method is adopted to solve homotop problem and an efficient method based on the BDLS method and ILS, named as BDLS-ILS, is presented for global optimization of binary clusters. In order to assess the efficiency of the proposed method, binary Lennard-Jones clusters with up to 100 atoms are investigated. Results show that the method is proved to be efficient. Furthermore, the BDLS-ILS method is also adopted to study the geometrical structures of (AuPd)79 clusters with DFT-fit parameters of Gupta potential.
Bijani, Rodrigo; Lelièvre, Peter G.; Ponte-Neto, Cosme F.; Farquharson, Colin G.
2017-05-01
This paper is concerned with the applicability of Pareto Multi-Objective Global Optimization (PMOGO) algorithms for solving different types of geophysical inverse problems. The standard deterministic approach is to combine the multiple objective functions (i.e. data misfit, regularization and joint coupling terms) in a weighted-sum aggregate objective function and minimize using local (decent-based) smooth optimization methods. This approach has some disadvantages: (1) appropriate weights must be determined for the aggregate, (2) the objective functions must be differentiable and (3) local minima entrapment may occur. PMOGO algorithms can overcome these drawbacks but introduce increased computational effort. Previous work has demonstrated how PMOGO algorithms can overcome the first issue for single data set geophysical inversion, that is, the trade-off between data misfit and model regularization. However, joint inversion, which can involve many weights in the aggregate, has seen little study. The advantage of PMOGO algorithms for the other two issues has yet to be addressed in the context of geophysical inversion. In this paper, we implement a PMOGO genetic algorithm and apply it to physical-property-, lithology- and surface-geometry-based inverse problems to demonstrate the advantages of using a global optimization strategy. Lithological inversions work on a mesh but use integer model parameters representing rock unit identifiers instead of continuous physical properties. Surface geometry inversions change the geometry of wireframe surfaces that represent the contacts between discrete rock units. Despite the potentially high computational requirements of global optimization algorithms (compared to local), their application to realistically sized 2-D geophysical inverse problems is within reach of current capacity of standard computers. Furthermore, they open the door to geophysical inverse problems that could not otherwise be considered through traditional
Bijani, Rodrigo; Lelièvre, Peter G.; Ponte-Neto, Cosme F.; Farquharson, Colin G.
2017-02-01
This paper is concerned with the applicability of Pareto Multi-Objective Global Optimization (PMOGO) algorithms for solving different types of geophysical inverse problems. The standard deterministic approach is to combine the multiple objective functions (i.e. data misfit, regularization and joint coupling terms) in a weighted-sum aggregate objective function and minimize using local (decent-based) smooth optimization methods. This approach has some disadvantages: 1) appropriate weights must be determined for the aggregate, 2) the objective functions must be differentiable, and 3) local minima entrapment may occur. PMOGO algorithms can overcome these drawbacks but introduce increased computational effort. Previous work has demonstrated how PMOGO algorithms can overcome the first issue for single data set geophysical inversion, i.e. the tradeoff between data misfit and model regularization. However, joint inversion, which can involve many weights in the aggregate, has seen little study. The advantage of PMOGO algorithms for the other two issues has yet to be addressed in the context of geophysical inversion. In this paper, we implement a PMOGO genetic algorithm and apply it to physical property-, lithology- and surface geometry-based inverse problems to demonstrate the advantages of using a global optimization strategy. Lithological inversions work on a mesh but use integer model parameters representing rock unit identifiers instead of continuous physical properties. Surface geometry inversions change the geometry of wireframe surfaces that represent the contacts between discrete rock units. Despite the potentially high computational requirements of global optimization algorithms (compared to local), their application to realistically-sized 2D geophysical inverse problems is within reach of current capacity of standard computers. Furthermore, they open the door to geophysical inverse problems that could not otherwise be considered through traditional optimization
A Numerical Embedding Method for Solving the Nonlinear Optimization Problem
田保锋; 戴云仙; 孟泽红; 张建军
2003-01-01
A numerical embedding method was proposed for solving the nonlinear optimization problem. By using the nonsmooth theory, the existence and the continuation of the following path for the corresponding homotopy equations were proved. Therefore the basic theory for the algorithm of the numerical embedding method for solving the non-linear optimization problem was established. Based on the theoretical results, a numerical embedding algorithm was designed for solving the nonlinear optimization problem, and prove its convergence carefully. Numerical experiments show that the algorithm is effective.
Liu Jinkui
2011-01-01
Full Text Available Abstract In this paper, an efficient modified nonlinear conjugate gradient method for solving unconstrained optimization problems is proposed. An attractive property of the modified method is that the generated direction in each step is always descending without any line search. The global convergence result of the modified method is established under the general Wolfe line search condition. Numerical results show that the modified method is efficient and stationary by comparing with the well-known Polak-Ribiére-Polyak method, CG-DESCENT method and DSP-CG method using the unconstrained optimization problems from More and Garbow (ACM Trans Math Softw 7, 17-41, 1981, so it can be widely used in scientific computation. Mathematics Subject Classification (2010 90C26 · 65H10
Method and system for SCR optimization
Lefebvre, Wesley Curt; Kohn, Daniel W.
2009-03-10
Methods and systems are provided for controlling SCR performance in a boiler. The boiler includes one or more generally cross sectional areas. Each cross sectional area can be characterized by one or more profiles of one or more conditions affecting SCR performance and be associated with one or more adjustable desired profiles of the one or more conditions during the operation of the boiler. The performance of the boiler can be characterized by boiler performance parameters. A system in accordance with one or more embodiments of the invention can include a controller input for receiving a performance goal for the boiler corresponding to at least one of the boiler performance parameters and for receiving data values corresponding to boiler control variables and to the boiler performance parameters. The boiler control variables include one or more current profiles of the one or more conditions. The system also includes a system model that relates one or more profiles of the one or more conditions in the boiler to the boiler performance parameters. The system also includes an indirect controller that determines one or more desired profiles of the one or more conditions to satisfy the performance goal for the boiler. The indirect controller uses the system model, the received data values and the received performance goal to determine the one or more desired profiles of the one or more conditions. The system model also includes a controller output that outputs the one or more desired profiles of the one or more conditions.
Local Approximation and Hierarchical Methods for Stochastic Optimization
Cheng, Bolong
In this thesis, we present local and hierarchical approximation methods for two classes of stochastic optimization problems: optimal learning and Markov decision processes. For the optimal learning problem class, we introduce a locally linear model with radial basis function for estimating the posterior mean of the unknown objective function. The method uses a compact representation of the function which avoids storing the entire history, as is typically required by nonparametric methods. We derive a knowledge gradient policy with the locally parametric model, which maximizes the expected value of information. We show the policy is asymptotically optimal in theory, and experimental works suggests that the method can reliably find the optimal solution on a range of test functions. For the Markov decision processes problem class, we are motivated by an application where we want to co-optimize a battery for multiple revenue, in particular energy arbitrage and frequency regulation. The nature of this problem requires the battery to make charging and discharging decisions at different time scales while accounting for the stochastic information such as load demand, electricity prices, and regulation signals. Computing the exact optimal policy becomes intractable due to the large state space and the number of time steps. We propose two methods to circumvent the computation bottleneck. First, we propose a nested MDP model that structure the co-optimization problem into smaller sub-problems with reduced state space. This new model allows us to understand how the battery behaves down to the two-second dynamics (that of the frequency regulation market). Second, we introduce a low-rank value function approximation for backward dynamic programming. This new method only requires computing the exact value function for a small subset of the state space and approximate the entire value function via low-rank matrix completion. We test these methods on historical price data from the
Sergeyev, Yaroslav D; Grimaldi, Domenico; Molinaro, Anna
2011-01-01
In this paper we introduce a common problem in electronic measurements and electrical engineering: finding the first root from the left of an equation in the presence of some initial conditions. We present examples of electrotechnical devices (analog signal filtering), where it is necessary to solve it. Two new methods for solving this problem, based on global optimization ideas, are introduced. The first uses the exact a priori given global Lipschitz constant for the first derivative. The second method adaptively estimates local Lipschitz constants during the search. Both algorithms either find the first root from the left or determine the global minimizers (in the case when the objective function has no roots). Sufficient conditions for convergence of the new methods to the desired solution are established in both cases. The results of numerical experiments for real problems and a set of test functions are also presented.
Thickness optimization of laminated composites using the discrete material optimization method
Sørensen, Søren Nørgaard; Sørensen, Rene; Lund, Erik
2012-01-01
This work concerns a novel large scale multi-material topology optimization method for simultaneous determination of the optimum variable integer thickness and fiber orientation throughout laminated composites with fixed outer geometries while adhering to certain manufacturing constraints....... The conceptual combinatorial/integer problem is relaxed to a continuous problem and solved on basis of the so-called Discrete Material Optimization method, explicitly including the manufacturing constraints as linear constraints....
Jin Ji
2014-11-01
Full Text Available The inlet structure is the main part of an electrostatic precipitator, so its mechanical properties, including the static strength, stiffness, and vibration characteristics, play an important role in the structural safety. In order to achieve good mechanical performance and lightweight of the inlet structure, an optimal design method, which is based on growth mechanism of the branching systems in nature and optimality criteria, named the improved adaptive growth method, is suggested. The method is applied to optimize the stiffener layout of the inlet structure, and the multiobjective optimization mathematical model which consists of the minimum compliance and the maximum natural frequency is considered. The optimality criteria method is applied to solve the design problem. The design result shows that the suggested method is effective, compared with the empirical design of the inlet structure, the weight of the optimal structure is reduced by 3.0%, while the global stiffness and the first natural frequency are increased by 18.83% and 4.66%, respectively.
Method for Determining Optimal Residential Energy Efficiency Retrofit Packages
Polly, B.; Gestwick, M.; Bianchi, M.; Anderson, R.; Horowitz, S.; Christensen, C.; Judkoff, R.
2011-04-01
Businesses, government agencies, consumers, policy makers, and utilities currently have limited access to occupant-, building-, and location-specific recommendations for optimal energy retrofit packages, as defined by estimated costs and energy savings. This report describes an analysis method for determining optimal residential energy efficiency retrofit packages and, as an illustrative example, applies the analysis method to a 1960s-era home in eight U.S. cities covering a range of International Energy Conservation Code (IECC) climate regions. The method uses an optimization scheme that considers average energy use (determined from building energy simulations) and equivalent annual cost to recommend optimal retrofit packages specific to the building, occupants, and location. Energy savings and incremental costs are calculated relative to a minimum upgrade reference scenario, which accounts for efficiency upgrades that would occur in the absence of a retrofit because of equipment wear-out and replacement with current minimum standards.
Optimization of multi-revolution low-thrust transfer based on modified direct method
CUI Ping-yuan; SHANG Hai-bin; REN Yuan; LUAN En-jie
2008-01-01
A modified direct optimization method is proposed to solve the optimal muhi-revolution transfer with low-thrust between Earth-orbits. First, through parametefizing the control steering angles by costate variables, the search space of free parameters has been decreased. Then, in order to obtain the global optimal solution ef-fectively and robustly, the simulated annealing and penalty function strategies were used to handle the con-straints, and a GA/SQP hybrid optimization algorithm was utilized to solve the parameter optimization problem, in which, a feasible suboptimal solution obtained by GA was submitted as an initial parameter set to SQP for re-finement. Comparing to the classical direct method, this novel method has fewer free parameters, needs not ini-tial guesses, and has higher computation precision. An optimal-fuel transfer problem from LEO to GEO was taken as an example to validate the proposed approach. The results of simulation indicate that our approach is a-vailable to solve the problem of optimal multi-revolution transfer between Earth-orbits.
GOSIM: A multi-scale iterative multiple-point statistics algorithm with global optimization
Yang, Liang; Hou, Weisheng; Cui, Chanjie; Cui, Jie
2016-04-01
Most current multiple-point statistics (MPS) algorithms are based on a sequential simulation procedure, during which grid values are updated according to the local data events. Because the realization is updated only once during the sequential process, errors that occur while updating data events cannot be corrected. Error accumulation during simulations decreases the realization quality. Aimed at improving simulation quality, this study presents an MPS algorithm based on global optimization, called GOSIM. An objective function is defined for representing the dissimilarity between a realization and the TI in GOSIM, which is minimized by a multi-scale EM-like iterative method that contains an E-step and M-step in each iteration. The E-step searches for TI patterns that are most similar to the realization and match the conditioning data. A modified PatchMatch algorithm is used to accelerate the search process in E-step. M-step updates the realization based on the most similar patterns found in E-step and matches the global statistics of TI. During categorical data simulation, k-means clustering is used for transforming the obtained continuous realization into a categorical realization. The qualitative and quantitative comparison results of GOSIM, MS-CCSIM and SNESIM suggest that GOSIM has a better pattern reproduction ability for both unconditional and conditional simulations. A sensitivity analysis illustrates that pattern size significantly impacts the time costs and simulation quality. In conditional simulations, the weights of conditioning data should be as small as possible to maintain a good simulation quality. The study shows that big iteration numbers at coarser scales increase simulation quality and small iteration numbers at finer scales significantly save simulation time.
Weitian Lin
2014-01-01
Full Text Available Particle swarm optimization algorithm (PSOA is an advantage optimization tool. However, it has a tendency to get stuck in a near optimal solution especially for middle and large size problems and it is difficult to improve solution accuracy by fine-tuning parameters. According to the insufficiency, this paper researches the local and global search combine particle swarm algorithm (LGSCPSOA, and its convergence and obtains its convergence qualification. At the same time, it is tested with a set of 8 benchmark continuous functions and compared their optimization results with original particle swarm algorithm (OPSOA. Experimental results indicate that the LGSCPSOA improves the search performance especially on the middle and large size benchmark functions significantly.
Optimal satellite sampling to resolve global-scale dynamics in the I-T system
Rowland, D. E.; Zesta, E.; Connor, H. K.; Pfaff, R. F., Jr.
2016-12-01
The recent Decadal Survey highlighted the need for multipoint measurements of ion-neutral coupling processes to study the pathways by which solar wind energy drives dynamics in the I-T system. The emphasis in the Decadal Survey is on global-scale dynamics and processes, and in particular, mission concepts making use of multiple identical spacecraft in low earth orbit were considered for the GDC and DYNAMIC missions. This presentation will provide quantitative assessments of the optimal spacecraft sampling needed to significantly advance our knowledge of I-T dynamics on the global scale.We will examine storm time and quiet time conditions as simulated by global circulation models, and determine how well various candidate satellite constellations and satellite schemes can quantify the plasma and neutral convection patterns and global-scale distributions of plasma density, neutral density, and composition, and their response to changes in the IMF. While the global circulation models are data-starved, and do not contain all the physics that we might expect to observe with a global-scale constellation mission, they are nonetheless an excellent "starting point" for discussions of the implementation of such a mission. The result will be of great utility for the design of future missions, such as GDC, to study the global-scale dynamics of the I-T system.
On some other preferred method for optimizing the welded joint
Pejović Branko B.
2016-01-01
Full Text Available The paper shows an example of performed optimization of sizes in terms of welding costs in a characteristic loaded welded joint. Hence, in the first stage, the variables and constant parameters are defined, and mathematical shape of the optimization function is determined. The following stage of the procedure defines and places the most important constraint functions that limit the design of structures, that the technologist and the designer should take into account. Subsequently, a mathematical optimization model of the problem is derived, that is efficiently solved by a proposed method of geometric programming. Further, a mathematically based thorough optimization algorithm is developed of the proposed method, with a main set of equations defining the problem that are valid under certain conditions. Thus, the primary task of optimization is reduced to the dual task through a corresponding function, which is easier to solve than the primary task of the optimized objective function. The main reason for this is a derived set of linear equations. Apparently, a correlation is used between the optimal primary vector that minimizes the objective function and the dual vector that maximizes the dual function. The method is illustrated on a computational practical example with a different number of constraint functions. It is shown that for the case of a lower level of complexity, a solution is reached through an appropriate maximization of the dual function by mathematical analysis and differential calculus.
Biwei Tang
2016-05-01
Full Text Available Global path planning is a challenging issue in the filed of mobile robotics due to its complexity and the nature of nondeterministic polynomial-time hard (NP-hard. Particle swarm optimization (PSO has gained increasing popularity in global path planning due to its simplicity and high convergence speed. However, since the basic PSO has difficulties balancing exploration and exploitation, and suffers from stagnation, its efficiency in solving global path planning may be restricted. Aiming at overcoming these drawbacks and solving the global path planning problem efficiently, this paper proposes a hybrid PSO algorithm that hybridizes PSO and differential evolution (DE algorithms. To dynamically adjust the exploration and exploitation abilities of the hybrid PSO, a novel PSO, the nonlinear time-varying PSO (NTVPSO, is proposed for updating the velocities and positions of particles in the hybrid PSO. In an attempt to avoid stagnation, a modified DE, the ranking-based self adaptive DE (RBSADE, is developed to evolve the personal best experience of particles in the hybrid PSO. The proposed algorithm is compared with four state-of-the-art evolutionary algorithms. Simulation results show that the proposed algorithm is highly competitive in terms of path optimality and can be considered as a vital alternative for solving global path planning.
Mente, Carsten; Prade, Ina; Brusch, Lutz; Breier, Georg; Deutsch, Andreas
2011-07-01
Lattice-gas cellular automata (LGCAs) can serve as stochastic mathematical models for collective behavior (e.g. pattern formation) emerging in populations of interacting cells. In this paper, a two-phase optimization algorithm for global parameter estimation in LGCA models is presented. In the first phase, local minima are identified through gradient-based optimization. Algorithmic differentiation is adopted to calculate the necessary gradient information. In the second phase, for global optimization of the parameter set, a multi-level single-linkage method is used. As an example, the parameter estimation algorithm is applied to a LGCA model for early in vitro angiogenic pattern formation.
Cai, Lanlan; Li, Peng; Luo, Qi; Zhai, Pengcheng; Zhang, Qingjie
2017-03-01
As no single thermoelectric material has presented a high figure-of-merit (ZT) over a very wide temperature range, segmented thermoelectric generators (STEGs), where the p- and n-legs are formed of different thermoelectric material segments joined in series, have been developed to improve the performance of thermoelectric generators. A crucial but difficult problem in a STEG design is to determine the optimal values of the geometrical parameters, like the relative lengths of each segment and the cross-sectional area ratio of the n- and p-legs. Herein, a multi-parameter and nonlinear optimization method, based on the Improved Powell Algorithm in conjunction with the discrete numerical model, was implemented to solve the STEG's geometrical optimization problem. The multi-parameter optimal results were validated by comparison with the optimal outcomes obtained from the single-parameter optimization method. Finally, the effect of the hot- and cold-junction temperatures on the geometry optimization was investigated. Results show that the optimal geometry parameters for maximizing the specific output power of a STEG are different from those for maximizing the conversion efficiency. Data also suggest that the optimal geometry parameters and the interfacial temperatures of the adjacent segments optimized for maximum specific output power or conversion efficiency vary with changing hot- and cold-junction temperatures. Through the geometry optimization, the CoSb3/Bi2Te3-based STEG can obtain a maximum specific output power up to 1725.3 W/kg and a maximum efficiency of 13.4% when operating at a hot-junction temperature of 823 K and a cold-junction temperature of 298 K.
A weak Hamiltonian finite element method for optimal control problems
Hodges, Dewey H.; Bless, Robert R.
1990-01-01
A temporal finite element method based on a mixed form of the Hamiltonian weak principle is developed for dynamics and optimal control problems. The mixed form of Hamilton's weak principle contains both displacements and momenta as primary variables that are expanded in terms of nodal values and simple polynomial shape functions. Unlike other forms of Hamilton's principle, however, time derivatives of the momenta and displacements do not appear therein; instead, only the virtual momenta and virtual displacements are differentiated with respect to time. Based on the duality that is observed to exist between the mixed form of Hamilton's weak principle and variational principles governing classical optimal control problems, a temporal finite element formulation of the latter can be developed in a rather straightforward manner. Several well-known problems in dynamics and optimal control are illustrated. The example dynamics problem involves a time-marching problem. As optimal control examples, elementary trajectory optimization problems are treated.
Weak Hamiltonian finite element method for optimal control problems
Hodges, Dewey H.; Bless, Robert R.
1991-01-01
A temporal finite element method based on a mixed form of the Hamiltonian weak principle is developed for dynamics and optimal control problems. The mixed form of Hamilton's weak principle contains both displacements and momenta as primary variables that are expanded in terms of nodal values and simple polynomial shape functions. Unlike other forms of Hamilton's principle, however, time derivatives of the momenta and displacements do not appear therein; instead, only the virtual momenta and virtual displacements are differentiated with respect to time. Based on the duality that is observed to exist between the mixed form of Hamilton's weak principle and variational principles governing classical optimal control problems, a temporal finite element formulation of the latter can be developed in a rather straightforward manner. Several well-known problems in dynamics and optimal control are illustrated. The example dynamics problem involves a time-marching problem. As optimal control examples, elementary trajectory optimization problems are treated.
Efficient Hybrid Optimal Design Method for Power Electronics Converters
AUTHOR|(SzGeCERN)697719; Aguglia, Davide; Viarouge, Philippe; Cros, Jérôme
2015-01-01
This paper presents a novel design methodology for dimensioning optimal power-electronic converters, which is able to achieve the precision of numerical simulation-based optimization procedures, however minimizing the overall computation time. The approach is based on the utilization of analytical and frequency-domain design models for a numerical optimization process, a validation with numerical simulations of the intermediate optimal solutions, and the correction of the analytical design models precision from the numerical simulation results. This method allows using the numerical simulation in an efficient way, where typically less than ten correction iterations are required. In order to demonstrate the performances of the proposed methodology, the calculation of the control parameters for an H-bridge DC-DC converter and the optimal dimensioning of a damped output filter for a buck converter using the proposed approach is presented.
Nonlinear system identification with global and local soft computing methods
Runkler, T.A. [Siemens AG, Muenchen (Germany). Zentralabt. Technik Information und Kommunikation
2000-10-01
An important step in the design of control systems is system identification. Data driven system identification finds functional models for the system's input output behavior. Regression methods are simple and effective, but may cause overshoots for complicated characteristics. Neural network approaches such as the multilayer perceptron yield very accurate models, but are black box approaches which leads to problems in system and stability analysis. In contrast to these global modeling methods crisp and fuzzy rule bases represent local models that can be extracted from data by clustering methods. Depending on the type and number of models different degrees of model accuracy can be achieved. (orig.)
Robust Collaborative Optimization Method Based on Dual-response Surface
WANG Wei; FAN Wenhui; CHANG Tianqing; YUAN Yuming
2009-01-01
A novel method for robust collaborative design of complex products based on dual-response surface (DRS-RCO) is proposed to solve multidisciplinary design optimization (MDO) problems under uncertainty. Collaborative optimization (CO) which decomposes the whole system into a double-level nonlinear optimization problem is widely Accepted as an efficient method to solve MDO problems. In order to improve the quality of complex product in design process, robust collaborative optimization (RCO) is developed to solve those problems under uncertain conditions. RCO does opfmiTation on the linear sum of mean and standard deviation of objective function and gets an optimal solution with high robustnmess. Response surfaces method is an important way to do approximation in robust design. DRS-RCO is an improved RCO method in which dual-response surface replaces system uncertainty analysis module of CO. The dual-response surface is the approximate model of mean and standard deviation of objective function respectively. In DRS-RCO, All the information of subsystems is included in dual-response surfaces. As an additional item, the standard deviation of objective function is added to the subsystem optimization. This item guarantee both the mean and standard deviation of this subsystem is reaching the minima at the same time. Finally, a test problem with two coupled subsystems is conducted to verify the feasibility and effectiveness of DRS-RCO.
Optimal explicit strong-stability-preserving general linear methods : complete results.
Constantinescu, E. M.; Sandu, A.; Mathematics and Computer Science; Virginia Polytechnic Inst. and State Univ.
2009-03-03
This paper constructs strong-stability-preserving general linear time-stepping methods that are well suited for hyperbolic PDEs discretized by the method of lines. These methods generalize both Runge-Kutta (RK) and linear multistep schemes. They have high stage orders and hence are less susceptible than RK methods to order reduction from source terms or nonhomogeneous boundary conditions. A global optimization strategy is used to find the most efficient schemes that have low storage requirements. Numerical results illustrate the theoretical findings.
METHOD BASED ON DUAL-QUADRATIC PROGRAMMING FOR FRAME STRUCTURAL OPTIMIZATION WITH LARGE SCALE
无
2006-01-01
The optimality criteria (OC) method and mathematical programming (MP)were combined to found the sectional optimization model of frame structures. Different methods were adopted to deal with the different constraints. The stress constraints as local constraints were approached by zero-order approximation and transformed into movable sectional lower limits with the full stress criterion. The displacement constraints as global constraints were transformed into explicit expressions with the unit virtual load method. Thus an approximate explicit model for the sectional optimization of frame structures was built with stress and displacement constraints. To improve the resolution efficiency, the dual-quadratic programming was adopted to transform the original optimization model into a dual problem according to the dual theory and solved iteratively in its dual space. A method called approximate scaling step was adopted to reduce computations and smooth the iterative process. Negative constraints were deleted to reduce the size of the optimization model. With MSC/Nastran software as structural solver and MSC/Patran software as developing platform, the sectional optimization software of frame structures was accomplished, considering stress and displacement constraints. The examples show that the efficiency and accuracy are improved.
A Hybrid LBFGS-DE Algorithm for Global Optimization of the Lennard-Jones Cluster Problem
Ernesto Padernal Adorio
2004-12-01
Full Text Available The Lennard-Jones cluster conformation problem is to determine a configuration of n atoms in three-dimensional space where the sum of the nonlinear pairwise potential function is at a minimum. In this formula, ri,j is the distance between atoms i and j. This optimization problem is a severe test for global optimization algorithms due to its computational complexity: the number of local minima grows exponentially large as the number of atoms in the cluster is increased. As a specific test case, a better cluster configuration than the previously published putative minimum for the 38-atom case was found in the mid-1990s.
Global optimization of truss topology with discrete bar areas—Part I: Theory of relaxed problems
Achtziger, Wolfgang; Stolpe, Mathias
2008-01-01
. The main issue of the paper and of the approach lies in the fact that the relaxed nonlinear optimization problem can be formulated as a quadratic program (QP). Here the paper generalizes and extends the available theory from the literature. Although the Hessian of this QP is indefinite, it is possible...... to circumvent the non-convexity and to calculate global optimizers. Moreover, the QPs to be treated in the branch-and-bound search tree differ from each other just in the objective function. In Part I we give an introduction to the problem and collect all theory and related proofs for the treatment...
De-tong Zhu
2001-01-01
In this paper we modify type approximate trust region methods via two curvilinear paths for unconstrained optimization. A mixed strategy using both trust region and line search techniques is adopted which switches to back tracking steps when a trial step produced by the trust region subproblem is unacceptable. We give a series of properties of both optimal path and modified gradient path. The global convergence and fast local convergence rate of the proposed algorithms are established under some reasonable conditions. A nonmonotonic criterion is used to speed up the convergence progress in some ill-conditioned cases.
RELATIVE CAMERA POSE ESTIMATION METHOD USING OPTIMIZATION ON THE MANIFOLD
C. Cheng
2017-05-01
Full Text Available To solve the problem of relative camera pose estimation, a method using optimization with respect to the manifold is proposed. Firstly from maximum-a-posteriori (MAP model to nonlinear least squares (NLS model, the general state estimation model using optimization is derived. Then the camera pose estimation model is applied to the general state estimation model, while the parameterization of rigid body transformation is represented by Lie group/algebra. The jacobian of point-pose model with respect to Lie group/algebra is derived in detail and thus the optimization model of rigid body transformation is established. Experimental results show that compared with the original algorithms, the approaches with optimization can obtain higher accuracy both in rotation and translation, while avoiding the singularity of Euler angle parameterization of rotation. Thus the proposed method can estimate relative camera pose with high accuracy and robustness.
Development of optimization method for plate heat exchanger with undulation
Dvořák Václav
2016-01-01
Full Text Available The article deals with optimization of undulated heat transfer surface of plate heat exchanger. The goal of optimization is not only to increase effectiveness of heat transfer but also to reduce the pressure drop. A combined pattern of undulation which combines herringbone pattern and wavy pattern was optimized and best values of four parameters were found; angle of herringbone pattern, number, phase and amplitude of longitudinal waves of wavy pattern. The optimization procedure looked for maximum of objective function which was a linear combination of effectiveness and pressure drop. We used simple Monte Carlo method and the optimum was searched for four values of reference pressure drop. Four different optimization were run and we investigated the effect of various definition of objective function and parameters of undulation. It was found that during optimization of combined pattern, the herringbone pattern is more favoured than wavy pattern. It is caused by the fact that herringbone pattern was described by the only one free parameter, which was the angle of undulation, and therefore it is more likely to be found by a stochastic method. This assumption was confirmed when simple wavy pattern was optimized and higher values of objective function and effectiveness were found.
Optimization methods and silicon solar cell numerical models
Girardini, K.
1986-01-01
The goal of this project is the development of an optimization algorithm for use with a solar cell model. It is possible to simultaneously vary design variables such as impurity concentrations, front junction depth, back junctions depth, and cell thickness to maximize the predicted cell efficiency. An optimization algorithm has been developed and interfaced with the Solar Cell Analysis Program in 1 Dimension (SCAPID). SCAPID uses finite difference methods to solve the differential equations which, along with several relations from the physics of semiconductors, describe mathematically the operation of a solar cell. A major obstacle is that the numerical methods used in SCAPID require a significant amount of computer time, and during an optimization the model is called iteratively until the design variables converge to the value associated with the maximum efficiency. This problem has been alleviated by designing an optimization code specifically for use with numerically intensive simulations, to reduce the number of times the efficiency has to be calculated to achieve convergence to the optimal solution. Adapting SCAPID so that it could be called iteratively by the optimization code provided another means of reducing the cpu time required to complete an optimization. Instead of calculating the entire I-V curve, as is usually done in SCAPID, only the efficiency is calculated (maximum power voltage and current) and the solution from previous calculations is used to initiate the next solution.
A class of trust-region methods for parallel optimization
P. D. Hough; J. C. Meza
1999-03-01
The authors present a new class of optimization methods that incorporates a Parallel Direct Search (PDS) method within a trust-region Newton framework. This approach combines the inherent parallelism of PDS with the rapid and robust convergence properties of Newton methods. Numerical tests have yielded favorable results for both standard test problems and engineering applications. In addition, the new method appears to be more robust in the presence of noisy functions that are inherent in many engineering simulations.
Research for Global Coordinating Method of Large Equipment Scheduling in Construction Site
Yao Ruojun
2015-01-01
Full Text Available Much energy is dissipated when large equipment moves slowly. Generally, equipment scheduling at construction site is supposed to minimize equipment slowdown and deadhead moving. Table methods are always adopted to optimize transfer sequence, but the feasible solution is well disappointing. For the acceptable solution relevant to task points in construction equipment scheduling, transfer table is divided into four regions. After proper augmentation and deflation, the acceptable solution evolves into global coordinating solution of construction scheduling, which contributes to minimizing slowdown and deadhead mileages. This method has been verified in practical engineering and is a significant reference on decision making of construction equipment scheduling.
System Design Support by Optimization Method Using Stochastic Process
Yoshida, Hiroaki; Yamaguchi, Katsuhito; Ishikawa, Yoshio
We proposed the new optimization method based on stochastic process. The characteristics of this method are to obtain the approximate solution of the optimum solution as an expected value. In numerical calculation, a kind of Monte Carlo method is used to obtain the solution because of stochastic process. Then, it can obtain the probability distribution of the design variable because it is generated in the probability that design variables were in proportion to the evaluation function value. This probability distribution shows the influence of design variables on the evaluation function value. This probability distribution is the information which is very useful for the system design. In this paper, it is shown the proposed method is useful for not only the optimization but also the system design. The flight trajectory optimization problem for the hang-glider is shown as an example of the numerical calculation.
Optimal Combination of Aircraft Maintenance Tasks by a Novel Simplex Optimization Method
Huaiyuan Li
2015-01-01
Full Text Available Combining maintenance tasks into work packages is not only necessary for arranging maintenance activities, but also critical for the reduction of maintenance cost. In order to optimize the combination of maintenance tasks by fuzzy C-means clustering algorithm, an improved fuzzy C-means clustering model is introduced in this paper. In order to reduce the dimension, variables representing clustering centers are eliminated in the improved cluster model. So the improved clustering model can be directly solved by the optimization method. To optimize the clustering model, a novel nonlinear simplex optimization method is also proposed in this paper. The novel method searches along all rays emitting from the center to each vertex, and those search directions are rightly n+1 positive basis. The algorithm has both theoretical convergence and good experimental effect. Taking the optimal combination of some maintenance tasks of a certain aircraft as an instance, the novel simplex optimization method and the clustering model both exhibit excellent performance.
Optimal Route Selection Method Based on Vague Sets
GUO Rui; DU Li min; WANG Chun
2015-01-01
Optimal route selection is an important function of vehicle trac flow guidance system. Its core is to determine the index weight for measuring the route merits and to determine the evaluation method for selecting route. In this paper, subjective weighting method which relies on driver preference is used to determine the weight and the paper proposes the multi-criteria weighted decision method based on vague sets for selecting the optimal route. Examples show that, the usage of vague sets to describe route index value can provide more decision-making information for route selection.
The optimization of global fault tolerant trajectory for redundant manipulator based on self-motion
Zhang Jian
2015-01-01
Full Text Available The redundancy feature of manipulators provides the possibility for the fault tolerant trajectory planning. Aiming at the completion of the specific task, an algorithm of global fault tolerant trajectory optimization for redundant manipulator based on the self-motion is proposed in this paper. Firstly, inverse kinematics equation of single redundancy manipulator based on self-motion variable and null-space velocity array of Jacobian are analyzed. Secondly, the mathematical description of fault tolerance criteria of the configuration of manipulator is established and the fault tolerance configuration group of manipulator is obtained by using iteration traversal under the fault tolerance criteria. Then, considering the joint limits and minimum the energy consumption as the optimization target, the global fault tolerant joint trajectory is achieved. Finally, simulation for 7 degree of freedom (DOF manipulator is performed, by which the effectiveness of the algorithm is validated.
Deterministic operations research models and methods in linear optimization
Rader, David J
2013-01-01
Uniquely blends mathematical theory and algorithm design for understanding and modeling real-world problems Optimization modeling and algorithms are key components to problem-solving across various fields of research, from operations research and mathematics to computer science and engineering. Addressing the importance of the algorithm design process. Deterministic Operations Research focuses on the design of solution methods for both continuous and discrete linear optimization problems. The result is a clear-cut resource for understanding three cornerstones of deterministic operations resear
Adaptive Mixed Finite Element Methods for Parabolic Optimal Control Problems
Zuliang Lu
2011-01-01
We will investigate the adaptive mixed finite element methods for parabolic optimal control problems. The state and the costate are approximated by the lowest-order Raviart-Thomas mixed finite element spaces, and the control is approximated by piecewise constant elements. We derive a posteriori error estimates of the mixed finite element solutions for optimal control problems. Such a posteriori error estimates can be used to construct more efficient and reliable adaptive mixed finite element ...
Pechak, Celia M; Thompson, Mary
2009-11-01
There is growing involvement by US clinicians, faculty members, and students in global health initiatives, including international service-learning (ISL). Limited research has been done to examine the profession's increasing global engagement, or the ISL phenomenon in particular, and no research has been done to determine best practices. This study was intended as an early step in the examination of the physical therapy profession's role and activities in the global health arena within and beyond academics. The purposes of this study were: (1) to identify and analyze the common structures and processes among established ISL programs within physical therapist education programs and (2) to develop a conceptual model of optimal ISL within physical therapist education programs. A descriptive, exploratory study was completed using grounded theory. Telephone interviews were completed with 14 faculty members who had been involved in international service, international learning, or ISL in physical therapist education programs. Interviews were transcribed, and transcriptions were analyzed using the grounded theory method. Four major themes emerged from the data: structure, reciprocity, relationship, and sustainability. A conceptual model of and a proposed definition for optimal ISL in physical therapist education were developed. Seven essential components of the conceptual model are: a partner that understands the role of physical therapy, community-identified needs, explicit service and learning objectives, reflection, preparation, risk management, and service and learning outcome measures. Essential consequences are positive effects on students and community. The conceptual model and definition of optimal ISL can be used to direct development of new ISL programs and to improve existing programs. In addition, they can offer substantive guidance to any physical therapist involved in global health initiatives.
Linear study of global microinstabilities using spectral and PIC methods
Brunner, S.; Fivaz, M.; Vaclavik, J.; Appert, K.; Tran, T.M. [Ecole Polytechnique Federale, Lausanne (Switzerland). Centre de Recherche en Physique des Plasma (CRPP)
1996-09-01
A spectral as well as a time evolution PIC code are presently being developed to solve the linearized gyrokinetic equations for studying global microinstabilities in toroidal geometry. In many ways these two methods are complementary and therefore allow for valuable cross-checking and validation of the different approximations made. This parallel approach forms a firm basis for future studies of non-linear evolution or higher dimensional systems. (author) 7 figs., 18 refs.
Cost optimal river dike design using probabilistic methods
Bischiniotis, K.; Kanning, W.; Jonkman, S.N.
2014-01-01
This research focuses on the optimization of river dikes using probabilistic methods. Its aim is to develop a generic method that automatically estimates the failure probabilities of many river dike cross-sections and gives the one with the least cost, taking into account the boundary conditions and
Multiplier methods for optimization problems with Lipschitzian derivatives
Izmailov, A. F.; Kurennoy, A. S.
2012-12-01
Optimization problems for which the objective function and the constraints have locally Lipschitzian derivatives but are not assumed to be twice differentiable are examined. For such problems, analyses of the local convergence and the convergence rate of the multiplier (or the augmented Lagrangian) method and the linearly constraint Lagrangian method are given.
The piecewise constant method in gait design through optimization
Yizhen Wei
2014-01-01
The objective of this paper is to introduce the piecewise constant method in gait design of a planar, under actuated, five-link biped robot model and to discuss the advantages and disadvantages. The piecewise constant method transforms the dynamic optimal control problem into a static problem.
An intermediate targets method for time parallelization in optimal control
Maday, Yvon; Riahi, Kamel
2011-01-01
In this paper, we present a method that enables to solve in parallel the Euler-Lagrange system associated with the optimal control of a parabolic equation. Our approach is based on an iterative update of a sequence of intermediate targets and gives rise independent sub-problems that can be solved in parallel. Numerical experiments show the efficiency of our method.
Cost optimal river dike design using probabilistic methods
Bischiniotis, K.; Kanning, W.; Jonkman, S.N.
2014-01-01
This research focuses on the optimization of river dikes using probabilistic methods. Its aim is to develop a generic method that automatically estimates the failure probabilities of many river dike cross-sections and gives the one with the least cost, taking into account the boundary conditions and
A Combined Method in Parameters Optimization of Hydrocyclone
Jing-an Feng
2016-01-01
Full Text Available To achieve efficient separation of calcium hydroxide and impurities in carbide slag by using hydrocyclone, the physical granularity property of carbide slag, hydrocyclone operation parameters for slurry concentration, and the slurry velocity inlet are designed to be optimized. The optimization methods are combined with the Design of Experiment (DOE method and the Computational Fluid Dynamics (CFD method. Based on Design Expert software, the central composite design (CCD with three factors and five levels amounting to five groups of 20 test responses was constructed, and the experiments were performed by numerical simulation software FLUENT. Through the analysis of variance deduced from numerical simulation experiment results, the regression equations of pressure drop, overflow concentration, purity, and separation efficiencies of two solid phases were, respectively, obtained. The influences of factors were analyzed by the responses, respectively. Finally, optimized results were obtained by the multiobjective optimization method through the Design Expert software. Based on the optimized conditions, the validation test by numerical simulation and separation experiment were separately proceeded. The results proved that the combined method could be efficiently used in studying the hydrocyclone and it has a good performance in application engineering.
Optimization of digital breast tomosynthesis using the Taguchi method
Lee, Taewon; Min, Jonghwan; Cho, Seungryong [KAIST, Daejeon (Korea, Republic of). Dept. of Nuclear and Quantum Engineering
2011-07-01
Digital breast tomosynthesis (DBT) has been demonstrated to be a promising technique in early breast cancer detection. The DBT performance is generally affected by many factors including scanning parameters such as limited angle and limited dose value, and reconstruction method. Many investigators have studied the effects of those factors on image quality of DBT, and optimized the factors accordingly. The suggested scanning parameters, however, vary widely among the investigators. Optimization in DBT can be challenging partly due to the large number of parameters that are involved in the optimization, and also due to diverse imaging tasks under consideration. In this work, we propose an optimization method for DBT based on the Taguchi design-of-experiment method. It should be noted that we are not searching for a universal, optimum DBT technique, which we believe is very difficult if not impossible, but instead we would like to demonstrate that the Taguchi method provides an efficient and systematic way of optimizing many parameters for a given DBT system and a given imaging task. As a preliminary, we conducted a numerical simulation study, and showed that the Taguchi method effectively selected the (near-) optimum parameters for a mass detection task. (orig.)
A solution quality assessment method for swarm intelligence optimization algorithms.
Zhang, Zhaojun; Wang, Gai-Ge; Zou, Kuansheng; Zhang, Jianhua
2014-01-01
Nowadays, swarm intelligence optimization has become an important optimization tool and wildly used in many fields of application. In contrast to many successful applications, the theoretical foundation is rather weak. Therefore, there are still many problems to be solved. One problem is how to quantify the performance of algorithm in finite time, that is, how to evaluate the solution quality got by algorithm for practical problems. It greatly limits the application in practical problems. A solution quality assessment method for intelligent optimization is proposed in this paper. It is an experimental analysis method based on the analysis of search space and characteristic of algorithm itself. Instead of "value performance," the "ordinal performance" is used as evaluation criteria in this method. The feasible solutions were clustered according to distance to divide solution samples into several parts. Then, solution space and "good enough" set can be decomposed based on the clustering results. Last, using relative knowledge of statistics, the evaluation result can be got. To validate the proposed method, some intelligent algorithms such as ant colony optimization (ACO), particle swarm optimization (PSO), and artificial fish swarm algorithm (AFS) were taken to solve traveling salesman problem. Computational results indicate the feasibility of proposed method.
Global bifurcation investigation of an optimal velocity traffic model with driver reaction time
Orosz, Gábor; Wilson, R. Eddie; Krauskopf, Bernd
2004-08-01
We investigate an optimal velocity model which includes the reflex time of drivers. After an analytical study of the stability and local bifurcations of the steady-state solution, we apply numerical continuation techniques to investigate the global behavior of the system. Specifically, we find branches of oscillating solutions connecting Hopf bifurcation points, which may be super- or subcritical, depending on parameters. This analysis reveals several regions of multistability.
Three-dimensional decomposition method of global atmospheric circulation
2008-01-01
By adopting the idea of three-dimensional Walker, Hadley and Rossby stream functions, the global atmospheric circulation can be considered as the sum of three stream functions from a global per- spective. Therefore, a mathematical model of three-dimensional decomposition of global atmospheric circulation is proposed and the existence and uniqueness of the model are proved. Besides, the model includes a numerical method leading to no truncation error in the discrete three-dimensional grid points. Results also show that the three-dimensional stream functions exist and are unique for a given velocity field. The mathematical model shows the generalized form of three-dimensional stream func- tions equal to the velocity field in representing the features of atmospheric motion. Besides, the vertical velocity calculated through the model can represent the main characteristics of the vertical motion. In sum, the three-dimensional decomposition of atmospheric circulation is convenient for the further in- vestigation of the features of global atmospheric motions.
Derivation and Global Convergence for Memoryless Non-quasi-Newton Method%无记忆非拟Newton算法的导出和全局收敛性
焦宝聪; 于静静; 陈兰平
2009-01-01
In this paper, a new class of memoryless non-quasi-Newton method for solving un- constrained optimization problems is proposed, and the global convergence of this method with inexact line search is proved. Furthermore, we propose a hybrid method that mixes both the memoryless non-quasi-Newton method and the memoryless Perry-Shanno quasi-Newton method. The global convergence of this hybrid memoryless method is proved under mild assumptions. The initial results show that these new methods are efficient for the given test problems. Espe- cially the memoryless non-quasi-Newton method requires little storage and computation, so it is able to efficiently solve large scale optimization problems.