This note considers possible arrangements of the sectors of a generalised dartboard. The sum of the pth powers of the absolute differences of the numbers on adjacent sectors is introduced as a penalty cost function and a string reversal algorithm is used to determine all arrangements that maximise the penalty, for any p ≥ 1. The maximum value of the penalty function for p = 1 is well known in t...

The problem of minimizing by genetic algorithms the weight of a composite laminate subjected to various failure constraints is considered. Constraints are accounted for through penalty functions. The amount of penalty for each constraint violation is typically controlled by a penalty parameter that has a crucial innuence on the performance of the genetic algorithm. An optimal value of each pena...

We present a stochastic approximation algorithm based on penalty function method and a simultaneous perturbation gradient estimate for solving stochastic optimisation problems with general inequality constraints. We present a general convergence result that applies to a class of penalty functions including the quadratic penalty function, the augmented Lagrangian, and the absolute penalty functi...

Penalty functions are often used in constrained optimization. However, it is very difficult to strike the right balance between objective and penalty functions. This paper introduces a novel approach to balance objective and penalty functions stochastically, i.e., stochastic ranking, and presents a new view on penalty function methods in terms of the dominance of penalty and objective functions...

We present a stochastic approximation algorithm based on penalty function method and a simultaneous perturbation gradient estimate for solving stochastic optimization problems with general inequality constraints. We present a general convergence result that applies to a class of penalty functions including the quadratic penalty function, the augmented Lagrangian, and the absolute penalty functi...

The volume penalty method provides a simple, efficient approach for solving the incompressible Navier-Stokes equations in domains with boundaries or in the presence of moving objects. Despite the simplicity, the method suffers from poor convergence in the penalty parameter, thereby restricting accuracy of any numerical method. We demonstrate that one may achieve high order accuracy by introduci...

In this paper, we give a sufficient condition for the asymptotic convergence of penalty trajectories in convex programming with multiple solutions. We show that, for a wide class of penalty methods, the associated optimal trajectory converges to a particular solution of the original problem, characterized through a minimization selection principle. Our main assumption for this convergence resul...

We introduce stable multi-domain spectral penalty methods suitable for solving fractional partial differential equations with fractional derivatives of any order. The fractional derivative is approximated in each sub domain using orthogonal polynomials and stability of the scheme is achieved through weakly imposed boundary and interface conditions by using a penalty term. We discuss accuracy an...

In this paper, we consider the surplus process of the classical continuous time risk model containing an independent diffusion (Wiener) process. We generalize the defective renewal equation for the expected discounted function of a penalty at the time of ruin in Garber and Landry [Insurance: Math. Econ. 22 (1998) 263]. Then an asymptotic formula for the expected discounted penalty function is p...

This paper reviews research on decision-making behavior of both goalkeeper and penalty taker during penalty kick situations in association football. Specifically, it adopts an ecological dynamics perspective on the behavior of both penalty taker and goalkeeper exemplifying how each might constrain the other’s decisions. This conceptual framework is elucidated to suggest key ideas for designing ...