A Primal-Dual Augmented Lagrangian Method for the Solution of Convex Semidefinite Programming Problems
- Weitere Titel
-
Eine Primal-Dual Augmented Lagrangian Methode zur Lösung von konvexen semidefiniten Programmierproblemen
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Erlangen, Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU), Dissertation, 2024
- Schlagwort
-
Semidefinite Optimierung
Konvexe Optimierung
Nichtlineare Optimierung
Erweiterte Lagrange-Methode
- Ereignis
-
Veröffentlichung
- (wo)
-
Erlangen
- (wer)
-
Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU)
- (wann)
-
2024
- Urheber
- Beteiligte Personen und Organisationen
-
Stingl, Michael
Kočvara, Michal
Stingl, Michael
- DOI
-
10.25593/open-fau-752
- URN
-
urn:nbn:de:101:1-2406140505103.140982140259
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
02.04.2025, 09:48 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
- Kavand, Arefeh
- Stingl, Michael
- Kočvara, Michal
- Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU)
Entstanden
- 2024
Ähnliche Objekte (12)
A Primal-Dual Augmented Lagrangian Penalty-Interior-Point Algorithm for Nonlinear Programming
Augmented primal dual methods for linear programs and SOC problems
Convex Feasibility via Monotropic Programming
Polynomial Primal-Dual Cone Affine Scaling for Semidefinite Programming
First-order augmented Lagrangian methods for state constraint problems
Augmented Lagrangian and Proximal Methods for Constrained Structured Optimization
Augmented Lagrangian Methods for State Constrained Optimal Control Problems
Duality for convex composed programming problems
Advances in convex optimization: conic programming
The design of exponential neighborhoods - a primal approach to integer programming
Hordes Primal
A strictly feasible sequential convex programming method
A Primal-Dual Augmented Lagrangian Penalty-Interior-Point Algorithm for Nonlinear Programming
Augmented primal dual methods for linear programs and SOC problems
Convex Feasibility via Monotropic Programming
Polynomial Primal-Dual Cone Affine Scaling for Semidefinite Programming
First-order augmented Lagrangian methods for state constraint problems
Augmented Lagrangian and Proximal Methods for Constrained Structured Optimization
Augmented Lagrangian Methods for State Constrained Optimal Control Problems
Duality for convex composed programming problems
Advances in convex optimization: conic programming
The design of exponential neighborhoods - a primal approach to integer programming
Hordes Primal
A strictly feasible sequential convex programming method
A Primal-Dual Augmented Lagrangian Penalty-Interior-Point Algorithm for Nonlinear Programming
Augmented primal dual methods for linear programs and SOC problems
Convex Feasibility via Monotropic Programming
Polynomial Primal-Dual Cone Affine Scaling for Semidefinite Programming
First-order augmented Lagrangian methods for state constraint problems
Augmented Lagrangian and Proximal Methods for Constrained Structured Optimization
Augmented Lagrangian Methods for State Constrained Optimal Control Problems
Duality for convex composed programming problems
Advances in convex optimization: conic programming
The design of exponential neighborhoods - a primal approach to integer programming
Hordes Primal