Optimality Conditions and Numerical Methods for a Continuous Reformulation of Cardinality Constrained Optimization Problems
- Weitere Titel
-
Optimalitätsbedingungen und Numerische Verfahren für eine kontinuierliche Umformulierung von Optimierungsproblemen mit Kardinalitätsrestriktionen
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Darmstadt, Technische Universität Darmstadt, Dissertation, 2018
- Klassifikation
-
Mathematik
- Schlagwort
-
Constrained optimization
Cations
Quadratic programming
- Ereignis
-
Veröffentlichung
- (wo)
-
Darmstadt
- (wer)
-
Universitäts- und Landesbibliothek Darmstadt
- (wann)
-
2018
- Urheber
- Beteiligte Personen und Organisationen
-
Schwartz, Alexandra
Kanzow, Christian
- URN
-
urn:nbn:de:tuda-tuprints-77402
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:24 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Bucher, Max
- Schwartz, Alexandra
- Kanzow, Christian
- Universitäts- und Landesbibliothek Darmstadt
Entstanden
- 2018
Ähnliche Objekte (12)
Sequential optimality conditions for cardinality-constrained optimization problems with applications
Cardinality-Constrained Multi-objective Optimization: Novel Optimality Conditions and Algorithms
Sequential optimality conditions for cardinality-constrained optimization problems with applications
Cardinality-Constrained Discrete Optimization for Regression
On a Cardinality Constrained Multicriteria Knapsack Problem
Polyhedral aspects of cardinality constrained combinatorial optimization problems
Convergent Inexact Penalty Decomposition Methods for Cardinality-Constrained Problems
An Augmented Lagrangian Method for Cardinality-Constrained Optimization Problems
A Low-Cost Alternating Projection Approach for a Continuous Formulation of Convex and Cardinality Constrained Optimization
Reformulation of general chance constrained problems using the penalty functions
Bounds on efficient outcomes for large-scale cardinality-constrained Markowitz problems
Variation margins, fire sales, and information-constrained optimality
Sequential optimality conditions for cardinality-constrained optimization problems with applications
Cardinality-Constrained Multi-objective Optimization: Novel Optimality Conditions and Algorithms
Sequential optimality conditions for cardinality-constrained optimization problems with applications
Cardinality-Constrained Discrete Optimization for Regression
On a Cardinality Constrained Multicriteria Knapsack Problem
Polyhedral aspects of cardinality constrained combinatorial optimization problems
Convergent Inexact Penalty Decomposition Methods for Cardinality-Constrained Problems
An Augmented Lagrangian Method for Cardinality-Constrained Optimization Problems
A Low-Cost Alternating Projection Approach for a Continuous Formulation of Convex and Cardinality Constrained Optimization
Reformulation of general chance constrained problems using the penalty functions
Bounds on efficient outcomes for large-scale cardinality-constrained Markowitz problems
Variation margins, fire sales, and information-constrained optimality
Sequential optimality conditions for cardinality-constrained optimization problems with applications
Cardinality-Constrained Multi-objective Optimization: Novel Optimality Conditions and Algorithms
Sequential optimality conditions for cardinality-constrained optimization problems with applications
Cardinality-Constrained Discrete Optimization for Regression
On a Cardinality Constrained Multicriteria Knapsack Problem
Polyhedral aspects of cardinality constrained combinatorial optimization problems
Convergent Inexact Penalty Decomposition Methods for Cardinality-Constrained Problems
An Augmented Lagrangian Method for Cardinality-Constrained Optimization Problems
A Low-Cost Alternating Projection Approach for a Continuous Formulation of Convex and Cardinality Constrained Optimization
Reformulation of general chance constrained problems using the penalty functions
Bounds on efficient outcomes for large-scale cardinality-constrained Markowitz problems