Filtern
Erscheinungsjahr
- 2019 (13) (entfernen)
Dokumenttyp
- Dissertation (12)
- Habilitation (1)
Volltext vorhanden
- ja (13) (entfernen)
Schlagworte
- Optimierung (3)
- Familienbetrieb (2)
- Finanzierung (2)
- Stichprobe (2)
- Amtliche Statistik (1)
- Analysis (1)
- Analysis on fractals (1)
- Approximation (1)
- Assistance System (1)
- Automation of Simulation (1)
- BWL (1)
- Business Angel (1)
- Business Angels (1)
- Capital structure (1)
- Computational Statistics (1)
- Coposititive, Infinite Dimension (1)
- Discrete optimization (1)
- Diskretisierung (1)
- Entrepreneurial Finance (1)
- Epistemology of Simulation (1)
- Family business (1)
- Family firm (1)
- Firm performance (1)
- Fraktal (1)
- Haushalt (1)
- Hypothesis Testing (1)
- Initial Coin Offerings (ICOs) (1)
- Kapitalstruktur (1)
- M&A decision criteria (1)
- M&A process (1)
- Maschinelles Lernen (1)
- Meta-analysis (1)
- Mixed-integer optimization (1)
- Modellierung (1)
- Multi-Level Modelling (1)
- Multilineare Algebra (1)
- Nichtlineare Optimierung (1)
- Nonlocal convection-diffusion (1)
- Numerische Mathematik (1)
- Penalized Maximum Likelihood (1)
- Prediction (1)
- Regression (1)
- Regression estimator, household surveys, calibration, weighting, integrated weighting (1)
- Regressionsanalyse (1)
- Regressionsmodell (1)
- Risikokapital (1)
- Robust Statistics (1)
- Schätzfunktion (1)
- Schätzung (1)
- Simulation Studies (1)
- Statistical Properties (1)
- Strategische Planung (1)
- Subset Selection (1)
- Unternehmensgründung (1)
- Unternehmenskauf (1)
- Venture Capital (VC) (1)
- acquisition (1)
- choice-based conjoint analysis (1)
- cluster analysis (1)
- decision making pattern (1)
- empirical taxonomy (1)
- family business (1)
- family management (1)
- finite element method (1)
- fractional Poisson equation (1)
- generational stage (1)
- local limit (1)
- multilevel Toeplitz (1)
- multilinear algebra (1)
- non-family business (1)
- nonlinear optimization (1)
- numerical analysis (1)
- pre-acquisition phase (1)
- shape optimization (1)
- strategic acquisition (1)
- target screening and selection (1)
- tensor methods (1)
- transgenerational intention (1)
- weighting (1)
Institut
- Fachbereich 4 (13) (entfernen)
Many combinatorial optimization problems on finite graphs can be formulated as conic convex programs, e.g. the stable set problem, the maximum clique problem or the maximum cut problem. Especially NP-hard problems can be written as copositive programs. In this case the complexity is moved entirely into the copositivity constraint.
Copositive programming is a quite new topic in optimization. It deals with optimization over the so-called copositive cone, a superset of the positive semidefinite cone, where the quadratic form x^T Ax has to be nonnegative for only the nonnegative vectors x. Its dual cone is the cone of completely positive matrices, which includes all matrices that can be decomposed as a sum of nonnegative symmetric vector-vector-products.
The related optimization problems are linear programs with matrix variables and cone constraints.
However, some optimization problems can be formulated as combinatorial problems on infinite graphs. For example, the kissing number problem can be formulated as a stable set problem on a circle.
In this thesis we will discuss how the theory of copositive optimization can be lifted up to infinite dimension. For some special cases we will give applications in combinatorial optimization.