Homotopy Methods for Linear Optimization Problems with Sparsity Penalty and Applications
- Weitere Titel
-
Homotopie-Methoden für Lineare Optimierungsprobleme mit L1-Strafterm und Anwendungen
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Braunschweig, Technische Universität Braunschweig, Dissertation, 2018
- Schlagwort
- Ereignis
-
Veröffentlichung
- (wo)
-
Braunschweig
- (wer)
-
Technische Universität Braunschweig
- (wann)
-
2018
- Urheber
-
Brauer, Christoph
- Beteiligte Personen und Organisationen
- DOI
-
10.24355/dbbs.084-201804250929-0
- URN
-
urn:nbn:de:gbv:084-2018042509304
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 10:57 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
- Brauer, Christoph
- Lorenz, Dirk
- Technische Universität Braunschweig
Entstanden
- 2018
Ähnliche Objekte (12)
Computational approaches to non-convex, sparsity-inducing multi-penalty regularization
Optimization of Sparsity-Constrained Neural Networks as a Mixed Integer Linear Program: NN2MILP
Optimization of Sparsity-Constrained Neural Networks as a Mixed Integer Linear Program : NN2MILP
A Unifying Framework for Sparsity-Constrained Optimization
Theoretical Aspects in Penalty Hyperparameters Optimization
Relative Cauchy Evolution for Linear Homotopy AQFTs
Nonlinear multiobjective optimization : a generalized homotopy approach
On nondegenerate M-stationary points for sparsity constrained nonlinear optimization
On nondegenerate M-stationary points for sparsity constrained nonlinear optimization
Linear Yang–Mills Theory as a Homotopy AQFT
Predictive stability criteria for penalty selection in linear models
Reconstruction using local sparsity
Computational approaches to non-convex, sparsity-inducing multi-penalty regularization
Optimization of Sparsity-Constrained Neural Networks as a Mixed Integer Linear Program: NN2MILP
Optimization of Sparsity-Constrained Neural Networks as a Mixed Integer Linear Program : NN2MILP
A Unifying Framework for Sparsity-Constrained Optimization
Theoretical Aspects in Penalty Hyperparameters Optimization
Relative Cauchy Evolution for Linear Homotopy AQFTs
Nonlinear multiobjective optimization : a generalized homotopy approach
On nondegenerate M-stationary points for sparsity constrained nonlinear optimization
On nondegenerate M-stationary points for sparsity constrained nonlinear optimization
Linear Yang–Mills Theory as a Homotopy AQFT
Predictive stability criteria for penalty selection in linear models
Reconstruction using local sparsity
Computational approaches to non-convex, sparsity-inducing multi-penalty regularization
Optimization of Sparsity-Constrained Neural Networks as a Mixed Integer Linear Program: NN2MILP
Optimization of Sparsity-Constrained Neural Networks as a Mixed Integer Linear Program : NN2MILP
A Unifying Framework for Sparsity-Constrained Optimization
Theoretical Aspects in Penalty Hyperparameters Optimization
Relative Cauchy Evolution for Linear Homotopy AQFTs
Nonlinear multiobjective optimization : a generalized homotopy approach
On nondegenerate M-stationary points for sparsity constrained nonlinear optimization
On nondegenerate M-stationary points for sparsity constrained nonlinear optimization
Linear Yang–Mills Theory as a Homotopy AQFT
Predictive stability criteria for penalty selection in linear models