People use eye movements extremely effectively to find objects of interest in a cluttered visual scene. Distracting, task-irrelevant attention capturing regions in the visual field should be avoided as they jeopardize the efficiency of search. In the current study, we used eye tracking to determine whether people are able to avoid making saccades to a predetermined visual area associated with a...

We shall assume that each problem function has sufficiently many continuous derivatives for any implicit assumptions that we make to hold. One of the most successful tools for solving problems of the form NLP and SIP is the penalty function. A penalty-function approach replaces the relevant problem by a suitably weighted combination of the objective function f(x) and functions representing viol...

The tables of the appendix provide additional numerical results. Table 1 summarizes simulation results for Q-SCAD, LS-SCAD, Q-MCP, LS-MCP with sample sizes 50, 100 and 200 for modeling the 0.7 conditional quantile for the heteroscedastic error setting described in Section 4 of the main paper. The MCP approaches, Q-MCP and LS-MCP, are the equivalent of Q-SCAD and LS-SCAD with the SCAD penalty fu...

| In this paper, we describe models and algorithms designed to produce eecient and physically consistent dynamic simulations. These models and algorithms have been implemented in a unique framework, modeling both deformations and contacts through visco-elastic relations. Since this model of interaction (known as \penalty based") is much debated, we present a compared study of two contact models...

In this paper, we consider scheduling of project networks under minimization of total weighted resource tardiness penalty costs. In this problem, we assume constrained resources are renewable and limited to very costly machines and tools which are also used in other projects and are not accessible in all periods of time of a project. In other words, there is a dictated ready date as well as a d...

Penalty takers in association football adopt either a keeper-independent or a keeper-dependent strategy, with the benefits of the keeper-independent strategy presumed to be greater. Yet, despite its relevance for research and practitioners, thus far no method for identifying penalty kick strategies has been available. To develop a validated and reliable method, Experiment 1 assessed characteris...

In this paper, we consider high ordermulti-domain penalty spectral Galerkin methods for the approximation of hyperbolic conservation laws. This formulation has a penalty parameter which can vary in space and time, allowing for flexibility in the penalty formulation. This flexibility is particularly advantageous for problems with an inhomogeneous mesh. We show that the discontinuous Galerkin met...

A criticism of Evolutionary Algorithms might be the lack of efficient and robust generic methods to handle constraints. The most widespread approach for constrained search problems is to use penalty methods, because of their simplicity and ease of implementation. The penalty function approach is generic and applicable to any type of constraint (linear or nonlinear). Nonetheless, the most diffic...

We present an interior-point penalty method for nonlinear programming (NLP), where the merit function consists of a piecewise linear penalty function (PLPF) and an `2-penalty function. The PLPF is defined by a set of penalty parameters that correspond to break points of the PLPF and are updated at every iteration. The `2-penalty function, like traditional penalty functions for NLP, is defined b...