In this paper a nonlinear penalty method via a nonlinear Lagrangian function is introduced for semi-infinite programs. A convergence result is established which shows that the sequence of optimal values of nonlinear penalty problems converges to that of semi-infinite programs. Moreover a conceptual convergence result of a discretization method with an adaptive scheme for solving semi-infinite p...

We present existence and stability results for periodic solutions of quasilinear parabolic equation related to Leray-Lions’s type operators. To prove existence and localization, we use the penalty method; while for stability we use an approximation scheme.

Genetic algorithms (GAs) provide a convenient framework to search for good solutions for a wide range of problems that are typically difficult to solve by means of traditional optimization techniques. Their application in solving real-world engineering problems is becoming increasingly popular. A common drawback of this procedure is its poor ability to handle constraints while searching for goo...

Constraining 3D meshes to restricted classes is necessary in architectural and industrial design, but it can be very challenging to manipulate meshes while staying within these classes. Specifically, polyhedral meshes those having planar faces are very important, but also notoriously difficult to generate and manipulate efficiently. We describe an interactive method for computing, optimizing an...

We develop a flexible discrete-time hedging methodology that minimizes the expected value of any desired penalty function of the hedging error within a general regimeswitching framework. A numerical algorithm based on backward recursion allows for the sequential construction of an optimal hedging strategy. Numerical experiments comparing this and other methodologies show a relative expected pen...

Truck loading problems from practice tend to involve a lot of constraints. In automatically solving these problems, a rule set has to be compiled that governs the generation of valid solutions. This rule set is either defined manually, or distilled automatically by analyzing solutions of human planners. Van Rijn et al. describe an approach for automatically solving these problems using a manual...

Abstract. We study a quadratic C0 interior penalty method for the displacement obstacle problem of Kirchhoff plates with general Dirichlet boundary conditions on general polygonal domains. Under the conditions that the obstacles are sufficiently smooth and separated from each other and the boundary displacement, we prove that the magnitudes of the errors in the energy norm and the L∞ norm are O...

In this paper, mesh-free element free Galerkin (EFG) method is extended to solve two-dimensional potential flow problems. Two ideal fluid flow problems (i.e. flow over a rigid cylinder and flow over a sphere) have been formulated using variational approach. Penalty and Lagrange multiplier techniques have been utilized for the enforcement of essential boundary conditions. Four point Gauss quadra...

Classical penalty methods solve a sequence of unconstrained problems that put greater and greater stress on meeting the constraints. In the limit as the penalty constant tends to ∞, one recovers the constrained solution. In the exact penalty method, squared penalties are replaced by absolute value penalties, and the solution is recovered for a finite value of the penalty constant. In practice, ...