Results 261 to 270 of about 88,366 (316)
Some of the next articles are maybe not open access.
Conventional penalty optimization methods
Journal of Optimization Theory and Applications, 1986In a recent study [ibid. 39, 431-449 (1983; Zbl 0487.65039)], the effects of large penalty constants on Ritz penalty methods based on finite element approximations used in the solution of the control of a system governed by diffusion equation were established.
Ibiejugba, M. A., Olufeagba, B. J.
openaire +2 more sources
Finite Elements in Analysis and Design, 2003
Traditional methods for applying boundary conditions in finite element analysis require the mesh to conform to the geometry boundaries. This in turn requires complex meshing algorithms for automated mesh generation from CAD geometry, particularly when using quadrilateral and hexahedral elements.
B.W. Clark, D.C. Anderson
openaire +1 more source
Traditional methods for applying boundary conditions in finite element analysis require the mesh to conform to the geometry boundaries. This in turn requires complex meshing algorithms for automated mesh generation from CAD geometry, particularly when using quadrilateral and hexahedral elements.
B.W. Clark, D.C. Anderson
openaire +1 more source
Penalty and penalty-like methods for nonlinear HJB PDEs
Applied Mathematics and Computation, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christina C. Christara, Ruining Wu
openaire +1 more source
Nitsche’s boundary penalty method
2021The main objective of this chapter is to present a technique to treat Dirichlet boundary conditions in a natural way using a penalty method. This technique is powerful and has many extensions. In particular, the idea is reused in the next chapter for discontinuous Galerkin methods.
Alexandre Ern, Jean-Luc Guermond
openaire +1 more source
Journal of Global Optimization, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Schlüter, Martin, Gerdts, Matthias
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Schlüter, Martin, Gerdts, Matthias
openaire +2 more sources
1994
Exact penalty methods for the solution of constrained optimization problems are based on the construction of a function whose unconstrained minilnizing points are also solution of the constrained problem. In the first part of this paper we recall some definitions concerning exactness properties of penalty functions, of barrier functions, of augmented ...
openaire +2 more sources
Exact penalty methods for the solution of constrained optimization problems are based on the construction of a function whose unconstrained minilnizing points are also solution of the constrained problem. In the first part of this paper we recall some definitions concerning exactness properties of penalty functions, of barrier functions, of augmented ...
openaire +2 more sources
Mathematical Programming, 1991
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gamble, A. B. +2 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Gamble, A. B. +2 more
openaire +2 more sources
Classification of Some Penalty Methods
2009Optimization problems arise in science, engineering, economy, etc. and we need to find the best solutions for each reality. The methods used to solve these problems depend on several factors, including the amount and type of accessible information, the available algorithms for solving them, and, obviously, the intrinsic characteristics of the problem.
Correia, Aldina +3 more
openaire +2 more sources
1992
Since the early 1970s, some estimation-type identification procedures have been proposed. They are to choose the orders k and i minimizing $$P(k,i) = {\text{ln}}{\overset{\lower0.5em\hbox{$\smash{\scriptscriptstyle\smile}$}}{\sigma }}\mathop{{k,i}}\limits^{2} + (k + i)\frac{{C(T)}}{T}$$ , where σ k,i 2 is an estimate of the white noise variance ...
openaire +1 more source
Since the early 1970s, some estimation-type identification procedures have been proposed. They are to choose the orders k and i minimizing $$P(k,i) = {\text{ln}}{\overset{\lower0.5em\hbox{$\smash{\scriptscriptstyle\smile}$}}{\sigma }}\mathop{{k,i}}\limits^{2} + (k + i)\frac{{C(T)}}{T}$$ , where σ k,i 2 is an estimate of the white noise variance ...
openaire +1 more source
2008
Penalty and barrier methods are procedures for approximating constrained optimization problems by unconstrained problems. The approximation is accomplished in the case of penalty methods by adding to the objective function a term that prescribes a high cost for violation of the constraints, and in the case of barrier methods by adding a term that ...
David G. Luenberger, Yinyu Ye
openaire +1 more source
Penalty and barrier methods are procedures for approximating constrained optimization problems by unconstrained problems. The approximation is accomplished in the case of penalty methods by adding to the objective function a term that prescribes a high cost for violation of the constraints, and in the case of barrier methods by adding a term that ...
David G. Luenberger, Yinyu Ye
openaire +1 more source