Variable ordering structures in vector optimization. - In: Recent developments in vector optimization, (2012), S. 95-126
Numerical procedures in multiobjective optimization with variable ordering structures. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2012. - Online-Ressource (PDF-Datei: 24 S., 365 KB). - (Preprint ; M12,05)
Multiobjective optimization problems with a variable ordering structure instead of a partial ordering have recently gained interest due to several applications. In the last years a basic theory has been developed for such problems. The difficulty in their study arises from the fact that the binary relations of the variable ordering structure, which are defined by a cone-valued map which associates to each element of the image space a pointed convex cone of dominated or preferred directions, are in general not transitive. - In this paper we propose numerical approaches for solving such optimization problems. For continuous problems a method is presented using scalarization functionals which allows the determination of an approximation of the infinite optimal solution set. For discrete problems the Jahn-Graef-Younes method known from multiobjective optimization with a partial ordering is adapted to allow the determination of all optimal elements with a reduced effort compared to a pairwise comparison.
http://www.db-thueringen.de/servlets/DocumentServlet?id=20485
Optimization-based secure multi-hop localization in wireless ad hoc networks. - In: 17th GI/ITG Conference on Communication in Distributed Systems (KiVS 2011), (2011), S. 182-187
http://dx.doi.org/10.4230/OASIcs.KiVS.2011.182
A k-server problem with parallel requests and unit distances. - Ilmenau : Techn. Univ., Inst. für Mathematik, 2011. - Online-Ressource (PDF-Datei: 11 S., 207,5 KB). - (Preprint ; M11,16)
In the paper a k-server problem with parallel requests where several servers can also be located on one point is considered. We show that a HARMONIC_p k-server algorithm is competitive against an adaptive online adversary in case of unit distances.
http://www.db-thueringen.de/servlets/DocumentServlet?id=19013
Monotony analysis and sparse-grid integration for nonlinear chance constrained process optimization. - In: Engineering optimization, ISSN 1029-0273, Bd. 43 (2011), 10, S. 1019-1041
http://dx.doi.org/10.1080/0305215X.2010.532552
Using sparse-grid methods to improve computation efficiency in solving dynamic nonlinear chance-constrained optimization problems. - In: Industrial & engineering chemistry research, ISSN 1520-5045, Bd. 50 (2011), 9, S. 5693-5704
https://doi.org/10.1021/ie102426w
Evaluating integration approaches to robust process optimization and control using chance constrained programming. - In: IEEE International Symposium on Computer-Aided Control System Design (CACSD), 2010, ISBN 978-1-4244-5355-9, (2010), S. 1079-1084
http://dx.doi.org/10.1109/CACSD.2010.5612699
DA stochastic dynamic programming, stochastic dynamic distance optimal partitioning problems and partitions-requirements-matrices
1. Aufl.. - Göttingen : Cuvillier, 2010. - 298 S.Literaturverz. S. 284 - 286
Secure multi-hop localization in wireless ad hoc networks. - In: Crossing borders within the ABC, (2010), S. 761-768
http://www.db-thueringen.de/servlets/DocumentServlet?id=17364
A moving horizon approach to a chance constrained nonlinear dynamic optimization problem. - In: IFAC Proceedings Volumes, ISSN 1474-6670, Bd. 42 (2009), 2, S. 103-107
In this paper, a chance constrained nonlinear dynamic optimization problem is considered, which will be investigated by using a moving horizon scheme. In each horizon, the chance constraints will be written (transformed) in terms of those (input) random variables with known probability distributions by using monotonicity relations. Some definitions and properties related to the required monotonicity properties are introduced. For the application problem considered these monotonicity properties hold automatically true. The chance constraints and their gradients are evaluated by computing multivariate normal integrals using direct numerical integration. Numerical experimentation results will also be reported.
https://doi.org/10.3182/20090506-3-SF-4003.00019