A Generalization of Normal Sets
Year
: 2017
Abstract: Monotonic optimization is one of specially structured nonconvex problems that is frequently used in
application. Many nonconvex optimization problems in engineering could be directly converted to a
monotonic optimization problem. Polyblock approximation algorithm is the early solution method for these
problems. This algorithm is mainly based on the concept of normal sets. In this paper we propose a
generalization of normal sets. We show that some theoretical results on already defined normal sets are true
in the new context. This extension permits us to model more optimization problems in the monotonic
optimization framework.
application. Many nonconvex optimization problems in engineering could be directly converted to a
monotonic optimization problem. Polyblock approximation algorithm is the early solution method for these
problems. This algorithm is mainly based on the concept of normal sets. In this paper we propose a
generalization of normal sets. We show that some theoretical results on already defined normal sets are true
in the new context. This extension permits us to model more optimization problems in the monotonic
optimization framework.
Keyword(s): Monotonic optimization,normal sets,partially ordered cones
Collections
:
-
Statistics
A Generalization of Normal Sets
Show full item record
| contributor author | احسان منبتی | en |
| contributor author | حمید ترابی اردکانی | en |
| contributor author | Ehsan Monabbati | fa |
| contributor author | Hamid Torabi Ardakani | fa |
| date accessioned | 2020-06-06T14:30:07Z | |
| date available | 2020-06-06T14:30:07Z | |
| date copyright | 5/3/2017 | |
| date issued | 2017 | |
| identifier uri | https://libsearch.um.ac.ir:443/fum/handle/fum/3399399 | |
| description abstract | Monotonic optimization is one of specially structured nonconvex problems that is frequently used in application. Many nonconvex optimization problems in engineering could be directly converted to a monotonic optimization problem. Polyblock approximation algorithm is the early solution method for these problems. This algorithm is mainly based on the concept of normal sets. In this paper we propose a generalization of normal sets. We show that some theoretical results on already defined normal sets are true in the new context. This extension permits us to model more optimization problems in the monotonic optimization framework. | en |
| language | English | |
| title | A Generalization of Normal Sets | en |
| type | Conference Paper | |
| contenttype | External Fulltext | |
| subject keywords | Monotonic optimization | en |
| subject keywords | normal sets | en |
| subject keywords | partially ordered cones | en |
| identifier link | https://profdoc.um.ac.ir/paper-abstract-1072665.html | |
| identifier articleid | 1072665 |