A web-based tool to evaluate the iterative processes of direct search methods

Constrained and unconstrained Nonlinear Optimization Problems often appear in many engineering areas. In some of these cases it is not possible to use derivative based optimization methods because the objective function is not known or it is too complex or the objective function is non-smooth. In these cases derivative based methods cannot be used and Direct Search Methods might be the most suitable optimization methods. An Application Programming Interface (API) including some of these methods was implemented using Java Technology. This API can be accessed either by applications running in the same computer where it is installed or, it can be remotely accessed through a LAN or the Internet, using webservices. From the engineering point of view, the information needed from the API is the solution for the provided problem. On the other hand, from the optimization methods researchers’ point of view, not only the solution for the problem is needed. Also additional information about the iterative process is useful, such as: the number of iterations; the value of the solution at each iteration; the stopping criteria, etc. In this paper are presented the features added to the API to allow users to access to the iterative process data.

Detection of rifampin resistance patterns in Mycobacterium tuberculosis strains isolated in Iran by polymerase chain reaction-single-strand conformation polymorphism and direct sequencing methods

Mutations in the rpoB locus confer conformational changes leading to defective binding of rifampin (RIF) to rpoB and consequently resistance in Mycobacterium tuberculosis. Polymerase chain reaction-single-strand conformation polymorphism (PCR-SSCP) was established as a rapid screening test for the detection of mutations in the rpoB gene, and direct sequencing has been unambiguously applied to characterize mutations. A total of 37 of Iranian isolates of M. tuberculosis, 16 sensitive and 21 resistant to RIF, were used in this study. A 193-bp region of the rpoB gene was amplified and PCR-SSCP patterns were determined by electrophoresis in 10% acrylamide gel and silver staining. Also, 21 samples of 193-bp rpoB amplicons with different PCR-SSCP patterns from RIFr and 10 from RIFs were sequenced. Seven distinguishable PCR-SSCP patterns were recognized in the 21 Iranian RIFr strains, while 15 out of 16 RIFs isolates demonstrated PCR-SSCP banding patterns similar to that of sensitive standard strain H37Rv. However one of the sensitive isolates demonstrated a different pattern. There were seen six different mutations in the amplified region of rpoB gene: codon 516(GAC/GTC), 523(GGG/GGT), 526(CAC/TAC), 531(TCG/TTG), 511(CTG/TTG), and 512(AGC/TCG). This study demonstrated the high specificity (93.8%) and sensitivity (95.2%) of PCR-SSCP method for detection of mutation in rpoB gene; 85.7% of RIFr strains showed a single mutation and 14.3% had no mutations. Three strains showed mutations caused polymorphism. Our data support the common notion that rifampin resistance genotypes are generally present mutations in codons 531 and 526, most frequently found in M. tuberculosis populations regardless of geographic origin.

Distortional buckling of simple lipped channel in bending results of the experimental analysis versus direct strength methods

Cold-formed steel members are subject to failure caused by buckling, normally under loads smaller than those corresponding to partial or total yielding of the cross section. The buckling of members in bending can be classified as local or global, and the occurrence of one or the other type is expected by the members' geometric characteristics and by the constraints and load conditions. One of the local instability modes that can characterize a member's failure is distortional buckling of the cross section occurring on its own plane and involving lateral displacements and rotations. This paper presents and discusses the procedures and results obtained from experimental tests of cold-formed steel members under bending. Forty-eight beams were carried out on members in simple lipped channel, in pairs, with 6-meter spans and loads applied by concentrated forces at every 1/3 of the span. The thickness, width and dimensions, of the stiffeners were chosen so that the instability by distortion buckling of the cross section was the principal failure mode expected. The experimental results are compared with the obtained results by using the direct strength method.

Study of the interactions of Neptunium with humic substances and the clay mineral montmorillonite by direct and non direct speciation methods

For the safety assessment of radioactive waste, the possibility of radionuclide migration has to be considered. Since Np (and also Th due to the long-lived 232-Th) will be responsible for the greatest amount of radioactivity one million years after discharge from the reactor, its (im)-mobilization in the geosphere is of great importance. Furthermore, the chemistry of Np(V) is quite similar (but not identical) to the chemistry of Pu(V). Three species of neptunium may be found in the near field of the waste disposal, but pentavalent neptunium is the most abundant species under a wide range of natural conditions. Within this work, the interaction of Np(V) with the clay mineral montmorillonite and melanodins (as model substances for humic acids) was studied. The sorption of neptunium onto gibbsite, a model clay for montmorillonite, was also investigated. The sorption of neptunium onto γ-alumina and montmorillonite was studied in a parallel doctoral work by S. Dierking. Neptunium is only found in ultra trace amounts in the environment. Therefore, sensitive and specific methods are needed for its determination. The sorption was determined by γ spectroscopy and LSC for the whole concentration range studied. In addition the combination of these techniques with ultrafiltration allowed the study of Np(V) complexation with melanoidins. Regrettably, the available speciation methods (e.g. CE-ICP-MS and EXAFS) are not capable to detect the environmentally relevant neptunium concentrations. Therefore, a combination of batch experiments and speciation analyses was performed. Further, the preparation of hybrid clay-based materials (HCM) montmorillonitemelanoidins for sorption studies was achieved. The formation of hybrid materials begins in the interlayers of the montmorillonite, and then the organic material spreads over the surface of the mineral. The sorption of Np onto HCM was studied at the environmentally relevant concentrations and the results obtained were compared with those predicted by the linear additive model by Samadfam. The sorption of neptunium onto gibbsite was studied in batch experiments and the sorption maximum determined at pH~8.5. The sorption isotherm pointed to the presence of strong and weak sorption sites in gibbsite. The Np speciation was studied by using EXAFS, which showed that the sorbed species was Np(V). The influence of M42 type melanodins on the sorption of Np(V) onto montmorillonite was also investigated at pH 7. The sorption of the melanoidins was affected by the order in which the components were added and by ionic strength. The sorption of Np was affected by ionic strength, pointing to outer sphere sorption, whereas the presence of increasing amounts of melanoidins had little influence on Np sorption.

Relative accuracy and predictive ability of direct valuation methods, price to aggregate earnings method and a hybrid approach

In this paper, we assess the relative performance of the direct valuation method and industry multiplier models using 41 435 firm-quarter Value Line observations over an 11 year (1990–2000) period. Results from both pricingerror and return-prediction analyses indicate that direct valuation yields lower percentage pricing errors and greater return prediction ability than the forward price to aggregated forecasted earnings multiplier model. However, a simple hybrid combination of these two methods leads to more accurate intrinsic value estimates, compared to either method used in isolation. It would appear that fundamental analysis could benefit from using one approach as a check on the other.

Direct-search penalty/barrier methods

In Nonlinear Optimization Penalty and Barrier Methods are normally used to solve Constrained Problems. There are several Penalty/Barrier Methods and they are used in several areas from Engineering to Economy, through Biology, Chemistry, Physics among others. In these areas it often appears Optimization Problems in which the involved functions (objective and constraints) are non-smooth and/or their derivatives are not know. In this work some Penalty/Barrier functions are tested and compared, using in the internal process, Derivative-free, namely Direct Search, methods. This work is a part of a bigger project involving the development of an Application Programming Interface, that implements several Optimization Methods, to be used in applications that need to solve constrained and/or unconstrained Nonlinear Optimization Problems. Besides the use of it in applied mathematics research it is also to be used in engineering software packages.

Comparison of two cellular harvesting methods for primary human oral culture of keratinocytes

The possibility of obtaining transplantable oral epithelia opens new perspectives for oral treatments. Most of them are surgical, resulting in mucosal failures. As reconstructive material this in vitro epithelia would be also useful for other parts of the human body. Many researchers still use controversial methods; therefore it was evaluated and compared the efficiency of the enzymatic and direct explant methods to obtain oral keratinocytes. To this project oral epithelia fragments were used. This work compared: time needed for cell obtainment, best cell amount, life-span and epithelia forming cell capacity. The results showed the possibility to obtain keratinocytes from a small oral fragment and we could verify the advantages and peculiar restrictions. We concluded that under our conditions the enzymatic method showed the best results: in the cells obtaining time needed, cell amount and life-span. Both methods showed the same capacity to form in vitro epithelia.

Direct multisearch for multiobjective optimization

In practical applications of optimization it is common to have several conflicting objective functions to optimize. Frequently, these functions are subject to noise or can be of black-box type, preventing the use of derivative-based techniques. We propose a novel multiobjective derivative-free methodology, calling it direct multisearch (DMS), which does not aggregate any of the objective functions. Our framework is inspired by the search/poll paradigm of direct-search methods of directional type and uses the concept of Pareto dominance to maintain a list of nondominated points (from which the new iterates or poll centers are chosen). The aim of our method is to generate as many points in the Pareto front as possible from the polling procedure itself, while keeping the whole framework general enough to accommodate other disseminating strategies, in particular, when using the (here also) optional search step. DMS generalizes to multiobjective optimization (MOO) all direct-search methods of directional type. We prove under the common assumptions used in direct search for single objective optimization that at least one limit point of the sequence of iterates generated by DMS lies in (a stationary form of) the Pareto front. However, extensive computational experience has shown that our methodology has an impressive capability of generating the whole Pareto front, even without using a search step. Two by-products of this paper are (i) the development of a collection of test problems for MOO and (ii) the extension of performance and data profiles to MOO, allowing a comparison of several solvers on a large set of test problems, in terms of their efficiency and robustness to determine Pareto fronts.

Derivative-free optimization and filter methods to solve nonlinear constrained problems

In real optimization problems, usually the analytical expression of the objective function is not known, nor its derivatives, or they are complex. In these cases it becomes essential to use optimization methods where the calculation of the derivatives, or the verification of their existence, is not necessary: the Direct Search Methods or Derivative-free Methods are one solution. When the problem has constraints, penalty functions are often used. Unfortunately the choice of the penalty parameters is, frequently, very difficult, because most strategies for choosing it are heuristics strategies. As an alternative to penalty function appeared the filter methods. A filter algorithm introduces a function that aggregates the constrained violations and constructs a biobjective problem. In this problem the step is accepted if it either reduces the objective function or the constrained violation. This implies that the filter methods are less parameter dependent than a penalty function. In this work, we present a new direct search method, based on simplex methods, for general constrained optimization that combines the features of the simplex method and filter methods. This method does not compute or approximate any derivatives, penalty constants or Lagrange multipliers. The basic idea of simplex filter algorithm is to construct an initial simplex and use the simplex to drive the search. We illustrate the behavior of our algorithm through some examples. The proposed methods were implemented in Java.

Classification of some penalty methods

Optimization problems arise in science, engineering, economy, etc. and we need to find the best solutions for each reality. The methods used to solve these problems depend on several factors, including the amount and type of accessible information, the available algorithms for solving them, and, obviously, the intrinsic characteristics of the problem. There are many kinds of optimization problems and, consequently, many kinds of methods to solve them. When the involved functions are nonlinear and their derivatives are not known or are very difficult to calculate, these methods are more rare. These kinds of functions are frequently called black box functions. To solve such problems without constraints (unconstrained optimization), we can use direct search methods. These methods do not require any derivatives or approximations of them. But when the problem has constraints (nonlinear programming problems) and, additionally, the constraint functions are black box functions, it is much more difficult to find the most appropriate method. Penalty methods can then be used. They transform the original problem into a sequence of other problems, derived from the initial, all without constraints. Then this sequence of problems (without constraints) can be solved using the methods available for unconstrained optimization. In this chapter, we present a classification of some of the existing penalty methods and describe some of their assumptions and limitations. These methods allow the solving of optimization problems with continuous, discrete, and mixing constraints, without requiring continuity, differentiability, or convexity. Thus, penalty methods can be used as the first step in the resolution of constrained problems, by means of methods that typically are used by unconstrained problems. We also discuss a new class of penalty methods for nonlinear optimization, which adjust the penalty parameter dynamically.

Filters method in direct search optimization, new measures to admissibility

Constrained nonlinear optimization problems are usually solved using penalty or barrier methods combined with unconstrained optimization methods. Another alternative used to solve constrained nonlinear optimization problems is the lters method. Filters method, introduced by Fletcher and Ley er in 2002, have been widely used in several areas of constrained nonlinear optimization. These methods treat optimization problem as bi-objective attempts to minimize the objective function and a continuous function that aggregates the constraint violation functions. Audet and Dennis have presented the rst lters method for derivative-free nonlinear programming, based on pattern search methods. Motivated by this work we have de- veloped a new direct search method, based on simplex methods, for general constrained optimization, that combines the features of the simplex method and lters method. This work presents a new variant of these methods which combines the lters method with other direct search methods and are proposed some alternatives to aggregate the constraint violation functions.

Node adaptation for global collocation with radial basis functions using direct multisearch for multiobjective optimization

Meshless methods are used for their capability of producing excellent solutions without requiring a mesh, avoiding mesh related problems encountered in other numerical methods, such as finite elements. However, node placement is still an open question, specially in strong form collocation meshless methods. The number of used nodes can have a big influence on matrix size and therefore produce ill-conditioned matrices. In order to optimize node position and number, a direct multisearch technique for multiobjective optimization is used to optimize node distribution in the global collocation method using radial basis functions. The optimization method is applied to the bending of isotropic simply supported plates. Using as a starting condition a uniformly distributed grid, results show that the method is capable of reducing the number of nodes in the grid without compromising the accuracy of the solution. (C) 2013 Elsevier Ltd. All rights reserved.

GLODS: Global and Local Optimization using Direct Search

Locating and identifying points as global minimizers is, in general, a hard and time-consuming task. Difficulties increase in the impossibility of using the derivatives of the functions defining the problem. In this work, we propose a new class of methods suited for global derivative-free constrained optimization. Using direct search of directional type, the algorithm alternates between a search step, where potentially good regions are located, and a poll step where the previously located promising regions are explored. This exploitation is made through the launching of several instances of directional direct searches, one in each of the regions of interest. Differently from a simple multistart strategy, direct searches will merge when sufficiently close. The goal is to end with as many direct searches as the number of local minimizers, which would easily allow locating the global extreme value. We describe the algorithmic structure considered, present the corresponding convergence analysis and report numerical results, showing that the proposed method is competitive with currently commonly used global derivative-free optimization solvers.

The efficiency of different estimation methods of hydro-physical limits

The soil water available to crops is defined by specific values of water potential limits. Underlying the estimation of hydro-physical limits, identified as permanent wilting point (PWP) and field capacity (FC), is the selection of a suitable method based on a multi-criteria analysis that is not always clear and defined. In this kind of analysis, the time required for measurements must be taken into consideration as well as other external measurement factors, e.g., the reliability and suitability of the study area, measurement uncertainty, cost, effort and labour invested. In this paper, the efficiency of different methods for determining hydro-physical limits is evaluated by using indices that allow for the calculation of efficiency in terms of effort and cost. The analysis evaluates both direct determination methods (pressure plate - PP and water activity meter - WAM) and indirect estimation methods (pedotransfer functions - PTFs). The PTFs must be validated for the area of interest before use, but the time and cost associated with this validation are not included in the cost of analysis. Compared to the other methods, the combined use of PP and WAM to determine hydro-physical limits differs significantly in time and cost required and quality of information. For direct methods, increasing sample size significantly reduces cost and time. This paper assesses the effectiveness of combining a general analysis based on efficiency indices and more specific analyses based on the different influencing factors, which were considered separately so as not to mask potential benefits or drawbacks that are not evidenced in efficiency estimation.

The development of indigo reduction methods and pre-reduced indigo products

The continuing importance of blue denim maintains indigo as an important vat dye industrially. In this review, we examine the various methods that have been used in the past and are currently used to reduce and dissolve indigo for dyeing. We discuss recent insights into the bacterial fermentation technology, the advantages and disadvantages of the direct chemical methods that have predominated for the last century and potentially cleaner technologies of catalytic hydrogenation and electrochemistry, which are becoming increasingly important. With considerations of environmental impact high on the dyeing industry's agenda, we also discuss the developments that have led to the production of pre-reduced indigo.