| dc.contributor.author | Correia, Aldina | |
| dc.contributor.author | Matias, João | |
| dc.contributor.author | Mestre, Pedro | |
| dc.contributor.author | Serôdio, Carlos | |
| dc.date.accessioned | 2014-02-24T15:07:53Z | |
| dc.date.available | 2014-02-24T15:07:53Z | |
| dc.date.issued | 2010 | |
| dc.description.abstract | Optimization 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. There are many kinds of optimization problems and, consequently, many kinds of methods to solve them. When the involved functions are nonlinear and their derivatives are not known or are very difficult to calculate, these methods are more rare. These kinds of functions are frequently called black box functions. To solve such problems without constraints (unconstrained optimization), we can use direct search methods. These methods do not require any derivatives or approximations of them. But when the problem has constraints (nonlinear programming problems) and, additionally, the constraint functions are black box functions, it is much more difficult to find the most appropriate method. Penalty methods can then be used. They transform the original problem into a sequence of other problems, derived from the initial, all without constraints. Then this sequence of problems (without constraints) can be solved using the methods available for unconstrained optimization. In this chapter, we present a classification of some of the existing penalty methods and describe some of their assumptions and limitations. These methods allow the solving of optimization problems with continuous, discrete, and mixing constraints, without requiring continuity, differentiability, or convexity. Thus, penalty methods can be used as the first step in the resolution of constrained problems, by means of methods that typically are used by unconstrained problems. We also discuss a new class of penalty methods for nonlinear optimization, which adjust the penalty parameter dynamically. | por |
| dc.identifier.doi | 10.1007/978-0-8176-4897-8_12 | pt_PT |
| dc.identifier.isbn | 978-0-8176-4896-1 | |
| dc.identifier.isbn | 978-0-8176-4897-8 | |
| dc.identifier.uri | http://hdl.handle.net/10400.22/4032 | |
| dc.language.iso | eng | por |
| dc.peerreviewed | yes | por |
| dc.publisher | Springer | por |
| dc.relation.publisherversion | http://link.springer.com/chapter/10.1007%2F978-0-8176-4897-8_12 | por |
| dc.title | Classification of some penalty methods | por |
| dc.type | book part | |
| dspace.entity.type | Publication | |
| oaire.citation.endPage | 140 | por |
| oaire.citation.startPage | 131 | por |
| oaire.citation.title | Integral Methods in Science and Engineering, Volume 2: Computational Aspects | por |
| oaire.citation.volume | Vol. 2 | por |
| rcaap.rights | closedAccess | por |
| rcaap.type | bookPart | por |
