Results 271 to 280 of about 88,366 (316)
Some of the next articles are maybe not open access.
On penalty methods for interelement constraints
Computer Methods in Applied Mechanics and Engineering, 1982Abstract The problem of enforcing constraints across interelement boundaries can be treated directly in the construction of the basis or by using multiplier or penalty methods. We demonstrate that the multiplier approach can induce linear dependence in the constraints and lead to a singular system of equations if appropriate precautions are not ...
Carey, G. F., Kabaila, A., Utku, M.
openaire +1 more source
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
Penalty Methods in Nonlinear Programming (Survey)
Mathematische Operationsforschung und Statistik. Series Optimization, 1977In this paper general interior and exterior penalty methods are considered and their essential properties are summarized. Penalty-shifting methods are also contained in this survey.
Grossmann, Ch., Kaplan, A. A.
openaire +2 more sources
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
Generalized Penalty Methods in Topological Spaces
SIAM Journal on Applied Mathematics, 1969Abstract : The sequential unconstrained minimization technique solves a constrained minimization problem by minimizing a sequence of auxiliary functions. Assuming the existence of a sequence of points related to the minimizing sequence, the usual convergence results are shown to hold in a general topological space.
Fiacco, A. V., Jones, A. P.
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
Topology Optimization by Penalty (TOP) Method
Computer Methods in Applied Mechanics and Engineering, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources