Results 261 to 270 of about 117,656 (306)
Some of the next articles are maybe not open access.
Computing, 1972
Das allgemeine konvexe Optimierungsproblemf(x)=Min! unter den Restriktionenx∈Q, g(x)∈Y in reflexiven Banachraumen wird als zweistufige Optimierungs-aufgabe gedeutet und mit der Methode der Regularisierung behandelt. Es ergibt sich so eine Penalty-Methode fur Aufgaben mit unendlich vielen Nebenbedingungen.
openaire +2 more sources
Das allgemeine konvexe Optimierungsproblemf(x)=Min! unter den Restriktionenx∈Q, g(x)∈Y in reflexiven Banachraumen wird als zweistufige Optimierungs-aufgabe gedeutet und mit der Methode der Regularisierung behandelt. Es ergibt sich so eine Penalty-Methode fur Aufgaben mit unendlich vielen Nebenbedingungen.
openaire +2 more sources
On penalty methods for minimax problems
Zeitschrift für Operations Research, 1986Minimax problems play an important role in different fields of nonlinear analysis (game theory, duality theory, fixed point theory). After the introduction of the problem and some of its basic properties the paper investigates penalty methods to solve minimax problems.
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
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 Barrier Methods: A Unified Framework
SIAM Journal on Optimization, 1999Summary: It is established that many optimization problems may be formulated in terms of minimizing a function \(x\rightarrow f_0 (x) + H_\infty(f_1 (x), f_2 (x),\ldots,f_m (x)) + L_\infty(Ax-b)\), where the \(f_i\) are closed functions defined on \(\mathbb{R}^N\), and where \(H_\infty\) and \(L_\infty\) are the recession functions of closed, proper ...
openaire +2 more sources
Analysis of penalty parameters for interior penalty Galerkin methods
COMPEL - The international journal for computation and mathematics in electrical and electronic engineering, 2019Purpose The purpose of this paper is to analyse the influence of penalty parameters for an interior penalty Galerkin method, namely, the symmetric interior penalty Galerkin method. Design/methodology/approach First of all, the solution of a simple model problem is computed and compared to the exact solution, which is a periodic function. Afterwards,
Sebastian Straßer, Hans-Georg Herzog
openaire +1 more source
A penalty method for the Generalized Method of Moments
2014 IEEE Antennas and Propagation Society International Symposium (APSURSI), 2014When the Electric Field Integral Equation is discretized via the Generalized Method of Moments, small current irregularities sometimes appear. We propose a cause for these current deviations and advance a solution based on a Nitsche-type constraint based stabilization method.
D. Dault, B. Shanker
openaire +1 more source
2012
Penalties and barriers feature prominently in two areas of modern optimization theory. First, both devices are employed to solve constrained optimization problems [96, 183, 226]. The general idea is to replace hard constraints by penalties or barriers and then exploit the well-oiled machinery for solving unconstrained problems.
openaire +1 more source
Penalties and barriers feature prominently in two areas of modern optimization theory. First, both devices are employed to solve constrained optimization problems [96, 183, 226]. The general idea is to replace hard constraints by penalties or barriers and then exploit the well-oiled machinery for solving unconstrained problems.
openaire +1 more source
Computational Mechanics, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +4 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