In this paper we present a derivative-free optimization algorithm for finite minimax problems. The algorithm calculates an approximate gradient for each of the active functions of the finite max function and uses these to generate an approximate subdifferential. The negative projection of 0 onto this set is used as a descent direction in an Armijo-like line search. We also present a robust version of the algorithm, which uses the ‘almost active’ functions of the finite max function in the calculation of the approximate subdifferential. Convergence results are presented for both algorithms, showing that either f(xk)→−∞ or every cluster point is a Clarke stationary point. Theoretical and numerical results are presented for three specific approximate gradients: the simplex gradient, the centered simplex gradient and the Gupal estimate of the gradient of the Steklov averaged function. A performance comparison is made between the regular and robust algorithms, the three approximate gradients, and a regular and robust stopping condition.
20 November 2009 in Physica A: Statistical Mechanics and its Applications
Passive coupling of adjacent structures is known to be an effective method to reduce undesirable vibrations and structural pounding effects. Past results have shown that reducing the number of dampers can considerably decrease the cost of implementation and does not significantly decrease the efficiency of the system. The main objective of this study was to find the optimal arrangement of a limited number of dampers to minimize interstorey drift. Five approaches to solving the resulting bi-level optimization problem are introduced and examined (exhaustive search, inserting dampers, inserting floors, locations of maximum relative velocity and a genetic algorithm) and the numerical efficiency of each method is examined. The results reveal that the inserting damper method is the most efficient and reliable method, particularly for tall structures. It was also found that increasing the number of dampers does not necessarily increase the efficiency of the system. In fact, increasing the number of dampers can exacerbate the dynamic response of the system.
Derivative-free optimization focuses on designing methods to solve optimization problems without the analytical knowledge of the function. In this paper, we consider the problem of designing derivative-free methods for finite minimax problems: min x max i=1, 2, …, N<texlscub>fi(x). In order to solve the problem efficiently, we seek to exploit the smooth substructure within the problem. Using ideas developed by Burke et al. [J.V. Burke, A.S. Lewis, and M.L. Overton, Approximating subdifferentials by random sampling of gradients, Math. Oper. Res. 27(3) (2002), pp. 567–584; J.V. Burke, A.S. Lewis, and M.L. Overton, A robust gradient sampling algorithm for nonsmooth, nonconvex optimization, SIAM J. Optim. 15(3) (2005), pp. 751–779 (electronic)], we create the idea of a robust simplex gradient descent direction and use it to accelerate convergence. Convergence is proven by showing that the resulting algorithm fits into the directional direct-search framework. Numerical tests demonstrate the algorithm's effectiveness on finite minimax problems.
Consumers of epidemiology may prefer to have one measure of risk arising from analysis of a 2-by-2 table. However, reporting a single measure of association, such as one odds ratio (OR) and 95% confidence interval, from a continuous exposure variable that was dichotomized withholds much potentially useful information. Results of this type of analysis are often reported for one such dichotomization, as if no other cutoffs were investigated or even possible.