A GENERALIZED PENALTY METHOD FOR DIFFERENTIAL VARIATIONAL-HEMIVARIATIONAL INEQUALITIES

We consider a differential variational-hemivariational inequality with constraints,in the framework of reflexive Banach spaces.The existence of a unique mild solution of the inequality,together with its stability,was proved in[1].Here,we complete these results with existence,uniqueness and convergence results for an associated penalty-type method.To this end,we construct a sequence of perturbed differential variational-hemivariational inequalities governed by perturbed sets of constraints and penalty coefficients.We prove the unique solvability of each perturbed inequality as well as the convergence of its solution to the solution of the original inequality.Then,we consider a mathematical model which describes the equilibrium of a viscoelastic rod in unilateral contact.The weak formulation of the model is in a form of a differential variational-hemivariational inequality in which the unknowns are the displacement field and the history of the deformation.We apply our abstract penalty method in the study of this inequality and provide the corresponding mechanical interpretations.

Composite penalty method of a low order anisotropic nonconforming finite element for the Stokes problem

Composite penalty method of a low order anisotropic nonconforming quadrilateral finite element for the Stokes problem is presented. This method with a large penalty parameter can achieve the same accuracy as the stand method with a small penalty parameter and the convergence rate of this method is two times as that of the standard method under the condition of the same order penalty parameter. The superconvergence for velocity is established as well. The results of this paper are also valid to the most of the known nonconforming finite element methods.

A Two-Grid Technique for the Penalty Method of the Steady Navier-Stokes Equations

A two grid technique for solving the steady incompressible Navier Stokes equations in a penalty method was presented and the convergence of numerical solutions was analyzed. If a coarse size H and a fine size h satisfy H=O(h 13-s )(s=0(n=2);s=12(n=3), where n is a space dimension), this method has the same convergence accuracy as the usual finite element method. But the two grid method can save a lot of computation time for its brief calculation. Moreover, a numerical test was couducted in order to verify the correctness of above theoretical analysis.

Removing Splitting/Modeling Error in Projection/Penalty Methods for Navier-Stokes Simulations with Continuous Data Assimilation

We study continuous data assimilation(CDA)applied to projection and penalty methods for the Navier-Stokes(NS)equations.Penalty and projection methods are more efficient than consistent Ns discretizations,however are less accurate due to modeling error(penalty)and splitting error(projection).We show analytically and numerically that with measurement data and properly chosen parameters,CDA can effectively remove these splitting and modeling errors and provide long time optimally accurate solutions.

An Objective Penalty Method for Optimistic Bilevel Programming Problems

In this paper,we consider an optimistic nonlinear bilevel programming problem.Under some conditions,we first show that the sequence of solutions to penalty problems converges to the optimal solution of the original bilevel programming problem.We then present an objective penalty method to solve such a problem.Finally,some numerical experiments are performed to illustrate its feasibility.

A PRIORI AND A POSTERIORI ERROR ESTIMATES OF A WEAKLY OVER-PENALIZED INTERIOR PENALTY METHOD FOR NON-SELF-ADJOINT AND INDEFINITE PROBLEMS

In this paper, we study a weakly over-penalized interior penalty method for non-self- adjoint and indefinite problems. An optimal a priori error estimate in the energy norm is derived. In addition, we introduce a residual-based a posteriori error estimator, which is proved to be both reliable and efficient in the energy norm. Some numerical testes are presented to validate our theoretical analysis.

A New Variant of Penalty Method for Weak Linear Bilevel Programming Problems

We present a new variant of penalty method, which is different from the existing penalty methods, for solving the weak linear bilevel programming problems. We then transform it into a single-level optimization problem using Kuhn-Tucker optimality condition and discuss the relations between them. Finally, two examples are used to illustrate the feasibility of the proposed penalty method.

Finite Element Method Coupling Penalty Method for Flexural Shell Model

In this paper,we propose a conformingfinite element method coupling penalty method for the linearly elasticflexural shell to overcome computational dif-ficulties.We start with discretizing the displacement variable,i.e.,the two tangent components of the displacement are discretized by using conformingfinite elements(linear element),and the normal component of the displacement is discretized by us-ing conforming Hsieh-Clough-Tocher element(HCT element).Then,the existence,uniqueness,stability,convergence and a priori error estimate of the corresponding analyses are proven and analyzed.Finally,we present numerical experiments with a portion of the conical shell and a portion of the cylindrical shell to verify theoretical convergence results and demonstrate the effectiveness of the numerical scheme.

A Novel Iterative Penalty Method to Enforce Boundary Conditions in FiniteVolume POD-Galerkin Reduced Order Models for Fluid Dynamics Problems

A Finite-Volume based POD-Galerkin reduced ordermodel is developed for fluid dynamics problems where the(time-dependent)boundary conditions are controlled using two different boundary control strategies:the lifting function method,whose aim is to obtain homogeneous basis functions for the reduced basis space and the penalty method where the boundary conditions are enforced in the reduced order model using a penalty factor.The penalty method is improved by using an iterative solver for the determination of the penalty factor rather than tuning the factor with a sensitivity analysis or numerical experimentation.The boundary control methods are compared and tested for two cases:the classical lid driven cavity benchmark problem and a Y-junction flow case with two inlet channels and one outlet channel.The results show that the boundaries of the reduced order model can be controlled with the boundary control methods and the same order of accuracy is achieved for the velocity and pressure fields.Finally,the reduced order models are 270-308 times faster than the full ordermodels for the lid driven cavity test case and 13-24 times for the Y-junction test case.

A Space-Time Interior Penalty Discontinuous Galerkin Method for the Wave Equation

A new higher-order accurate space-time discontinuous Galerkin(DG)method using the interior penalty flux and discontinuous basis functions,both in space and in time,is pre-sented and fully analyzed for the second-order scalar wave equation.Special attention is given to the definition of the numerical fluxes since they are crucial for the stability and accuracy of the space-time DG method.The theoretical analysis shows that the DG discre-tization is stable and converges in a DG-norm on general unstructured and locally refined meshes,including local refinement in time.The space-time interior penalty DG discre-tization does not have a CFL-type restriction for stability.Optimal order of accuracy is obtained in the DG-norm if the mesh size h and the time stepΔt satisfy h≅CΔt,with C a positive constant.The optimal order of accuracy of the space-time DG discretization in the DG-norm is confirmed by calculations on several model problems.These calculations also show that for pth-order tensor product basis functions the convergence rate in the L∞and L2-norms is order p+1 for polynomial orders p=1 and p=3 and order p for polynomial order p=2.

A Weighted Multi-Domain Spectral Penalty Method with Inhomogeneous Grid for Supersonic Injective Cavity Flows

In[J.Comput.Phys.192(1),pp.325-354(2003)],we have developed a multidomain spectral method with stable and conservative penalty interface conditions for the numerical simulation of supersonic reactive recessed cavity flows with homogeneous grid.In this work,the previously developed methodology is generalized to inhomogeneous grid to simulate the two dimensional supersonic injector-cavity system.Non-physical modes in the solution generated at the domain interfaces due to the spatial grid inhomogeneity are minimized using the new weighted multi-domain spectral penalty method.The proposed method yields accurate and stable solutions of the injector-cavity system which agree well with experiments qualitatively.Through the direct numerical simulation of the injector-cavity system using the weighted method,the geometric effect of the cavity wall on pressure fluctuations is investigated.It is shown that the recessed slanted cavity attenuates pressure fluctuations inside cavity enabling the cavity to act potentially as a stable flameholder for scramjet engine.

Exactness of penalization for exact minimax penalty function method in nonconvex programming

The exact minimax penalty function method is used to solve a noncon- vex differentiable optimization problem with both inequality and equality constraints. The conditions for exactness of the penalization for the exact minimax penalty function method are established by assuming that the functions constituting the considered con- strained optimization problem are invex with respect to the same function η （with the exception of those equality constraints for which the associated Lagrange multipliers are negative these functions should be assumed to be incave with respect to η）. Thus, a threshold of the penalty parameter is given such that, for all penalty parameters exceeding this threshold, equivalence holds between the set of optimal solutions in the considered constrained optimization problem and the set of minimizer in its associated penalized problem with an exact minimax penalty function. It is shown that coercivity is not suf- ficient to prove the results.

THE CONVERGENCE OF APPROACH PENALTY FUNCTION METHOD FOR APPROXIMATE BILEVEL PROGRAMMING PROBLEM

In this paper, a new algorithm-approximate penalty function method is designed, which can be used to solve a bilevel optimization problem with linear constrained function. In this kind of bilevel optimization problem. the evaluation of the objective function is very difficult, so that only their approximate values can be obtained. This algorithm is obtained by combining penalty function method and approximation in bilevel programming. The presented algorithm is completely different from existing methods. That convergence for this algorithm is proved.

Exact Penalty Method for the Nonlinear Bilevel Programming Problem

In this paper,following the method of replacing the lower level problem with its Kuhn-Tucker optimality condition,we transform the nonlinear bilevel programming problem into a normal nonlinear programming problem with the complementary slackness constraint condition.Then,we get the penalized problem of the normal nonlinear programming problem by appending the complementary slackness condition to the upper level objective with a penalty.We prove that this penalty function is exact and the penalized problem and the nonlinear bilevel programming problem have the same global optimal solution set.Finally,we propose an algorithm for the nonlinear bilevel programming problem.The numerical results show that the algorithm is feasible and efficient.

APPLICATION OF PENALTY FUNCTION METHOD IN ISOPARANIETRIC HYBRID FINITE ELEMENT ANALYSIS

By the aid of the penalty function method, the equilibrium restriction conditions were introduced to the isoparametric hybrid finite element analysis, and the concrete application course of the penalty function method in three-dimensional isoparametdc hybrid finite element was discussed. The separated penalty parameters method and the optimal hybrid element model with penalty balance were also presented. The penalty balance method can effectively refrain the parasitical stress on the premise of no additional degrees of freedom. The numeric experiment shows that the presented element not only is effective in improving greatly the numeric calculation precision of distorted grids but also has the universality.

Method for electromagnetic detection satellites scheduling based on genetic algorithm with alterable penalty coefficient

The electromagnetic detection satellite （EDS） is a type of earth observation satellites （EOSs）. The Information collected by EDSs plays an important role in some fields, such as industry, science and military. The scheduling of EDSs is a complex combinatorial optimization problem. Current research mainly focuses on the scheduling of imaging satellites and SAR satellites, but little work has been done on the scheduling of EDSs for its specific characteristics. A multi-satellite scheduling model is established, in which the specific constrains of EDSs are considered, then a scheduling algorithm based on the genetic algorithm （GA） is proposed. To deal with the specific constrains of EDSs, a penalty function method is introduced. However, it is hard to determine the appropriate penalty coefficient in the penalty function. Therefore, an adaptive adjustment mechanism of the penalty coefficient is designed to solve the problem, as well as improve the scheduling results. Experimental results are used to demonstrate the correctness and practicability of the proposed scheduling algorithm.

A PENALTY FUNCTION METHOD FOR THE PRINCIPAL-AGENT PROBLEM WITH AN INFINITE NUMBER OF INCENTIVE-COMPATIBILITY CONSTRAINTS UNDER MORAL HAZARD

In this paper,we propose an iterative algorithm to find the optimal incentive mechanism for the principal-agent problem under moral hazard where the number of agent action profiles is infinite,and where there are an infinite number of results that can be observed by the principal.This principal-agent problem has an infinite number of incentive-compatibility constraints,and we transform it into an optimization problem with an infinite number of constraints called a semi-infinite programming problem.We then propose an exterior penalty function method to find the optimal solution to this semi-infinite programming and illustrate the convergence of this algorithm.By analyzing the optimal solution obtained by the proposed penalty function method,we can obtain the optimal incentive mechanism for the principal-agent problem with an infinite number of incentive-compatibility constraints under moral hazard.

MIXED HYBRID PENALTY FINITE ELEMENT METHOD AND ITS APPLICATION

The penalty and hybrid methods are being much used in dealing with the general incompatible element, With the penalty method convergence can always be assured, but comparatively speaking its accuracy is lower, and the condition number and sparsity are not so good. With the hybrid method, convergence can be assured only when the rank condition is satisfied. So the construction of the element is extremely limited. This paper presents the mixed hybrid penalty element method, which combines the two methods together. And it is proved theoretically that this new method is convergent, and it has the same accuracy, condition number and sparsity as the compatible element. That is to say, they are optimal to each other.Finally, a new triangle element for plate bending with nine freedom degrees is constructed with this method (three degreesof freedom are given on each corner -- one displacement and tworotations), the calculating formula of the element stiffness matrix is almost the same as that of the old triangle element for plate bending with nine degrees of freedom But it is converged to true solution with arbitrary irregrlar triangle subdivision. If the true solution u?H3 with this method the linear and quadratic rates of convergence are obtianed for three bending moments and for the displacement and two rotations respectively.

A WEIGHTED PENALTY FINITE ELEMENT METHOD FOR THE ANALYSIS OF POWER-LAW FLUID FLOW PROBLEMS

In this paper, a new finite element method for the flow analysis of the viscous incompressible power-law fluid is proposed by the use of penalty-hybrid/mixed finite element formulation and by the introduction of an alternative perturbation, which is weighted by viscosity, of the continuity equation. A numerical example is presented to exhibit the efficiency of the method.

PENALTY FUNCTION METHOD OF CONTINUUM SHAPE OPTIMIZAION

The penalty function method of continuum shape optimization and its sensitivity analysis technique are presented. A relatively simple integrated shape optimization system is developed and used to optimize the design of the inner frame shape of a three-axis test table. The result shows that the method converges well, and the system is stable and reliable.