| edoc-Server der Humboldt-Universität zu Berlin |
| Autor(en): | Jürgen Guddat; Francisco Guerra Vazquez; Dieter Nowack | Titel: | New embaddings for nonlinear multiobjective optimization problems I |
| Erscheinungsdatum: | 12.02.1998 |
| Erschienen in: |
Preprints aus dem Institut für Mathematik 2 (Mathematik-Preprints) ISSN: 0863-0976 |
| Volltext: | pdf (urn:nbn:de:kobv:11-10053357) |
| Fachgebiet(e): | Mathematik |
| Schlagwörter (eng): | singularities, pathfollowing methods, Multiobjective optimization, non-degenerate critical points |
| Herausgeber: | Humboldt-Universität zu Berlin, Mathematisch-Naturwissenschaftliche Fakultät II, Institut für Mathematik |
| Metadatenexport:
|
Endnote Bibtex |
| print on demand:
|
|
| Diese Seite taggen:
|
| Abstract (eng): | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| In a dialogue procedure the decision maker has to determine in each step the aspiration and reservation level expressing his wishes (goals). This leads to an optimization problem wich is not easy to solve in the nonconvex case (the known starting point is not feasible). We propose a modified standard embedding (one parametric optimization). This problem will be discussed from the point of view of parametric optimization (non-degenerate critical points, singularities, pathfollowing methods to describe numericalley a connected component in the set of stationary points and in the set of generalized critical points, respectively, and jumps (descent methods) to other connected components in these sets). This embedding is much better for computing a goal realizer or replying that the goal was not realistic than the embeddings considered in the literature before, but in the worst case we have to find all connected components and this is an open problem. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
| Zugriffsstatistik:
Bei Formatversionen eines Dokuments, die aus mehreren Dateien bestehen (insbesondere HTML), wird jeweils der monatlich höchste Zugriffswert auf eine der Dateien (Kapitel) des Dokuments angezeigt. Um die detaillierten Zugriffszahlen zu sehen, fahren Sie bitte mit dem Mauszeiger über die einzelnen Balken des Diagramms. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Gesamtzahl der Zugriffe seit May 2011:
|