Global optimization of univariate Lipschitz functions: II. New algorithms and computational comparison

We consider the following global optimization problems for a Lipschitz functionf implicitly defined on an interval [a, b]. Problem P: find a globally-optimal value off and a corresponding point; Problem Q: find a set of disjoint subintervals of [a, b] containing only points with a globally-optimal value and the union of which contains all globally optimal points. A two-phase algorithm is proposed for Problem P. In phase I, this algorithm obtains rapidly a solution which is often globally-optimal. Moreover, a sufficient condition onf for this to be the case is given. In phase II, the algorithm proves the-optimality of the solution obtained in phase I or finds a sequence of points of increasing value containing one with a globally-optimal value. The new algorithm is empirically compared (on twenty problems from the literature) with a best possible algorithm (for which the optimal value is assumed to be known), with a passive algorithm and with the algorithms of Evtushenko, Galperin, Shen and Zhu, Piyavskii, Timonov and Schoen. For small, the new algorithm requires only a few percent more function evaluations than the best possible one. An extended version of Piyavskii's algorithm is proposed for problem Q. A sufficient condition onf is given for the globally optimal points to be in one-to-one correspondance with the obtained intervals. This result is achieved for all twenty test problems.The research of the authors has been supported by AFOSR grants 0271 and 0066 to Rutgers University. Research of the second author has been also supported by NSERC grant GP0036426, FCAR grant 89EQ4144 and partially by AFOSR grant 0066. We thank Nicole Paradis for her help in drawing the figures.     

Spectroscopic and Quantum Mechanical Studies of Substituted Anilines and their Charge-Transfer Complexes with Iodine in Different Solvents

Summary. Equilibrium constants and molar extinction coefficients for 1:1 charge-transfer complexes between 2-hydroxyaniline (HA), 5-chloro-2-hydroxyaniline (CHA), and 4-bromo-2,6-dimethylaniline (BMA) as donors and iodine, as a typical σ-acceptor were determined spectrophotometrically in chloroform, dichloromethane, and carbontetrachloride solutions. Spectral characteristics and formation constants are discussed in terms of donor molecular structure and solvent polarity. The stoichiometry of the complexes was established to be 1:1. For this purpose, optical data were subjected to the form of the Rose-Drago equation for 1:1 equilibria. Electronic absorption spectra of the studied anilines were measured in different solvents. Spectral data were reported and band maxima were assigned to the appropriate molecular orbital transitions (π–π^* and n–π^* electronic transition). Solvent effects on the electronic transitions were discussed. Optimized geometry of the studied anilines was obtained at B3LYP/6-31 + G(d). The effect of the electronic factors of the substituents on the geometrical parameters of the ring has been explored. Geometrical values of the ring deviate from the regular hexagonal ring. Intramolecular H-bonds in HA and CHA have been computed at B3LYP/6-31 + G(d) and MP2/6-31 + G(d) levels. The H-bonding distance was calculated to be 2.105 ? in HA and 2.127 ? in CHA. Abstracted from her M.Sc. thesis     

原子荧光光谱法测定砷过程中还原反应条件的优化

自然界中砷和砷的化合物一般可通过水、大气和食物等途径进入人体,危害人体健康,原子荧光光谱法测定砷含量被广泛应用。为准确测定样品中砷的含量,以原子荧光光谱法(AFS)测定土壤中总砷含量为例,重点研究高价态砷(Ⅴ)还原为低价态砷(Ⅲ)的实验条件,采用正交实验进行条件优化,建立适合的实验方法。通过设计L9(34)正交实验,高价态砷的还原反应与四个因素有关,即与反应温度、反应时间、盐酸加入量和硫脲的用量呈一定的正相关,结果表明,四个因素中硫脲用量的影响最为显著,其次是盐酸加入量、反应时间和反应温度。通过对四个因素的多水平检验,优化后的实验条件为：硫脲用量2.0 mL、盐酸加入量10%、反应时间20 min、温度20～35 ℃(即普通室温)。采用土壤标准物质验证优化后条件的可行性,得出砷的测定值在标准值范围内,RSD在2.2%～4.2%,精密度和准确性均满足质控要求。优化后的实验条件使得操作简便易行,提高了工作效率。     

An Experimental Design Approach to Quantitative Expression for Quality Control of a Multicomponent Antidiabetic Formulation by the HILIC Method

A rapid and reproducible hydrophilic liquid chromatography (HILIC) process was established for concomitant determination of remogliflozin etabonate (RE), vildagliptin (VD), and metformin (MF) in a formulation. A face-centered central composite experimental design was employed to optimize and predict the chromatographic condition by statistically studying the surface response model and design space with desirability close to one. A HILIC column with a simple mobile phase of acetonitrile (65% v/v) and 20 mM phosphate buffer (35% v/v, pH 6, controlled with orthophosphoric acid) was used to separate RE, VD, and MF. RE, VD, and MF were separated in 3.6 min using an isocratic mode mobile phase flow at a flow rate of 1.4 mL at room temperature, and the analytes were examined by recording the absorption at 210 nm. The developed HILIC method was thoroughly validated for all parameters recommended by ICH, and linearity was observed in the ranges 20–150 µg/mL, 10–75 µg/mL, and 50–750 µg/mL for RE, VD, and MF, respectively, along with excellent regression coefficients (r² > 0.999). The calculated percentage relative deviation and relative error ascertained the precision and accuracy of the method. The selectivity and accuracy were further confirmed by the high percentage recovery of added standard drugs to the formulation using the standard addition technique. The robustness of the HILIC processes was confirmed by developing a half-normal probability plot and Pareto chart, as the slight variation of a single factor had no significant influence on the assay outcomes. Utilization of the optimized HILIC procedure for concurrent quantification of RE, VD, and MF in solid dosage forms showed accurate and reproducible results. Hence, the fast HILIC method can be regularly employed for the quality assurance of pharmaceutical preparations comprising RE, VD, and MF.     

Solubility Optimization of Loxoprofen as a Nonsteroidal Anti-Inflammatory Drug: Statistical Modeling and Optimization

Industrial-based application of supercritical CO₂ (SCCO₂) has emerged as a promising technology in numerous scientific fields due to offering brilliant advantages, such as simplicity of application, eco-friendliness, and high performance. Loxoprofen sodium (chemical formula C₁₅H₁₈O₃) is known as an efficient nonsteroidal anti-inflammatory drug (NSAID), which has been long propounded as an effective alleviator for various painful disorders like musculoskeletal conditions. Although experimental research plays an important role in obtaining drug solubility in SCCO₂, the emergence of operational disadvantages such as high cost and long-time process duration has motivated the researchers to develop mathematical models based on artificial intelligence (AI) to predict this important parameter. Three distinct models have been used on the data in this work, all of which were based on decision trees: K-nearest neighbors (KNN), NU support vector machine (NU-SVR), and Gaussian process regression (GPR). The data set has two input characteristics, P (pressure) and T (temperature), and a single output, Y = solubility. After implementing and fine-tuning to the hyperparameters of these ensemble models, their performance has been evaluated using a variety of measures. The R-squared scores of all three models are greater than 0.9, however, the RMSE error rates are 1.879 × 10⁻⁴, 7.814 × 10⁻⁵, and 1.664 × 10⁻⁴ for the KNN, NU-SVR, and GPR models, respectively. MAE metrics of 1.116 × 10⁻⁴, 6.197 × 10⁻⁵, and 8.777 × 10⁻⁵errors were also discovered for the KNN, NU-SVR, and GPR models, respectively. A study was also carried out to determine the best quantity of solubility, which can be referred to as the (x₁ = 40.0, x₂ = 338.0, Y = 1.27 × 10⁻³) vector.     

The shuttle dispatch problem with compound Poisson arrivals: Controls at two terminals

We consider the control of an infinite capacity shuttle which transports passengers between two terminals. The passengers arrive at each terminal according to a compound Poisson process and the travel time from one terminal to the other is a random variable following an arbitrary distribution. The following control limit policy is considered: dispatch the shuttle at terminali, at the instant that the total number of passengers waiting at terminali reaches or exceeds a predetermined control limitm _i . The objective of this paper is to obtain the mean waiting time of an arbitrary passenger at each terminal for given control valuesm ₁ andm ₂. We also discuss a search procedure to obtain the optimal control values which minimize the total expected cost per unit time under a linear cost structure.     

A note on adapting methods for continuous global optimization to the discrete case

In this note we show that various branch and bound methods for solving continuous global optimization problems can be readily adapted to the discrete case. As an illustration, we present an algorithm for minimizing a concave function over the integers contained in a compact polyhedron. Computational experience with this algorithm is reported.     

Stochastic approximation algorithm for minimax problems

A stochastic approximation algorithm for minimax optimization problems is analyzed. At each iterate, it performs one random experiment, based on which it computes a direction vector. It is shown that, under suitable conditions, it a.s. converges to the set of points satisfying necessary optimality conditions. The algorithm and its analysis bring together ideas from stochastic approximation and nondifferentiable optimization.     

Concurrent stochastic methods for global optimization

The global optimization problem, finding the lowest minimizer of a nonlinear function of several variables that has multiple local minimizers, appears well suited to concurrent computation. This paper presents a new parallel algorithm for the global optimization problem. The algorithm is a stochastic method related to the multi-level single-linkage methods of Rinnooy Kan and Timmer for sequential computers. Concurrency is achieved by partitioning the work of each of the three main parts of the algorithm, sampling, local minimization start point selection, and multiple local minimizations, among the processors. This parallelism is of a coarse grain type and is especially well suited to a local memory multiprocessing environment. The paper presents test results of a distributed implementation of this algorithm on a local area network of computer workstations. It also summarizes the theoretical properties of the algorithm.Research supported by AFOSR grant AFOSR-85-0251, ARO contract DAAG 29-84-K-0140, NSF grant DCR-8403483, and NSF cooperative agreement DCR-8420944.     

On the numerical solution of a class of Stackelberg problems

This study tries to develop two new approaches to the numerical solution of Stackelberg problems. In both of them the tools of nonsmooth analysis are extensively exploited; in particular we utilize some results concerning the differentiability of marginal functions and some stability results concerning the solutions of convex programs. The approaches are illustrated by simple examples and an optimum design problem with an elliptic variational inequality.Prepared while the author was visiting the Department of Mathematics, University of Bayreuth as a guest of the FSP Anwendungsbezogene Optimierung und Steuerung.