de
en
Schliessen
Detailsuche
Bibliotheken
Projekt
Impressum
Datenschutz
de
en
Schliessen
Impressum
Datenschutz
zum Inhalt
Detailsuche
Schnellsuche:
OK
Ergebnisliste
Titel
Titel
Inhalt
Inhalt
Seite
Seite
Im Dokument suchen
Solution approaches for multiobjective convex quadratic and nonlinear optimization problems / vorgelegt von Marco Milano aus Ratingen. Wuppertal, Juli 2019
Inhalt
Introduction
Outline
Acknowledgments
Preliminaries
Singleobjective Optimization
Quadratic Optimization Problems
Linear Complementarity Problems
The Criss-Cross Method
Multiobjective Optimization Theory
The Weighted Sum Problem
The e-constraint Scalarization
Multiobjective Linear Programming Problems
Multiobjective Nonlinear Optimization and Descent Methods
Descent Directions and Optimality Conditions
Step Sizes
Search Directions
Steepest Descent Method
Newton Method
Quasi-Newton Methods
Weight-based Descent Methods
Numerical Experiment
Comparison of Multiobjective Descent Method and Weighted Sum
Multiobjective Convex Quadratic Programming
Unconstrained and Equality Constrained Problems
Linear Equality Constraints
Multiobjective Convex Quadratic Problems in Canonical Form
Efficient Active Sets
Weight Cells
Decomposition of the Efficient Set
Determination of Efficient Bases
The Algorithm
Computational Experiment
Determination of Boundary Segments
Multiobjective Convex Quadratic Programming Problems in General Form
Regularization of Positive Semidefinite Objective Matrices
Regularization of Objective Matrices
Multiobjective Mixed Linear and Convex Quadratic Problems
Computation of Polyhedral Weight Cells
Problems with Identical Objective Matrices
Diagonal Objective Matrices and Box Constraints
Efficient Active Sets
Arrangement of Hyperplanes
e-constraint Scalarization
Parameter Space Decomposition for e-constraint Scalarization Problems
Applications in Location Analysis
Conclusion
Approximation of Multiobjective Convex Optimization Problems
A Weight Space Decomposition for Multiobjective Convex Problems
Multiobjective Convex Piecewise-Linear Programming Problems
Weight Space Decomposition by Active Sets
Outer Approximation
Approximation of Convex Bodies by Polyhedra
Implementation of the Approximation Scheme
Approximation of the Weight Space Decomposition
Conclusion
Conclusion