Results 231 to 240 of about 715,331 (285)
Some of the next articles are maybe not open access.
Mathematical Programming, 1991
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
A. B. Gamble +2 more
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
A. B. Gamble +2 more
openaire +2 more sources
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
A penalty method for nonlinear programming
RAIRO - Operations Research, 2019This paper presents a variant of logarithmic penalty methods for nonlinear convex programming. If the descent direction is obtained through a classical Newton-type method, the line search is done on a majorant function. Numerical tests show the efficiency of this approach versus classical line searches.
Larbi Bachir Cherif, Bachir Merikhi
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
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
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
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
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
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
Decrease of the Penalty Parameter in Differentiable Penalty Function Methods
Theoretical Economics Letters, 2011 We propose a simple modification to the differentiable penalty methods for solving nonlinear programming problems. This modification decreases the penalty parameter and the ill-conditioning of the penalty method and leads to a faster convergence to the optimal solution.
Roohollah Aliakbari Shandiz +1 more
exaly +3 more sources