Name: | Description: | Size: | Format: | |
---|---|---|---|---|
802.55 KB | Adobe PDF |
Advisor(s)
Abstract(s)
In Nonlinear Optimization Penalty and Barrier
Methods are normally used to solve Constrained Problems.
There are several Penalty/Barrier Methods and they are used in
several areas from Engineering to Economy, through Biology,
Chemistry, Physics among others. In these areas it often
appears Optimization Problems in which the involved functions
(objective and constraints) are non-smooth and/or their
derivatives are not know. In this work some Penalty/Barrier
functions are tested and compared, using in the internal process,
Derivative-free, namely Direct Search, methods. This work is
a part of a bigger project involving the development of an
Application Programming Interface, that implements several
Optimization Methods, to be used in applications that need to
solve constrained and/or unconstrained Nonlinear Optimization
Problems. Besides the use of it in applied mathematics research
it is also to be used in engineering software packages.
Description
Keywords
Non-smooth optimization Nonlinear programming Derivate-free Direct search Penalty/barrier methods
Citation
Publisher
International Association of Engineers